Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm

MaRDI QIDQ5446121zbMATH OpenFDO

Authors Domenico Cantone, Simone Faro

Publication date 6 March 2008

zbMATH Keywords

Berry-RavindranHorspoolQuick SearchReverse Factorstring matching algorithmsTuned Boyer-Moore

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1982175
• Fast algorithms for two dimensional and multiple pattern matching
• Fastest Pattern Matching in Strings
• Fast exact string matching algorithms
• A simple fast hybrid pattern-matching algorithm

Cited in

(17)

• A Boyer-Moore-style algorithm for regular expression pattern matching.
• A faster quick search algorithm
• A family of fast constant-space substring search algorithms
• A very fast string matching algorithm based on condensed alphabets
• Accelerating Boyer Moore Searches on Binary Texts
• Efficient variants of the backward-oracle-matching algorithm
• Fast and flexible packed string matching
• Improved and self-tuned occurrence heuristics
• Fastest Pattern Matching in Strings
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• Linear and efficient string matching algorithms based on weak factor recognition
• scientific article; zbMATH DE number 2092676 (Why is no real title available?)
• Speeding up two string-matching algorithms
• A family of fast exact pattern matching algorithms
• PAMA: A FAST STRING MATCHING ALGORITHM
• Combinatorial Pattern Matching
• Accelerating Boyer-Moore searches on binary texts

This page was built for publication: Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm

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