Efficient implementation of lazy suffix trees-Reference-Cited by-同舟云学术

Efficient implementation of lazy suffix trees

Published:2003 Issue:11 Volume:33 Page:1035-1049
ISSN:0038-0644
Container-title:Software: Practice and Experience
language:en
Short-container-title:Softw: Pract. Exper.

Author:

Giegerich R.,Kurtz S.,Stoye J.

Publisher

Wiley

Subject

Software

Reference31 articles.

1. The myriad virtues of subword trees. Combinatorial Algorithms on Words. Springer: Berlin, 1985; 85-96.

2. Algorithms on Strings, Trees, and Sequences. Cambridge University Press: Cambridge, 1997.

3. Who is interested in algorithms and why? Lessons from the Stony Brook Algorithms Repository. Proceedings 2nd Workshop on Algorithm Engineering. IEEE Press: New York, 1998; 204-212. http://www.mpi-sb.mpg.de/?wae98/PROCEEDINGS/.

4. Linear pattern matching algorithms. Proceedings 14th Annual IEEE Symposium on Switching and Automata Theory, 1973; 1-11.

5. A Space-Economical Suffix Tree Construction Algorithm

Cited by 69 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast parallel construction of variable-length Markov chains;BMC Bioinformatics;2021-10-09

2. Deduplicating future data transfer using data exchanged in the past to decrease mobile bandwidth usage;Proceedings of the 18th International Conference on Mobile Systems, Applications, and Services;2020-06-15

3. WITHDRAWN: Designing and computational validation of microarray probe sets for the diagnosis of viruses of non-human vertebrates;Molecular and Cellular Probes;2018-04

4. Conclusion and Future Work;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09

5. Parallel Cartesian Tree and Suffix Tree Construction;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09