1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2017
Alphabet-dependent Parallel Algorithm for Suffix Tree Construction for Pattern Searching
Freeson Kaniwa, Venu Madhav Kuthadi, Otlhapile Dinakenyane +1
Suffix trees have recently become very successful data structures in handling large data sequences such as DNA or Protein sequences. Consequently parallel architectures have become…
cs.DS2017★ 1 cited
Space-efficient K-MER algorithm for generalized suffix tree
Freeson Kaniwa, Venu Madhav Kuthadi, Otlhapile Dinakenyane +1
Suffix trees have emerged to be very fast for pattern searching yielding O (m) time, where m is the pattern size. Unfortunately their high memory requirements make it impractical t…