Access, Rank, and Select in Grammar-compressed Strings
- 12 November 2015
- book chapter
- Published by Springer Nature
- p. 142-154
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An efficient algorithm to test square-freeness of strings compressed by straight-line programsInformation Processing Letters, 2012
- FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTSInternational Journal of Foundations of Computer Science, 2012
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisetsACM Transactions on Algorithms, 2007
- Compressed full-text indexesACM Computing Surveys, 2007
- A simple storage scheme for strings achieving entropy boundsTheoretical Computer Science, 2007
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Application of Lempel–Ziv factorization to the approximation of grammar-based compressionTheoretical Computer Science, 2003
- Reachability and Distance Queries via 2-Hop LabelsSIAM Journal on Computing, 2003
- An analysis of the Burrows—Wheeler transformJournal of the ACM, 2001
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993