Dynamic and approximate pattern matching in 2D

DOI10.1007/978-3-319-46049-9_13MaRDI QIDQ1796841zbMATH OpenOpenAlexFDO

Authors Raphaël Clifford, A. Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj

Publication date 17 October 2018

Full work available at URL https://orbit.dtu.dk/en/publications/96f5a80d-cc7d-473a-8079-b66f7affd760

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15) Randomized algorithms (68W20)

Recommendations

• Fast two-dimensional pattern matching
• Analysis of two-dimensional approximate pattern matching algorithms
• Approximation algorithms for maximum two-dimensional pattern matching
• Fast algorithms for two dimensional and multiple pattern matching
• Two-dimensional pattern matching in linear time and small space
• scientific article; zbMATH DE number 2087057
• Approximating Approximate Pattern Matching
• Two-dimensional pattern matching on a dynamic library of texts
• Two-dimensional pattern matching by sampling

Cited in

(6)

• Fast two-dimensional pattern matching
• Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
• Two-dimensional pattern matching in linear time and small space
• Second-Order Behavior of Pattern Search
• Optimal bounds for distinct quartics
• Pattern matching in doubling spaces

This page was built for publication: Dynamic and approximate pattern matching in 2D

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