Converting suffix trees into factor/suffix oracles

DOI10.1016/J.JDA.2006.11.005zbMath1146.05015OpenAlexW2008428831MaRDI QIDQ935847

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

linear time algorithmsuffix treesfactor recognitionindexing structuresuffix recognitioncompression methodfactor/suffix oraclenode merging

Mathematics Subject Classification ID

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

Related Items (2)

Statistical properties of factor oracles ⋮ Statistical Properties of Factor Oracles

Cites Work

• Substring search and repeat search using factor oracles
• Using factor oracles for machine improvisation
• Compror: On-line lossless data compression with a factor oracle.
• Reducing space for index implementation.
• Algorithms on Strings, Trees and Sequences
• COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
• Unnamed Item
• Unnamed Item

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