Suffix Arrays: A New Method for On-Line String Searches
- 1 October 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (5), 935-948
- https://doi.org/10.1137/0222058
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Improving quicksort performance with a codeword data structureIEEE Transactions on Software Engineering, 1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- A new distance metric on strings computable in linear timeDiscrete Applied Mathematics, 1988
- Sequence landscapesNucleic Acids Research, 1986
- Structural properties of the string statistics problemJournal of Computer and System Sciences, 1985
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- Open Problems in StringologyPublished by Springer Nature ,1985
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975