Daniel P. Lopresti Andrew Tomkins Matsushita Information Technology...  Home/Search
Context Related
| cmu.edu/afs/cs/usr/andrew...chile.ps.gz cmu.edu/afs/cs/usr/andrew...chile.ps.gz 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: cmu.edu/~andrewt/papers (more) From: cmu.edu/~andrewt/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we examine the concept of string block edit distance, where two strings A and B are compared by extracting collections of substrings and placing them into correspondence. This model accounts for certain phenomena encountered in important real-world applications, including pen computing and molecular biology. The basic problem admits a family of variations depending on whether the strings must be matched in their entireties, and whether overlap is permitted. We show that several... (Update)
Cited by: More
Schema Matching using Duplicates - Alexander Bilke Technische (Correct)
CDER: Efficient MT Evaluation Using Block Movements - Leusch, Ueffing, Ney (2006) (Correct)
Approximate Nearest Neighbors and Sequence Comparison - With Block Operations (Correct)
Similar documents (at the sentence level):
74.7%: Block Edit Models for Approximate String Matching - Lopresti, Tomkins (1997) (Correct)
11.3%: Temporal-Domain Matching of Hand-Drawn Pictorial Queries - Lopresti, Tomkins (1997) (Correct)
Active bibliography (related documents): More All
0.1: Cross-Domain Approximate String Matching - Lopresti, Wilfong (1999) (Correct)
0.1: Efficient Algorithms for Approximate String Matching with Swaps - Kim, Lee (1999) (Correct)
0.1: Efficient Algorithms for Sequence Analysis with Concave and.. - Eppstein (1989) (Correct)
Similar documents based on text: More All
0.1: Algorithms for Matching Hand-Drawn Sketches - Lopresti, Tomkins, Zhou (1997) (Correct)
0.1: A Feature-Based Approach for Image Retrieval by Sketch - Yin Chans (Correct)
0.1: On the Searchability of Electronic Ink - Lopresti, Tomkins (Correct)
Related documents from co-citation: More All
7: The string-to-string correction problem with block move (context) - TICHY - 1984
7: Binary codes capable of correcting deletions (context) - Levenshtein - 1966
6: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
BibTeX entry: (Update)
D. Lopresti, A. Tomkins, "Block Edit Models for Approximate String Matching", in SSAWSP 95. http://citeseer.ist.psu.edu/211214.html More
@article{ lopresti97block,
author = "Daniel Lopresti and Andrew Tomkins",
title = "Block edit models for approximate string matching",
journal = "Theoretical Computer Science",
volume = "181",
number = "1",
pages = "159--179",
year = "1997",
url = "citeseer.ist.psu.edu/211214.html" }
Citations (may not include all citations):686 A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
431 Basic local alignment search tool (context) - Altschul, Gish et al. - 1990
270 The string-to-string correction problem (context) - Wagner, Fischer - 1974
147 and Macromolecules: The Theory and Practice of Sequence Comp.. (context) - Sankoff, Kruskal et al. - 1983
92 Algorithms for approximate string matching (context) - Ukkonen - 1985
71 An improved algorithm for approximate string matching (context) - Galil, Park - 1990
60 Fast parallel and serial approximate string matching (context) - Landau, Vishkin - 1989
43 Data structures and algorithms for approximate string matchi.. (context) - Galil, Giancarlo - 1988
32 Approximate string matching in sublinear expected time (context) - Chang, Lawler - 1990
25 A systolic array for rapid string comparison (context) - Lipton, Lopresti - 1985
24 Graph Theory and Its Applications to Problems of Society (context) - Roberts - 1978
19 the complexity of the extended string-to-string correction p.. (context) - Wagner - 1975
15 Sequence Analysis Primer - Gribskov, Devereux - 1991
11 the searchability of electronic ink - Lopresti, Tomkins - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~andrewt/papers.html): More
A Trace-Driven Comparison of Algorithms for.. - Kimbrel, Tomkins, .. (1996) (Correct)
Validation of Image Defect Models for Optical Character.. - Li, Lopresti, Nagy.. (1995) (Correct)
Approximate Matching of Hand-Drawn Pictograms - Lopresti, Tomkins (1993) (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