D. S. Hirschberg
Abstract
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.
- 1 Chvatal, V., Klarner, D.A., and Knuth, D.E. Selected combinatorial research problems. STAN.CS-72-292, Stanford U., (June 1972), 26. Google Scholar
Digital Library
- 2 Private communication from D. Knuth to J.D. Ullman.Google Scholar
- 3 Wagner, R.A., and Fischer, M.J. The string-to-string correction problem. J. ACM 21, 1 (Jan. 1974), 168-173. Google ScholarDigital Library
- 4 Aho, A. V., Hirschberg, D.S., and Ullman, J.D. Bounds on the complexity of the longest common subsequence problem. Proc. 15th Ann. Symp. on Switching and Automata Theory, 1974, pp. 104-109.Google ScholarDigital Library
Index Terms
- A linear space algorithm for computing maximal common subsequences
Recommendations
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
AbstractGiven a string T of length n whose characters are drawn from an ordered alphabet of size , its longest Lyndon subsequence is a maximum-length subsequence of T that is a Lyndon word. We propose algorithms for finding such a subsequence in ...
Computing Longest (Common) Lyndon Subsequences
Combinatorial AlgorithmsAbstractGiven a string T with length n whose characters are drawn from an ordered alphabet of size , its longest Lyndon subsequence is a longest subsequence of T that is a Lyndon word. We propose algorithms for finding such a subsequence in time ...
Enumeration of Maximal Common Subsequences Between Two Strings
AbstractA maximal common subsequence (MCS) between two strings X and Y is an inclusion-maximal subsequence of both X and Y. MCSs are a natural generalization of the classical concept of longest common subsequence (LCS), which can be seen as a longest MCS. ...
Comments