Fast exact string matching algorithms

DOI10.1016/j.ipl.2007.01.002zbMath1184.68605OpenAlexW2048187990MaRDI QIDQ846013

Thierry Lecroq

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.01.002

zbMATH Keywords

design of algorithmsstring matchinghashing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (17)

The Range Automaton: an efficient approach to text-searching ⋮ ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS ⋮ A Fast Suffix Automata Based Algorithm for Exact Online String Matching ⋮ A Bit-Parallel Exact String Matching Algorithm for Small Alphabet ⋮ A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Fast and flexible packed string matching ⋮ Average complexity of backward \(q\)-gram string matching algorithms ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ String matching with lookahead ⋮ Faster string matching based on hashing and bit-parallelism ⋮ Boosting Pattern Matching Performance via k-bit Filtering ⋮ An aggressive algorithm for multiple string matching ⋮ Improving practical exact string matching ⋮ Fast string matching for DNA sequences ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM ⋮ Parallel String Matching

Cites Work

• Efficient randomized pattern-matching algorithms
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast exact string matching algorithms