Constructing Compressed Suffix Arrays with Large Alphabets
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Space Efficient Linear Time Construction of Suffix ArraysLecture Notes in Computer Science, 2003
- Optimal suffix tree construction with large alphabetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Opportunistic data structures with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Space and Time Efficient Algorithm for Constructing Compressed Suffix ArraysLecture Notes in Computer Science, 2002
- An analysis of the Burrows—Wheeler transformJournal of the ACM, 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
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Information Retrieval: Algorithms and HeuristicsPublished by Springer Nature ,1998
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993