Approximate parameterized matching

Carmit Hazay, Moshe Lewenstein, Dina Soko

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

18 Scopus citations

Abstract

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

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSusanne Albers, Tomasz Radzik
PublisherSpringer Verlag
Pages414-425
Number of pages12
ISBN (Print)3540230254, 9783540230250
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

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

Cite this