On linear-time alphabet-independent 2-dimensional pattern matching

DOI10.1007/3-540-59175-3_91MaRDI QIDQ5096334zbMATH OpenOpenAlexFDO

Authors Maxime Crochemore, Wojciech Rytter

Publication date 16 August 2022

Published in LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59175-3_91

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Two-dimensional pattern matching in linear time and small space
• Approximation algorithms for maximum two-dimensional pattern matching
• Fast algorithms for two dimensional and multiple pattern matching
• A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
• scientific article; zbMATH DE number 1003305
• Analysis of two-dimensional approximate pattern matching algorithms
• Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

Cites work

• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 1256660 (Why is no real title available?)
• scientific article; zbMATH DE number 742992 (Why is no real title available?)
• Optimal parallel pattern matching in strings

Cited in

(4)

• Two-dimensional pattern matching in linear time and small space
• Alphabet-Independent Two-Dimensional Witness Computation
• Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
• Optimal bounds for distinct quartics

This page was built for publication: On linear-time alphabet-independent 2-dimensional pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096334)