THE STRUCTURE OF FACTOR ORACLES-Reference-Cited by-同舟云学术

THE STRUCTURE OF FACTOR ORACLES

Published:2007-08 Issue:04 Volume:18 Page:781-797
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CROCHEMORE MAXIME¹²,ILIE LUCIAN³,SEID-HILMI EMINE³

Affiliation:

1. Institut Gaspard-Monge, Université de Marne-la-Vallée, F-77454 Marne-la- Vallée, Cedex 2, France

2. Department of Computer Science, King's College London, London WC2R 2LS, UK

3. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054107004978

Reference10 articles.

1. Efficient Experimental String Matching by Weak Factor Recognition*

2. The smallest automation recognizing the subwords of a text

3. Transducers and repetitions

4. Automata for Matching Patterns

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Q-Gram Variation for EBOM;Lecture Notes in Electrical Engineering;2012-11-06

2. Tuning the EBOM Algorithm with Suffix Jump;Lecture Notes in Electrical Engineering;2012-11-06

3. WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING;International Journal of Foundations of Computer Science;2011-06

4. Statistical properties of factor oracles;Journal of Discrete Algorithms;2011-03

5. On the Structure of Consistent Partitions of Substring Set of a Word;Frontiers in Algorithmics;2009