Factor oracles

Authors:
Maxime Crochemore;Lucian Ilie;Emine Seid-Hilmi
Affiliations:
Institut Gaspard-Monge, Université de Marne-la-Vallée, Marne-la-Vallée, France;Department of Computer Science, University of Western Ontario, London, Ontario, Canada;Department of Computer Science, University of Western Ontario, London, Ontario, Canada
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 8
Cited 0

Compror: on-line lossless data compression with a factor oracle

Information Processing Letters
Constructing Suffix Trees On-Line in Linear Time

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Factor Oracle: A New Structure for Pattern Matching

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Efficient Experimental String Matching by Weak Factor Recognition

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Compror: Compression with a Factor Oracle

DCC '01 Proceedings of the Data Compression Conference
An improved algorithm for finding longest repeats with a modified factor oracle

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Using Factor Oracles for Machine Improvisation

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Substring search and repeat search using factor oracles

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.