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 (at the sentence level):
7.9%: Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
7.9%: Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
Active bibliography (related documents): More All
1.0: Matching Numeric Strings under Noise - Mäkinen, Navarro, Ukkonen (Correct)
0.8: Bit-parallel (δ,γ)-Matching and Suffix.. - Crochemore.. (Correct)
0.6: Practical Algorithms for Transposition-Invariant.. - Lemström, Navarro, Pinzon (Correct)
Similar documents based on text: More All
0.4: Approximate Matching of Run-Length Compressed Strings - Mäkinen, Navarro, Ukkonen (Correct)
0.3: Local Similarity Based Point-Pattern Matching - Mäkinen, Ukkonen (Correct)
0.3: Geometric Algorithms for Transposition Invariant.. - Ukkonen, Lemström.. (2003) (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
22 Algorithms for computing approximate repetitions in musical .. - Cambouropoulos, Crochemore et al. - 1999
17 Computer and System Sciences (context) - Blum, Floyd et al. - 1972
17 Tree pattern matching and subset matching in deterministic O - Cole, Hariharan et al. - 1999
15 Preserving order in a forest in less than logarithmic time a.. (context) - Boas - 1977
15 Sparse dynamic programming I: linear cost functions (context) - Eppstein, Galil et al. - 1992
14 Tree pattern matching and subset matching in randomized O - Cole, Hariharan - 1997
14 Algorithms for Transposition Invariant String Matching (context) - Mkinen, Navarro et al. - 2003
14 Dynamic programming with convexity (context) - Galil, Park - 1992
11 A sub-quadratic sequence alignment algorithm for unrestricte.. - Crochemore, Landau et al. - 2002
9 Including interval encoding into edit distance based music c.. (context) - Lemstrm, Ukkonen - 2000
9 New results and open problems related to non-standard string.. (context) - Muthukrishnan - 1995
7 Approximate string matching with gaps - Crochemore, Iliopoulos et al. - 2002
7 The context-dependent comparison of biological sequence (context) - Wilbur, Lipman - 1984
7 Searching monophonic patterns within polyphonic sources (context) - Lemstrm, Tarhio - 2000
7 Approximate string matching in musical sequences - Crochemore, Iliopoulos et al. - 2001
6 style searching in polyphonic music (context) - Dovey, for et al. - 2001
5 Verifying candidate matches in sparse and wildcard matching - Cole, Hariharan - 2002
4 A bit-parallel su x automaton approach (context) - Crochemore, Iliopoulos et al. - 2003
4 Three Heuristics for #Matching: #BM Algorithms (context) - Crochemore, Iliopoulos et al. - 2002
4 cient bit-parallel techniques for transposition invariant ap.. (context) - Lemstrm, Navarro - 2003
3 Rotation and Lighting Invariant Template Matching - Fredriksson, Mkinen et al. - 2004
3 Trees and Sequences: Computer Science and Computational Biol.. (context) - Gus, on - 1997
2 Time-series similarity problems and well-separated geometric.. (context) - Bollobs, Das et al. - 2001
1 Parameterized Approximate String Matching and Local-Similari.. (context) - Mkinen - 2003
1 On minimizing pattern splitting in multi-track string matchi.. (context) - Lemstrm, Mkinen - 2003
1 Rotation Invariant Template Matching - Fredriksson - 2001
1 Bit-parallel branch & bound algorithm for transposition inva.. (context) - Lemstrm, Navarro et al. - 2004
http://www.cs.helsinki. /group/cbrahms/demoengine/
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