TY - CHAP

T1 - Approximate parameterized matching

AU - Hazay, Carmit

AU - Lewenstein, Moshe

AU - Soko, Dina

PY - 2004

Y1 - 2004

N2 - Two equal length strings s and s′, over alphabets E, and εs′, parameterize match if there exists a bijection π : ∑s → ∑s′, such that π(s) = s′, where π(s) is the renaming of each character of s via π. Approximate parameterized matching is the problem of finding for a pattern p, at each location of a text string t, a bijection π that maximizes the number of characters that are mapped from p to the appropriate |p|-length substring of t. Our main result is an O(nk1.5+mk log m) time algorithm for this problem where m = |p| and n = \t\.

AB - Two equal length strings s and s′, over alphabets E, and εs′, parameterize match if there exists a bijection π : ∑s → ∑s′, such that π(s) = s′, where π(s) is the renaming of each character of s via π. Approximate parameterized matching is the problem of finding for a pattern p, at each location of a text string t, a bijection π that maximizes the number of characters that are mapped from p to the appropriate |p|-length substring of t. Our main result is an O(nk1.5+mk log m) time algorithm for this problem where m = |p| and n = \t\.

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

U2 - 10.1007/978-3-540-30140-0_38

DO - 10.1007/978-3-540-30140-0_38

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:35048855028

SN - 3540230254

SN - 9783540230250

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 414

EP - 425

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Albers, Susanne

A2 - Radzik, Tomasz

PB - Springer Verlag

ER -