A Simple Algorithm for Transposition-Invariant Amplified ( , )-Matching

Transposition invariant string matching

Given strings A = a1a2 . . . am and B = b1b2 . . . bn 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 mint∈U{d(A+ t,B)}, where A+ t = (a1 + t)(a2 + t) . . . (am + t). We study the problem of computing the transpo...

Algorithms for Transposition Invariant String Matching

Practical algorithms for transposition-invariant string-matching

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) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. ...

Speeding up transposition-invariant 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, transposition-invariant LCS (LCTS), which has recently arisen in the field of music information retrieval. In LCTS, we look for the longest common subsequence between the sequences A + t = (a0 + t)(a1 + t) . . ....

SIA(M)ESE: An efficient algorithm for transposition invariant pattern matching in multidimensional datasets

In this paper, we study pattern matching in multidimensional datasets. The aim is to find translation (transposition) invariant occurrences of a given query pattern, called template, in an arbitrary multidimensional dataset. Between the points in the dataset that have been found to match the consecutive points in the template, there may be any finite number of other intervening datapoints. For ...