Two dimensional parameterized matching

DOI10.1007/11496656_23MaRDI QIDQ5713549zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Dekel Tsur, Moshe Lewenstein

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Two-dimensional parameterized matching
• Fast parameterized matching with \(q\)-grams
• Approximate parameterized matching
• Sublinear Algorithms for Parameterized Matching
• Approximate parameterized matching

Cited in

(10)

• Fast parameterized matching with \(q\)-grams
• On the longest common parameterized subsequence
• Matching fixed rectangles in 2-dimension
• On the Longest Common Parameterized Subsequence
• Counting Parameterized Border Arrays for a Binary Alphabet
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• Two-dimensional parameterized matching
• Faster Two Dimensional Scaled Matching
• Verifying and enumerating parameterized border arrays
• Faster two dimensional scaled 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 Q5713549)