In-place update of suffix array while recoding words

DOI10.1142/S0129054109007029MaRDI QIDQ3655534zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1142/S0129054109007029

zbMATH Keywords

grammatical inferencedynamic indexingsuffix arrayin-place updateword-interval

Mathematics Subject Classification ID

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

Recommendations

• Suffix Arrays on Words
• Dynamic extended suffix arrays
• On the number of elements to reorder when updating a suffix array
• scientific article; zbMATH DE number 1615289
• A four-stage algorithm for updating a Burrows-Wheeler transform

Cites work

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

Cited in

(2)

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

This page was built for publication: In-place update of suffix array while recoding words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655534)