Approximate String Comparisons Tugkan Batu and S. Cenk Sahinalp School of...  Home/Search
Context
Related
| compbio.cs.sfu.ca/publicati...dlt05.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: compbio.cs.sfu.ca/publications... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Active bibliography (related documents): More All
0.9: Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
0.5: Low Distortion Embeddings for Edit Distance - Ostrovsky, Rabani (2005) (Correct)
0.3: Optimal Logarithmic Time Randomized Suffix Tree Construction - Farach, Muthukrishnan (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ comparisons-locally,
author = "Approximate String Comparisons",
title = "Locally Consistent Parsing and Applications to",
url = "citeseer.ist.psu.edu/738742.html" }
Citations (may not include all citations):165 Approximate nearest neighbors: Towards removing the curse of.. - Indyk, Motwani - 1998
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
95 On finding lowest common ancestors: Simplification and paral.. (context) - Schieber, Vishkin - 1988
73 A space-economical su#x tree construction algorithm (context) - McCreight - 1976
69 A faster algorithm computing string edit distances (context) - Masek, Paterson - 1980
40 Deterministic coin tossing and accelerating cascades: Micro .. (context) - Cole, Vishkin - 1986
21 cient search for approximate nearest neighbor in high dimens.. (context) - Kushilevitz, Ostrovsky et al. - 1998
15 Approximate nearest neighbors and sequence comparison with b.. - Muthukrishnan, Sahinalp - 2000
9 Approximate string matching: A simpler faster algorithm - Cole, Hariharan - 1998
9 Maintaining dynamic sequences under equality-tests in polylo.. (context) - Mehlhorn, Sundar et al. - 1994
6 The string edit distance matching problem with moves (context) - Cormode, Muthukrishnan - 2002
4 Approximating edit distance e#ciently (context) - Bar-Yossef, Jayram et al. - 2004
3 Data compression using locally consistent parsing (context) - Sahinalp, Vishkin - 1995
3 cient approximate and dynamic matching of patterns using a l.. (context) - Sahinalp, Vishkin - 1996
3 Symmetry breaking for su#x tree construction (context) - Sahinalp, Vishkin - 1994
1 Substring compression problems (context) - Cormode, Muthukrishnan - 2005
1 Oblivious string embeddings and edit distance approximations - Batu, Ergun et al. - 2005
1 a parallel-algorithms method for string matching problems - Sahinalp, Vishkin - 1994
1 Pattern matching in dynamic texts - Alstrup, Brodal et al. - 2000
Documents on the same site (http://compbio.cs.sfu.ca/publications/): More
The Complexity of Gene Placement - Leslie Ann Goldberg (Correct)
The American Genetic Association 92:462--468 - Divergent Origins And (Correct)
Biased Dictionaries with Fast Insert/Deletes - Funda Ergun Cenk (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC