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 115 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68W99 Algorithms in computer science × Cite Format Result Cite Review PDF Full Text: DOI