Hunt, James W.; Szymanski, Thomas G. A fast algorithm for computing longest common subsequences. (English) Zbl 0354.68078 Commun. ACM 20, 350-353 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 100 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68W99 Algorithms in computer science PDF BibTeX XML Cite \textit{J. W. Hunt} and \textit{T. G. Szymanski}, Commun. ACM 20, 350--353 (1977; Zbl 0354.68078) Full Text: DOI OpenURL