Sparse Dynamic Programming for Longest Common Subsequence...

Journal of Algorithms 2002 Vol. 42; Iss. 2

Sparse Dynamic Programming for Longest Common Subsequence from Fragments

Brenda S. Baker, Raffaele Giancarlo
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:
42
Year:
2002
Language:
english
Pages:
24
DOI:
10.1006/jagm.2002.1214
File:
PDF, 221 KB
english, 2002
Conversion to is in progress
Conversion to is failed