Compressed Compact Suffix Arrays
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Opportunistic data structures with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Indexing Text Using the Ziv-Lempel TrieLecture 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
- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix ArrayLecture Notes in Computer Science, 2000
- Efficient Implementation of Lazy Suffix TreesLecture Notes in Computer Science, 1999
- Membership in Constant Time and Almost-Minimum SpaceSIAM Journal on Computing, 1999
- Direct construction of compact directed acyclic word graphsLecture Notes in Computer Science, 1997
- TablesLecture Notes in Computer Science, 1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993