Abstract
The factor oracle is a relatively new data structure for the set of factors of a string which 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 for 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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Crochemore, M., Ilie, L., & Seid-Hilmi, E. (2006). Factor oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4094 LNCS, pp. 78–89). Springer Verlag. https://doi.org/10.1007/11812128_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
