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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Batu, T., & Sahinalp, S. C. (2005). Locally consistent parsing and applications to approximate string comparisons. In Lecture Notes in Computer Science (Vol. 3572, pp. 22–35). Springer Verlag. https://doi.org/10.1007/11505877_3
Mendeley helps you to discover research relevant for your work.