New text indexing functionalities of the compressed suffix arrays
Top Cited Papers
- 1 September 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 48 (2) , 294-313
- https://doi.org/10.1016/s0196-6774(03)00087-7
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 10 references indexed in Scilit:
- Low Redundancy in Static Dictionaries with Constant Query TimeSIAM Journal on Computing, 2001
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Efficient discovery of optimal word-association patterns in large text databasesNew Generation Computing, 2000
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Lempel—Ziv Index for q -GramsAlgorithmica, 1998
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Storing a sparse tableCommunications of the ACM, 1979
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975