Results 1  10
of
29,553
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
"... Abstract. Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and searching for approximate occurrences of A inside B. We consider the classic Levenshtein distance, but the dis ..."
Abstract
 Add to MetaCart
, and an O(mn log log m) algorithm for transposition invariant approximate string matching. In this paper we first propose a scheme to construct transposition invariant algorithms that depend on d or k. Then we proceed to give an O(n + d 3) algorithm for transposition invariant edit distance, and an O(k 2 n
Transposition invariant string matching
, 2003
"... Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU 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 ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Given strings A = a1a2...am and B = b1b2...bn over an alphabet Σ ⊆ U, whereU 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
Practical Algorithms for TranspositionInvariant StringMatching
"... We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transpositioninvariant text searching using indel distance. These problems have applications in music ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transpositioninvariant text searching using indel distance. These problems have applications in music
Algorithms for Transposition Invariant String Matching (Extended Abstract)
 Journal of Algorithms
, 2002
"... Given strings A and B over an alphabet Σ ⊆ U, where U is some numerical universe closed... ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Given strings A and B over an alphabet Σ ⊆ U, where U is some numerical universe closed...
Speeding up TranspositionInvariant String Matching
"... Finding the longest common subsequence (LCS) of two given sequences A = a0a1... am−1 and B = b0b1... bn−1 is an important and well studied problem. We consider its generalization, transpositioninvariant LCS (LCTS), which has recently arisen in the field of music information retrieval. In LCTS, we l ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Finding the longest common subsequence (LCS) of two given sequences A = a0a1... am−1 and B = b0b1... bn−1 is an important and well studied problem. We consider its generalization, transpositioninvariant LCS (LCTS), which has recently arisen in the field of music information retrieval. In LCTS, we
Practical Algorithms for TranspositionInvariant StringMatching ⋆
"... We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transpositioninvariant text searching using indel distance. These problems have applications in music ..."
Abstract
 Add to MetaCart
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transpositioninvariant text searching using indel distance. These problems have applications in music
Tries for Approximate String Matching
 IEEE Transactions on Knowledge and Data Engineering
, 1996
"... Tries offer text searches with costs which are independent of the size of the document being searched, and so are important for large documents requiring spelling checkers), case insensitivity, and limited approximate regular secondary storage. Approximate searches, in which the search pattern d ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
Tries offer text searches with costs which are independent of the size of the document being searched, and so are important for large documents requiring spelling checkers), case insensitivity, and limited approximate regular secondary storage. Approximate searches, in which the search pattern
Improved Time and Space Complexities for Transposition Invariant String Matching
, 2004
"... Given strings A = a1a2...am and B = b1b2...bn over a finite alphabet Σ ⊂ Z of size O(σ), and a distance d() defined among strings, the transposition invariant version of d() is d t (A,B) = mint∈Z d(A+t,B), where A+t = (a1+t)(a2+t)...(am+t). Distances d() of most interest are Levenshtein distance an ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given strings A = a1a2...am and B = b1b2...bn over a finite alphabet Σ ⊂ Z of size O(σ), and a distance d() defined among strings, the transposition invariant version of d() is d t (A,B) = mint∈Z d(A+t,B), where A+t = (a1+t)(a2+t)...(am+t). Distances d() of most interest are Levenshtein distance
Distributed String Matching With Translation Invariance
"... We consider the problem of distributed string matching. The task is to nd whether a pattern has occurrences that are distributed across parallel strings. Given a set S of h strings s s n ; i 2 f1; : : : ; hg for some constant h, a pattern p = p 1 pm has a distributed occurrence at posit ..."
Abstract
 Add to MetaCart
to search for certain kind of translation invariant distributed occurrences of the pattern. This invariance allows pitch level transpositions, thus called transposition invariance. We present a straightforward algorithm, called DirectCheck, solving the problems. It works in time O(nhm). Moreover, we
Results 1  10
of
29,553