Theoretical Computer Science
A very fast substring search algorithm
Communications of the ACM
Theoretical Computer Science
Text algorithms
Information Processing Letters
A fast string searching algorithm
Communications of the ACM
Minimal Forbidden Words and Factor Automata
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Compact Directed Acyclic Word Graphs
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Direct Construction of Compact Directed Acyclic Word Graphs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Compror: on-line lossless data compression with a factor oracle
Information Processing Letters
Database indexing for large DNA and protein sequence collections
The VLDB Journal — The International Journal on Very Large Data Bases
Reducing space for index implementation
Theoretical Computer Science
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
Substring search and repeat search using factor oracles
Information Processing Letters
OMax brothers: a dynamic yopology of agents for improvization learning
Proceedings of the 1st ACM workshop on Audio and music computing multimedia
Fast exact string matching algorithms
Information Processing Letters
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms
Anticipatory Behavior in Adaptive Learning Systems
New adaptive compressors for natural language text
Software—Practice & Experience
What/when causal expectation modelling applied to audio signals
Connection Science - Music, Brain, Cognition
Finite State Models for the Generation of Large Corpora of Natural Language Texts
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Statistical Properties of Factor Oracles
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Improving practical exact string matching
Information Processing Letters
Substring search and repeat search using factor oracles
Information Processing Letters
Statistical properties of factor oracles
Journal of Discrete Algorithms
Finite automata for generalized approach to backward pattern matching
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Emergent formal structures of factor oracle-driven musical improvisations
MCM'11 Proceedings of the Third international conference on Mathematics and computation in music
Performer-centered visual feedback for human-machine improvisation
Computers in Entertainment (CIE) - Theoretical and Practical Computer Applications in Entertainment
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
A fast string search algorithm for deep packet classification
Computer Communications
The exact online string matching problem: A review of the most recent results
ACM Computing Surveys (CSUR)
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
We introduce a new automaton on a word p, sequence of letters taken in an alphabet 驴, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as efficient as the ones that already exist using less memory and being more easy to implement.