DMCA
Algorithms for the longest common subsequence problem (1977)
by
Daniel S. Hirschberg
| Venue: | J. ACM |
| Citations: | 218 - 2 self |
BibTeX
@ARTICLE{Hirschberg77algorithmsfor,
author = {Daniel S. Hirschberg},
title = {Algorithms for the longest common subsequence problem},
journal = {J. ACM},
year = {1977}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
AaS~ACT Two algorithms are presented that solve the longest common subsequence problem The first algorithm is applicable in the general case and requires O(pn + n log n) time where p is the length of the longest common subsequence The second algorithm requires time bounded by O(p(m + 1- p)log n) In the common speoal case where p is close to m, this algorithm takes much less time than n ~ KEY WORDS AND PHRASES ' subsequence, common subsequence, algorithm CR CATEOORIES 3 73, 3 79, 5 25, 5 39
