Fast two-dimensional pattern matching
From MaRDI portal
Publication:1209318
DOI10.1016/0020-0190(93)90250-DzbMath0795.68078OpenAlexW2030163511MaRDI QIDQ1209318
Ricardo A. Baeza-Yates, Mireille Régnier
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90250-d
Related Items (8)
On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ A framework to animate string algorithms ⋮ Fast average-case pattern matching by multiplexing sparse tables ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Complexity of Sets of Two-Dimensional Patterns ⋮ Fast and practical approximate string matching ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Cites Work
- A fast string searching algorithm
- Efficient randomized pattern-matching algorithms
- The Complexity of Pattern Matching for a Random String
- Augmenting the aho-corasick pattern matching machine
- Efficient string matching
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Fast algorithms for two dimensional and multiple pattern matching
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast two-dimensional pattern matching