THE STRUCTURE OF FACTOR ORACLES Conferences

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.

authors

• CROCHEMORE, MAXIME
• Ilie, Lucian
• SEID-HILMI, EMINE

status

• published 

publication date

• August 2007

has subject area

• 08 Information and Computing Sciences (FoR)
• Computation Theory & Mathematics (Science Metrix)

published in

• International Journal of Foundations of Computer Science  Journal

presented at event

• 11th International Conference on Implementation and Application of Automata  Conference

keywords

• Computer Science
• Computer Science, Theory & Methods
• Science & Technology
• Technology
• factor oracle
• graph quotient
• string matching
• suffix tree
• suffix trie

Digital Object Identifier (DOI)

• 10.1142/s0129054107004978

start page

• 781

end page

• 797

volume

• 18

issue

• 04