A fast algorithm for computing longest common subsequences

Communications of the ACM 1977 / 5 Vol. 20; Iss. 5

A fast algorithm for computing longest common subsequences

Hunt, James W., Szymanski, Thomas G.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
20
Language:
english
Journal:
Communications of the ACM
DOI:
10.1145/359581.359603
Date:
May, 1977
File:
PDF, 381 KB
english, 1977
Conversion to is in progress
Conversion to is failed