Algorithms for approximate string matching
Information and Control
SIAM Journal on Computing
Dynamic programming with convexity, concavity and sparsity
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Text algorithms
Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate string matching with gaps
Nordic Journal of Computing
Three Heuristics for delta-Matching: delta-BM Algorithms
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Time-series similarity problems and well-separated geometric sets
Nordic Journal of Computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Journal of Computer and System Sciences
On minimizing pattern splitting in multi-track string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Filtering methods for content-based retrieval on indexed symbolic music databases
Information Retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Solving longest common subsequence and related problems on graphical processing units
Software—Practice & Experience
Efficient bit-parallel algorithms for (δ, α)-matching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient algorithms for pattern matching with general gaps and character classes
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Algorithms on extended (δ, γ)-matching
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Restricted transposition invariant approximate string matching under edit distance
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Self-normalised distance with don't cares
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Algorithms for computing the longest parameterized common subsequence
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Space-efficient data-analysis queries on grids
Theoretical Computer Science
Hi-index | 0.00 |
Given strings A=a"1a"2...a"m and B=b"1b"2...b"n over an alphabet @S@?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 subsequence (LCS), Levenshtein distance, and their versions where the exact matching condition is replaced by an approximate one. For all these problems we give algorithms whose time complexities are close to the known upper bounds without transposition invariance, and for some we achieve these upper bounds. In particular, we show how sparse dynamic programming can be used to solve transposition invariant problems, and its connection with multidimensional range-minimum search. As a byproduct, we give improved sparse dynamic programming algorithms to compute LCS and Levenshtein distance.