Converting suffix trees into factor/suffix oracles

DOI10.1016/J.JDA.2006.11.005MaRDI QIDQ935847zbMATH OpenOpenAlexFDO

Authors Irena Rusu

Publication date 8 August 2008

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2006.11.005

zbMATH Keywords

compression methodfactor recognitionfactor/suffix oracleindexing structurelinear time algorithmnode mergingsuffix recognitionsuffix trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• From Suffix Trees to Suffix Vectors
• The suffix tree of a tree and minimizing sequential transducers
• On suffix extensions in suffix trees
• scientific article; zbMATH DE number 1490002
• scientific article; zbMATH DE number 503334
• On the sorting-complexity of suffix tree construction
• Lempel-Ziv factorization powered by space efficient suffix trees
• Replacing suffix trees with enhanced suffix arrays

Cites work

• Algorithms on Strings, Trees and Sequences
• COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
• Compror: On-line lossless data compression with a factor oracle.
• scientific article; zbMATH DE number 1490002 (Why is no real title available?)
• scientific article; zbMATH DE number 1794216 (Why is no real title available?)
• Reducing space for index implementation.
• Substring search and repeat search using factor oracles
• Using factor oracles for machine improvisation

Cited in

(4)

• Compror: On-line lossless data compression with a factor oracle.
• From Suffix Trees to Suffix Vectors
• Statistical Properties of Factor Oracles
• Statistical properties of factor oracles

This page was built for publication: Converting suffix trees into factor/suffix oracles

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