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 fast learning automaton solution to the keyboard optimization problem
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
A bibliography on syntax error handling in context free languages
ACM SIGPLAN Notices
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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)
ACM Computing Surveys (CSUR)
Computer programs for detecting and correcting spelling errors
Communications of the ACM
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
A Hybrid Approach for XML Similarity
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Structural similarity evaluation between XML documents and DTDs
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
A fine-grained XML structural comparison approach
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem
Fundamenta Informaticae
Solving longest common subsequence and related problems on graphical processing units
Software—Practice & Experience
Algorithms and theory of computation handbook
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
Practical linear space algorithms for computing string-edit distances
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Secure outsourcing of sequence comparisons
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Web Semantics: Science, Services and Agents on the World Wide Web
Efficient tabling of structured data using indexing and program transformation
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Survey: An overview on XML similarity: Background, current trends and future directions
Computer Science Review
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences
| Hi-index | 0.02 |
The string editing problem is to determine the distance between two strings as measured by the minimal cost sequence of deletions, insertions, and changes of symbols needed to transform one string into the other. The longest common subsequence problem can be viewed as a special case. Wagner and Fischer proposed an algorithm that runs in time O(nm), where n, m are the lengths of the two strings. In the present paper, it is shown that if the operations on symbols of the strings are restricted to tests of equality, then O(nm) operations are necessary (and sufficient) to compute the distance.