Two Dimensional Parameterized Matching

Carmit Hazay, Moshe Lewenstein, Dekel Tsur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

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 × 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
Title of host publicationProceedings of the 16th Annual Symposium on Combinatorial Pattern Matching
PublisherSpringer
Pages266-279
Number of pages14
DOIs
StatePublished - 2005
Externally publishedYes
EventOt16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of
Duration: 19 Jun 200522 Jun 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume3537
ISSN (Print)0302-9743

Conference

ConferenceOt16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005
Country/TerritoryKorea, Republic of
CityJeju Island
Period19/06/0522/06/05

Fingerprint

Dive into the research topics of 'Two Dimensional Parameterized Matching'. Together they form a unique fingerprint.

Cite this