The structure of Factor Oracles

Abstract : The factor oracle is a relatively new data structure for the set of factors of a string. It has been introduced by Allauzen, Crochemore, and Raffinot in 1999. It may recognize non-factors (hence the name "oracle") but its implementational simplicity and experimental behaviour are stunning; factor oracle based string matching has been conjectured optimal on average. However, its structure is not well understood. We take important steps in clarifying its structure by explaining how it can be obtained as a quotient of the trie of the set of factors. When seen this way, all known properties of the factor oracle become simple observations. Also, we introduce a framework where various oracles can be compared. The factor oracle is better than several natural ones obtained from the trie of the set of factors, the suffix and the factor automata, respectively.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00619689
Contributor : Maxime Crochemore <>
Submitted on : Thursday, February 14, 2013 - 5:12:46 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM
Long-term archiving on : Wednesday, May 15, 2013 - 2:20:08 AM

File

IJFCS07.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619689, version 1

Collections

Citation

Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi. The structure of Factor Oracles. International Journal of Foundations of Computer Science, World Scientific Publishing, 2007, 18 (4), pp.781-797. ⟨hal-00619689⟩

Share

Metrics

Record views

582

Files downloads

247