On the sorting-complexity of suffix tree construction
Top Cited Papers
- 1 November 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (6), 987-1011
- https://doi.org/10.1145/355541.355547
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The string B-treeJournal of the ACM, 1999
- On Constructing Suffix Arrays in External MemoryLecture Notes in Computer Science, 1999
- Optimal Parallel Suffix Tree ConstructionJournal of Computer and System Sciences, 1997
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- Optimal logarithmic time randomized suffix tree constructionLecture Notes in Computer Science, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Open Problems in StringologyPublished by Springer Nature ,1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976