Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
Top Cited Papers
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 397-406
- https://doi.org/10.1145/335305.335351
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Inverted files versus signature files for text indexingACM Transactions on Database Systems, 1998
- Self-indexing inverted files for fast text retrievalACM Transactions on Information Systems, 1996
- A time and space efficient data structure for string searching on large textsInformation Processing Letters, 1996
- On-line construction of suffix treesAlgorithmica, 1995
- Efficient implementation of suffix treesSoftware: Practice and Experience, 1995
- Two-way string-matchingJournal of the ACM, 1991
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Efficient data structures for range searching on a gridJournal of Algorithms, 1988
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983