Using static suffix array in dynamic application: Case of text compression by longest first substitution
- 1 February 2015
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 115 (2) , 175-181
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fast construction of space‐optimized recursive automatonSoftware: Practice and Experience, 2014
- On the number of elements to reorder when updating a suffix arrayJournal of Discrete Algorithms, 2012
- Two Efficient Algorithms for Linear Time Suffix Array ConstructionIEEE Transactions on Computers, 2010
- Linear-Time Text Compression by Longest-First SubstitutionAlgorithms, 2009
- Dynamic extended suffix arraysJournal of Discrete Algorithms, 2009
- Computing Longest Previous Factor in linear time and applicationsInformation Processing Letters, 2008
- A taxonomy of suffix array construction algorithmsACM Computing Surveys, 2007
- Replacing suffix trees with enhanced suffix arraysJournal of Discrete Algorithms, 2004
- Grammar-based codes: a new class of universal lossless source codesIEEE Transactions on Information Theory, 2000
- Data compression via textual substitutionJournal of the ACM, 1982