Fastest Pattern Matching in Strings

DOI10.1006/JAGM.1994.1008MaRDI QIDQ4285908zbMATH OpenOpenAlexFDO

Authors Livio Colussi

Publication date 22 March 1994

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

Full work available at URL https://doi.org/10.1006/jagm.1994.1008

zbMATH Keywords

Boyer and Moore algorithmpattern matching in strings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Correctness and efficiency of pattern matching algorithms
• A simple fast hybrid pattern-matching algorithm
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 4045218
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm

Cited in

(43)

• Disjunctive partial deduction of a right-to-left string-matching algorithm
• Correctness and efficiency of pattern matching algorithms
• Average running time of the Boyer-Moore-Horspool algorithm
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Optimal pattern matching algorithms
• Improved pattern-scan-order algorithms for string matching
• Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
• A new regular grammar pattern matching algorithm.
• A family of fast constant-space substring search algorithms
• On-line string matching algorithms: survey and experimental results
• Fast string matching for multiple searches
• Looking for MUM and DAD: text-text comparisons do help
• A fast string searching algorithm
• scientific article; zbMATH DE number 3870652 (Why is no real title available?)
• scientific article; zbMATH DE number 4135398 (Why is no real title available?)
• A taxonomy of some right-to-left string-matching algorithms
• scientific article; zbMATH DE number 3943041 (Why is no real title available?)
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Algorithms for pattern matching
• On string pattern matching: A quantitative analysis and a proposal
• scientific article; zbMATH DE number 4045218 (Why is no real title available?)
• On the Expected Sublinearity of the Boyer–Moore Algorithm
• Improved and self-tuned occurrence heuristics
• scientific article; zbMATH DE number 1953284 (Why is no real title available?)
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• A new regular grammar pattern matching algorithm
• scientific article; zbMATH DE number 2092676 (Why is no real title available?)
• Fast algorithms for two dimensional and multiple pattern matching
• Speeding up two string-matching algorithms
• Fast Packed String Matching for Short Patterns
• A family of fast exact pattern matching algorithms
• PAMA: A FAST STRING MATCHING ALGORITHM
• A Boyer-Moore type string matching algorithm with memory and its computational complexity
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• Average case analysis of the Boyer‐Moore algorithm
• Combinatorial Pattern Matching
• Quantum algorithms for learning hidden strings with applications to matroid problems
• How the character comparison order shapes the shift function of on-line pattern matching algorithms
• On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
• A unifying look at the Apostolico--Giancarlo string-matching algorithm
• A fast pattern matching algorithm derived by transformational and assertional reasoning
• A simple fast hybrid pattern-matching algorithm
• Fast pattern-matching on indeterminate strings

This page was built for publication: Fastest Pattern Matching in Strings

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