Statistical properties of factor oracles

DOI10.1016/J.JDA.2010.10.001zbMath1215.62129OpenAlexW1968953973MaRDI QIDQ533409

Jérémie Bourdon, Irena Rusu

Publication date: 3 May 2011

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

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

zbMATH Keywords

average-case analysisfactor recognitionindexing structuresuffix recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Applications of statistics (62P99) Computing methodologies for text processing; mathematical typography (68U15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Converting suffix trees into factor/suffix oracles
• String overlaps, pattern matching, and nontransitive games
• On pattern frequency occurrences in a Markovian sequence
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Using factor oracles for machine improvisation
• Compror: On-line lossless data compression with a factor oracle.
• Reducing space for index implementation.
• THE STRUCTURE OF FACTOR ORACLES
• Profile of Tries
• COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES

This page was built for publication: Statistical properties of factor oracles