Fastest Pattern Matching in Strings
From MaRDI portal
Publication:4285908
DOI10.1006/JAGM.1994.1008zbMATH Open0797.68084OpenAlexW1991199806MaRDI QIDQ4285908FDOQ4285908
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cited In (43)
- A family of fast exact pattern matching algorithms
- Average running time of the Boyer-Moore-Horspool algorithm
- Correctness and efficiency of pattern matching algorithms
- Title not available (Why is that?)
- On the Expected Sublinearity of the Boyer–Moore Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Packed String Matching for Short Patterns
- Optimal pattern matching algorithms
- Improved and self-tuned occurrence heuristics
- Fast string matching for multiple searches
- A Boyer-Moore type string matching algorithm with memory and its computational complexity
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Disjunctive partial deduction of a right-to-left string-matching algorithm
- On-line string matching algorithms: survey and experimental results
- A taxonomy of some right-to-left string-matching algorithms
- Speeding up two string-matching algorithms
- A new regular grammar pattern matching algorithm.
- Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
- A fast pattern matching algorithm derived by transformational and assertional reasoning
- Combinatorial Pattern Matching
- A unifying look at the Apostolico--Giancarlo string-matching algorithm
- Looking for MUM and DAD: text-text comparisons do help
- Improved pattern-scan-order algorithms for string matching
- A family of fast constant-space substring search algorithms
- On string pattern matching: A quantitative analysis and a proposal
- Quantum algorithms for learning hidden strings with applications to matroid problems
- PAMA: A FAST STRING MATCHING ALGORITHM
- Fast pattern-matching on indeterminate strings
- Title not available (Why is that?)
- Algorithms for pattern matching
- A simple fast hybrid pattern-matching algorithm
- Title not available (Why is that?)
- Average case analysis of the Boyer‐Moore algorithm
- A new regular grammar pattern matching algorithm
- A fast string searching algorithm
- Fast algorithms for two dimensional and multiple pattern matching
- How the character comparison order shapes the shift function of on-line pattern matching algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Boyer–Moore–Galil String Searching Strategies Revisited
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)