Factor oracle: A new structure for pattern matching
From MaRDI portal
Recommendations
Cited in
(27)- Average-optimal string matching
- Fast string matching for DNA sequences
- Compact suffix automata representations for searching long patterns
- A very fast string matching algorithm based on condensed alphabets
- Automata evaluation and text search protocols with simulation-based security
- Finite automata for generalized approach to backward pattern matching
- The factor automaton.
- The finite automata approaches in stringology
- THE STRUCTURE OF FACTOR ORACLES
- Factor Automata of Automata and Applications
- Statistical Properties of Factor Oracles
- scientific article; zbMATH DE number 1794216 (Why is no real title available?)
- Linear and efficient string matching algorithms based on weak factor recognition
- Music and combinatorics on words: a historical survey
- Creating improvisations on chord progressions using suffix trees
- Faster string matching based on hashing and bit-parallelism
- Statistical properties of factor oracles
- String Processing and Information Retrieval
- Constructing factor oracles
- Factor Oracles
- Parallel String Matching
- Computationally secure pattern matching in the presence of malicious adversaries
- Substring search and repeat search using factor oracles
- General suffix automaton construction algorithm and space bounds
- Fast exact string matching algorithms
- Converting suffix trees into factor/suffix oracles
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
This page was built for publication: Factor oracle: A new structure for pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4496245)
