Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen  Home/Search
Context
Related
| dcc.uchile.cl/~gnavarro/...jofa04.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: dcc.uchile.cl/~gnavarro/publ (more) Homepages: G.Navarro |
Rate this article:      (best)Comment on this article |
Abstract: Given strings A and B over an alphabet Σ ⊆ U, where U is some numerical universe closed under addition and subtraction, and a distance function d(A, B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is min_t∈U {d(A+t, B)}, where A+t = (a_1+t)(a_2+t)... (a_m+t). We study the problem of computing the transposition invariant distance for various distance (and similarity) functions d, including Hamming distance, longest common... (Update)
Similar documents based on text: More All
0.8: Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
0.6: Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
0.6: Matching Numeric Strings under Noise - Mäkinen, Navarro, Ukkonen (Correct)
BibTeX entry: (Update)
@misc{ makinen-transposition,
author = "Veli M{\"a}kinen and Gonzalo Navarro and Esko Ukkonen",
title = "Transposition Invariant String Matching",
url = "citeseer.ist.psu.edu/700489.html" }
Citations (may not include all citations):270 The string-to-string correction problem (context) - Wagner, Fisher - 1974
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 2000
204 Oxford University Press (context) - Crochemore, Rytter - 1984
189 Discovering frequent episodes in sequences (context) - Mannila, Toivonen et al. - 1995
180 Binary codes capable of correcting deletions (context) - Levenshtein - 1966
148 The theory and computation of evolutionary distances: Patter.. (context) - Sellers - 1980
92 Algorithms for approximate string matching (context) - Ukkonen - 1985
61 A fast algorithm for computing longest common subsequences (context) - Hunt, Szymanski - 1977
57 Scaling and related techniques for geometry problems (context) - Gabow, Bentley et al. - 1984
53 Generalized string matching (context) - Abrahamson - 1987
39 String matching techniques for musical similarity and melodi.. (context) - Crawford, Iliopoulos et al. - 1998
35 The longest common subsequence problems revisited (context) - Apostolico, Guerra - 1987
30 Episode matching - Das, Fleischer et al. - 1997
29 Design and implementation of an e cient priority queue (context) - Boas, Kaas et al. - 1977
24 Rapid similarity searches of nucleic acid and protein data b.. (context) - Wilbur, Lipman - 1983
[Article contains additional citations not shown here]
Documents on the same site (http://www.dcc.uchile.cl/~gnavarro/publ.html): More
A More Precise Solution to Two Problems on Tries - Navarro, Poblete (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998) (Correct)
An Optimal Index for PAT Arrays - Navarro (1996) (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