Two-dimensional parameterized matching

DOI10.1145/2650220MaRDI QIDQ4962170zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Dekel Tsur, Richard Cole, Moshe Lewenstein

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2650220

zbMATH Keywords

parameterized matchingtwo-dimensional pattern matchingwitness computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• Combinatorial Pattern Matching
• Fast parameterized matching with \(q\)-grams
• Approximate parameterized matching
• Sublinear Algorithms for Parameterized Matching
• Algorithms – ESA 2004

Cited in

(10)

• Fast parameterized matching with \(q\)-grams
• Alphabet dependence in parameterized matching
• Matching fixed rectangles in 2-dimension
• A brief history of parameterized matching problems
• Faster Two Dimensional Scaled Matching
• Combinatorial Pattern Matching
• The submatrices character count problem: An efficient solution using separable values
• Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
• Faster two dimensional scaled matching
• Compressed parameterized pattern matching

This page was built for publication: Two-dimensional parameterized matching

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