Two dimensional parameterized matching

Carmit Hazay, Moshe Lewenstein, Dekel Tsur

Research output: Contribution to journalConference articlepeer-review

10 Scopus citations


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 × m substrings of an n × n text that p-match to an m × m pattern. This models, for example, searching for color images with changing of color maps. We present an algorithm that solves the two dimensional parameterized matching problem in O(n2 + m2.5 · polylog(m)) time.

Original languageEnglish
Pages (from-to)266-279
Number of pages14
JournalLecture Notes in Computer Science
StatePublished - 2005
EventOt16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of
Duration: 19 Jun 200522 Jun 2005


Dive into the research topics of 'Two dimensional parameterized matching'. Together they form a unique fingerprint.

Cite this