Approximate matching in the L metric

Ohad Lipsky, Ely Porat

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Let a text T = t0, ..., tn - 1 and a pattern P = p0, ..., pm - 1, strings of natural numbers, be given. In the Approximate Matching in theL metric problem the output is, for every text location i, the L distance between the pattern and the length m substring of the text starting at i, i.e., Maxj = 0m - 1 | ti + j - pj |. We consider the Approximatek - L distance problem. Given text T and pattern P as before, and a natural number k the output of the problem is the L distance of the pattern from the text only at locations i in the text where the distance is bounded by k. For the locations where the distance exceeds k the output is φ{symbol}. We show an algorithm that solves this problem in O (n (k + log (min (m, | Σ |))) log m) time.

Original languageEnglish
Pages (from-to)138-140
Number of pages3
JournalInformation Processing Letters
Issue number4
StatePublished - 15 Feb 2008

Bibliographical note

Funding Information:
* Corresponding author. Tel.: +972 3 531 8408. E-mail addresses: (O. Lipsky), (E. Porat). 1 Tel.: +972 3 531 7620. 2 Partially supported by GIF Young Scientists Program grant 2055-1168.6/2002.


  • Analysis of algorithms
  • Approximation algorithms
  • Pattern matching
  • Time series analysis


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

Cite this