A simple fast hybrid pattern-matching algorithm

DOI10.1016/j.jda.2006.11.004zbMath1156.68055OpenAlexW2087601184MaRDI QIDQ925062

W. F. Smyth, Christopher G. Jennings, Frantisek Franek

Publication date: 29 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.11.004

zbMATH Keywords

algorithmstringwordpattern-matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (4)

On-line string matching in highly similar DNA sequences ⋮ A fast algorithm for order-preserving pattern matching ⋮ A faster quick search algorithm ⋮ Faster string matching based on hashing and bit-parallelism

Cites Work

• Unnamed Item
• Unnamed Item
• Fast pattern-matching on indeterminate strings
• Correctness and efficiency of pattern matching algorithms
• Speeding up two string-matching algorithms
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• On the Exact Complexity of String Matching: Lower Bounds
• On the Exact Complexity of String Matching: Upper Bounds
• Fast Pattern Matching in Strings
• Fastest Pattern Matching in Strings
• Tighter Lower Bounds on the Exact Complexity of String Matching
• A universal compiler system based on production rules
• Combinatorial Pattern Matching

This page was built for publication: A simple fast hybrid pattern-matching algorithm