EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM

DOI10.1142/S0129054109006991zbMath1187.68180MaRDI QIDQ3655531

Simone Faro, Thierry Lecroq

Publication date: 8 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

string matchingautomatontext processingexperimental algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (13)

On-line string matching in highly similar DNA sequences ⋮ A Bit-Parallel Exact String Matching Algorithm for Small Alphabet ⋮ Fast and flexible packed string matching ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ String matching with lookahead ⋮ Designing optimal- and fast-on-average pattern matching algorithms ⋮ Faster string matching based on hashing and bit-parallelism ⋮ Fast searching in packed strings ⋮ Boosting Pattern Matching Performance via k-bit Filtering ⋮ Fast string matching for DNA sequences ⋮ Fast Searching in Packed Strings ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ Parallel String Matching

Cites Work

• Unnamed Item
• Unnamed Item
• Fast exact string matching algorithms
• The smallest automaton recognizing the subwords of a text
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• The Complexity of Pattern Matching for a Random String
• Fast Pattern Matching in Strings

This page was built for publication: EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM