Two dimensional parameterized matching

Carmit Hazay; Moshe Lewenstein; Dekel Tsur

Two dimensional parameterized matching

Carmit Hazay, Moshe Lewenstein, Dekel Tsur

University of California at San Diego

Research output: Contribution to journal › Conference article › peer-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(n² + m^2.5 · polylog(m)) time.

Original language	English
Pages (from-to)	266-279
Number of pages	14
Journal	Lecture Notes in Computer Science
Volume	3537
State	Published - 2005
Event	Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of Duration: 19 Jun 2005 → 22 Jun 2005

Cite this

@article{4363d7bf9011449397809a68fcceee8e,

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 × 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.",

author = "Carmit Hazay and Moshe Lewenstein and Dekel Tsur",

year = "2005",

language = "אנגלית",

volume = "3537",

pages = "266--279",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 ; Conference date: 19-06-2005 Through 22-06-2005",

}

TY - JOUR

T1 - Two dimensional parameterized matching

AU - Hazay, Carmit

AU - Lewenstein, Moshe

AU - Tsur, Dekel

PY - 2005

Y1 - 2005

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 × 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.

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 × 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.

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

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:26444593359

SN - 0302-9743

VL - 3537

SP - 266

EP - 279

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005

Y2 - 19 June 2005 through 22 June 2005

ER -

Two dimensional parameterized matching

Abstract

Other files and links

Fingerprint

Cite this