The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Meaningful change detection in structured data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Approximating the longest approximate common subsequence problem
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Information and Computation
Locally minimum-distance correction of syntax errors in programming languages
ACM '80 Proceedings of the ACM 1980 annual conference
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
An Efficient Algorithm to Compute Differences between Structured Documents
IEEE Transactions on Knowledge and Data Engineering
Approximating general metric distances between a pattern and a text
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Property matching and weighted matching
Theoretical Computer Science
Note: Pattern matching with pair correlation distance
Theoretical Computer Science
Pattern Matching with Pair Correlation Distance
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Approximate swap and mismatch edit distance
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Approximate string matching with swap and mismatch
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Crossing number of graphs with rotation systems
GD'07 Proceedings of the 15th international conference on Graph drawing
String matching with up to k swaps and mismatches
Information and Computation
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
The approximate swap and mismatch edit distance
Theoretical Computer Science
Evaluating entity resolution results
Proceedings of the VLDB Endowment
Alignment with non-overlapping inversions in O(n3)-time
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization
| Hi-index | 0.00 |
The Extended String-to-String Correction Problem [ESSCP] is defined as the problem of determining, for given strings A and B over alphabet V, a minimum-cost sequence S of edit operations such that S(A) &equil; B. The sequence S may make use of the operations: Change, Insert, Delete and Swaps, each of constant cost WC, WI, WD, and WS respectively. Swap permits any pair of adjacent characters to be interchanged. The principal results of this paper are: (1) a brief presentation of an algorithm (the CELLAR algorithm) which solves ESSCP in time Ø(¦A¦* ¦B¦* ¦V¦s*s), where s &equil; min(4WC, WI+WD)/WS + 1; (2) presentation of polynomial time algorithms for the cases (a) WS &equil; 0, (b) WS 0, WC&equil; WI&equil; WD&equil; @@@@; (3) proof that ESSCP, with WI C &equil; WD &equil; @@@@, 0 S S&equil; @@@@, reduces ESSCP to the string-to-string correction problem of [1], where an Ø( ¦A¦* ¦B¦) algorithm is given.) Thus, “almost all” ESSCP's can be solved in deterministic polynomial time, but the general problem is NP-complete.