Locally consistent parsing and applications to approximate string comparisons

Authors:
Tuğkan Batu;S. Cenk Sahinalp
Affiliations:
School of Computing Science, Simon Fraser University;School of Computing Science, Simon Fraser University
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 16
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
On a parallel-algorithms methods for string matching problems (overview)

CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Symmetry breaking for suffix tree construction

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Maintaining dynamic sequences under equality-tests in polylogarithmic time

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximate string matching: a simpler faster algorithm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Approximate nearest neighbors and sequence comparison with block operations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pattern matching in dynamic texts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximate and dynamic matching of patterns using a labeling paradigm

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating Edit Distance Efficiently

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Substring compression problems

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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.