A Space-Bounded Anytime Algorithm for the Multiple Longest...

IEEE Transactions on Knowledge and Data Engineering 2014 / 11 Vol. 26; Iss. 11

A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem

Yang, Jiaoyun, Xu, Yun, Shang, Yi, Chen, Guoliang
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:
26
Language:
english
Journal:
IEEE Transactions on Knowledge and Data Engineering
DOI:
10.1109/TKDE.2014.2304464
Date:
November, 2014
File:
PDF, 1.25 MB
english, 2014
Conversion to is in progress
Conversion to is failed