Optimal logarithmic time randomized suffix tree construction
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Towards a theory of nearly constant time parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Large-scale assembly of DNA strings and space-efficient construction of suffix treesPublished by Association for Computing Machinery (ACM) ,1995
- Optimal parallel dictionary matching and compression (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Symmetry breaking for suffix tree constructionPublished by Association for Computing Machinery (ACM) ,1994
- Optimal parallel suffix tree constructionPublished by Association for Computing Machinery (ACM) ,1994
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Efficient and Elegant Subword-Tree ConstructionPublished by Springer Nature ,1985
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973