Fast exact string matching algorithms

DOI10.1016/J.IPL.2007.01.002MaRDI QIDQ846013zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Faster string matching based on hashing and bit-parallelism
• A New String Matching Algorithm
• A very fast string matching algorithm based on condensed alphabets
• scientific article; zbMATH DE number 1982175
• Tuning string matching for huge pattern sets

Cites work

• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• scientific article; zbMATH DE number 4045218 (Why is no real title available?)
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• scientific article; zbMATH DE number 1490002 (Why is no real title available?)
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• Efficient randomized pattern-matching algorithms
• Fast and flexible string matching by combining bit-parallelism and suffix automata

Cited in

(29)

• A fast suffix automata based algorithm for exact online string matching
• Fast and flexible packed string matching
• Linear and efficient string matching algorithms based on weak factor recognition
• Fast string matching for multiple searches
• A New String Matching Algorithm
• Fast string matching with k differences
• Parallel String Matching
• An aggressive algorithm for multiple string matching
• Improvement of the search window shift calculation in MAWP search algorithms
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Boosting pattern matching performance via \(k\)-bit filtering
• Average complexity of backward \(q\)-gram string matching algorithms
• On String Matching in Chunked Texts
• The Range Automaton: an efficient approach to text-searching
• Efficient variants of the backward-oracle-matching algorithm
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• Improving practical exact string matching
• Fast string matching for DNA sequences
• Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
• A weak approach to suffix automata simulation for exact and approximate string matching
• A very fast string matching algorithm based on condensed alphabets
• A family of fast constant-space substring search algorithms
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Tuning string matching for huge pattern sets
• String Processing and Information Retrieval
• String matching with lookahead
• FFT-based algorithms for the string matching with mismatches problem
• Multipattern string matching with q -grams
• Faster string matching based on hashing and bit-parallelism

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846013)