Approximate matching in the L metric

Ohad Lipsky, Ely Porat

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

4 Scopus citations


Let a text T = to,..., tn-1 and a pattern P = p 0,..., pm-1 strings of natural numbers, be given. In the Approximate Matching in the L 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. Max j=0m-1|ti+j - pj\. We consider the Approximate k - 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 φ. We show an algorithm that solves this problem in O(n(k + log(min(m, |∑|)))log m) time.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings
Number of pages4
StatePublished - 2005
Event12th International Conference on String Processing and Information Retrieval, SPIRE 2005 - Buenos Aires, Argentina
Duration: 2 Nov 20054 Nov 2005

Publication series

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


Conference12th International Conference on String Processing and Information Retrieval, SPIRE 2005
CityBuenos Aires

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.


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

Cite this