Space-efficient K-MER algorithm for generalized suffix tree

F Kaniwa, VM Kuthadi, O Dinakenyane… - arXiv preprint arXiv …, 2017 - arxiv.org
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 to work …
被引用次数：3 相关文章
[PDF] academia.edu

[PDF][PDF] SPACE-EFFICIENT K-MER ALGORITHM FOR GENERALISED SUFFIX TREE

F Kaniwa, VM Kuthadi, O Dinakenyane, H Schroeder - academia.edu
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 to work …

Space-efficient K-MER algorithm for generalized suffix tree

F Kaniwa, V Madhav Kuthadi, O Dinakenyane… - arXiv e …, 2017 - ui.adsabs.harvard.edu
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 to work …
[PDF] academia.edu

[PDF][PDF] SPACE-EFFICIENT K-MER ALGORITHM FOR GENERALISED SUFFIX TREE

F Kaniwa, VM Kuthadi, O Dinakenyane, H Schroeder - academia.edu
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 to work …