Two-dimensional pattern matching by sampling

DOI10.1016/0020-0190(93)90020-AzbMath0776.68055OpenAlexW2088528313MaRDI QIDQ685522

Wojciech Rytter, Leszek Gąsieniec, Maxime Crochemore

Publication date: 1 December 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90020-a

zbMATH Keywords

deterministic samplinglogarithmic deterministic sampletwo-dimensional pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Analysis of two-dimensional approximate pattern matching algorithms

Cites Work

• Optimal parallel pattern matching in strings
• 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: Two-dimensional pattern matching by sampling