Locally Consistent Parsing and Applications to Approximate String Comparisons

  • Tuğkan Batu
  • S. Cenk Sahinalp
Conference paper

DOI: 10.1007/11505877_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3572)
Cite this paper as:
Batu T., Sahinalp S.C. (2005) Locally Consistent Parsing and Applications to Approximate String Comparisons. In: De Felice C., Restivo A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg

Abstract

Locally consistent parsing (LCP) is a context sensitive partitioning method which achieves partition consistency in (almost) linear time. When iteratively applied, LCP followed by consistent block labeling provides a powerful tool for processing strings for a multitude of problems. In this paper we summarize applications of LCP in approximating well known distance measures between pairs of strings in (almost) linear time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tuğkan Batu
    • 1
  • S. Cenk Sahinalp
    • 1
  1. 1.School of Computing ScienceSimon Fraser University 

Personalised recommendations