Optimal Parallel Suffix Tree Construction
- 31 August 1997
- journal article
- conference paper
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 55 (1) , 44-69
- https://doi.org/10.1006/jcss.1997.1496
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Improved deterministic parallel integer sortingInformation and Computation, 1991
- Optimal parallel suffix-prefix matching algorithm and applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel Merge SortSIAM Journal on Computing, 1988
- Sequence landscapesNucleic Acids Research, 1986
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithmsPublished by Association for Computing Machinery (ACM) ,1986
- Structural properties of the string statistics problemJournal of Computer and System Sciences, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- Rapid identification of repeated patterns in strings, trees and arraysPublished by Association for Computing Machinery (ACM) ,1972