Fast algorithms for two dimensional and multiple pattern matching
From MaRDI portal
Publication:5056115
DOI10.1007/3-540-52846-6_102zbMath1502.68354OpenAlexW2188242989MaRDI QIDQ5056115
Mireille Régnier, Ricardo A. Baeza-Yates
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_102
Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Algorithms on strings (68W32)
Related Items (4)
Average running time of the Boyer-Moore-Horspool algorithm ⋮ Two-dimensional pattern matching by sampling ⋮ Fast two-dimensional pattern matching ⋮ Constant-space string-matching in sublinear average time
Cites Work
- A fast string searching algorithm
- Efficient randomized pattern-matching algorithms
- The Complexity of Pattern Matching for a Random String
- A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
- Efficient string matching
- Fast Pattern Matching in Strings
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast algorithms for two dimensional and multiple pattern matching