Two-dimensional parameterized matching

Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur

Research output: Contribution to journalArticle

Abstract

Two equal-length strings, or two equal-sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-dimensional parameterized matching is the task of finding all m x m substrings of an n x n text that p-match an m x m pattern. This models searching for color images with changing of color maps, for example. We present two algorithms that solve the twodimensional parameterized matching problem. The time complexities of our algorithms are O(n2log2m) and O(n2 + m2.5 polylog(m)). Our algorithms are faster than the O(n2mlog2m log log m) time algorithm for this problem of Amir et al. [2006]. A key step in both of our algorithms is to count the number of distinct characters in every m x m substring of an n x n string. We show how to solve this problem in O(n2) time. This result may be of independent interest.

Original languageEnglish (US)
JournalACM Transactions on Algorithms
Volume11
Issue number2
DOIs
StatePublished - Oct 30 2014

Fingerprint

Parameterise
Strings
Matching Problem
Color Image
Time Complexity
Count
Distinct
Text
Character
Model
Color

Keywords

  • Parameterized matching
  • Two-dimensional pattern matching
  • Witness computation

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this

Two-dimensional parameterized matching. / Cole, Richard; Hazay, Carmit; Lewenstein, Moshe; Tsur, Dekel.

In: ACM Transactions on Algorithms, Vol. 11, No. 2, 30.10.2014.

Research output: Contribution to journalArticle

Cole, Richard ; Hazay, Carmit ; Lewenstein, Moshe ; Tsur, Dekel. / Two-dimensional parameterized matching. In: ACM Transactions on Algorithms. 2014 ; Vol. 11, No. 2.
@article{fc347d430ff6465b9e33b41f643b049e,
title = "Two-dimensional parameterized matching",
abstract = "Two equal-length strings, or two equal-sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-dimensional parameterized matching is the task of finding all m x m substrings of an n x n text that p-match an m x m pattern. This models searching for color images with changing of color maps, for example. We present two algorithms that solve the twodimensional parameterized matching problem. The time complexities of our algorithms are O(n2log2m) and O(n2 + m2.5 polylog(m)). Our algorithms are faster than the O(n2mlog2m log log m) time algorithm for this problem of Amir et al. [2006]. A key step in both of our algorithms is to count the number of distinct characters in every m x m substring of an n x n string. We show how to solve this problem in O(n2) time. This result may be of independent interest.",
keywords = "Parameterized matching, Two-dimensional pattern matching, Witness computation",
author = "Richard Cole and Carmit Hazay and Moshe Lewenstein and Dekel Tsur",
year = "2014",
month = "10",
day = "30",
doi = "10.1145/2650220",
language = "English (US)",
volume = "11",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Two-dimensional parameterized matching

AU - Cole, Richard

AU - Hazay, Carmit

AU - Lewenstein, Moshe

AU - Tsur, Dekel

PY - 2014/10/30

Y1 - 2014/10/30

N2 - Two equal-length strings, or two equal-sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-dimensional parameterized matching is the task of finding all m x m substrings of an n x n text that p-match an m x m pattern. This models searching for color images with changing of color maps, for example. We present two algorithms that solve the twodimensional parameterized matching problem. The time complexities of our algorithms are O(n2log2m) and O(n2 + m2.5 polylog(m)). Our algorithms are faster than the O(n2mlog2m log log m) time algorithm for this problem of Amir et al. [2006]. A key step in both of our algorithms is to count the number of distinct characters in every m x m substring of an n x n string. We show how to solve this problem in O(n2) time. This result may be of independent interest.

AB - Two equal-length strings, or two equal-sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-dimensional parameterized matching is the task of finding all m x m substrings of an n x n text that p-match an m x m pattern. This models searching for color images with changing of color maps, for example. We present two algorithms that solve the twodimensional parameterized matching problem. The time complexities of our algorithms are O(n2log2m) and O(n2 + m2.5 polylog(m)). Our algorithms are faster than the O(n2mlog2m log log m) time algorithm for this problem of Amir et al. [2006]. A key step in both of our algorithms is to count the number of distinct characters in every m x m substring of an n x n string. We show how to solve this problem in O(n2) time. This result may be of independent interest.

KW - Parameterized matching

KW - Two-dimensional pattern matching

KW - Witness computation

UR - http://www.scopus.com/inward/record.url?scp=84908892377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908892377&partnerID=8YFLogxK

U2 - 10.1145/2650220

DO - 10.1145/2650220

M3 - Article

VL - 11

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 2

ER -