Approximating general metric distances between a pattern and a text

Ely Porat, Klim Efremenko

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

8 Scopus citations

Abstract

Let T = t0 ... tn-1 be a text and P = p0 ... pm-1 a pattern taken from some finite alphabet set Σ, and let d be a metric on Σ. We consider the problem of calculating the sum of distances between the symbols of P and the symbols of substrings of T of length m for all possible offsets. We present an ε-approximation algorithm for this problem which runs in time O(1/ε2n · polylog(n, |Σ|)). This algorithm is based on a low distortion embedding of metric spaces into normed spaces (especially, into l), which is done as a preprocessing stage. The algorithm is also based on a technique of sampling.

Original languageEnglish
Title of host publicationProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
PublisherAssociation for Computing Machinery
Pages419-427
Number of pages9
ISBN (Print)9780898716474
StatePublished - 1 Jan 2008
Externally publishedYes
Event19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, United States
Duration: 20 Jan 200822 Jan 2008

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference19th Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CitySan Francisco, CA
Period20/01/0822/01/08

Fingerprint

Dive into the research topics of 'Approximating general metric distances between a pattern and a text'. Together they form a unique fingerprint.

Cite this