An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
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)
A spatial knowledge structure for image information systems using symbolic projections
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A fast algorithm for computing longest common subsequences
Communications of the ACM
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Common phrases and minimum-space text storage
Communications of the ACM
Spelling correction in systems programs
Communications of the ACM
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Selected combinatorial research problems.
Selected combinatorial research problems.
Longest common subsequences of two random sequences.
Longest common subsequences of two random sequences.
The longest common subsequence problem.
The longest common subsequence problem.
| Hi-index | 0.00 |
A framework is presented for computing substrings and subsequences shared between two symbol sequences. Efficient algorithms are then provided for determining the maximal common substrings.