IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS

DOI10.1142/S0129054109007029zbMath1186.68134MaRDI QIDQ3655534

Matthias Gallé, Pierre Peterlongo, François Coste

Publication date: 8 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

grammatical inferencesuffix arraydynamic indexingin-place updateword-interval

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

Searching for smallest grammars on large sequences and application to DNA ⋮ On the number of elements to reorder when updating a suffix array

Cites Work

• Replacing suffix trees with enhanced suffix arrays
• On updating suffix tree labels
• Engineering a lightweight suffix array construction algorithm
• On-line construction of suffix trees
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Grammar-based codes: a new class of universal lossless source codes
• An efficient, versatile approach to suffix sorting

This page was built for publication: IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS