Fastest Pattern Matching in Strings

DOI10.1006/jagm.1994.1008zbMath0797.68084OpenAlexW1991199806MaRDI QIDQ4285908

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)

Related Items (6)

Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ Quantum algorithms for learning hidden strings with applications to matroid problems ⋮ A simple fast hybrid pattern-matching algorithm ⋮ On-line string matching algorithms: survey and experimental results ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ Improved pattern-scan-order algorithms for string matching

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