Efficient algorithms for the longest common subsequence...

Journal of Complexity 2013 / 2 Vol. 29; Iss. 1

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Tseng, Chiou-Ting, Yang, Chang-Biau, Ann, Hsing-Yen
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:
29
Language:
english
Journal:
Journal of Complexity
DOI:
10.1016/j.jco.2012.08.002
Date:
February, 2013
File:
PDF, 228 KB
english, 2013
Conversion to is in progress
Conversion to is failed