Efficient algorithms for finding a longest common...

Journal of Combinatorial Optimization 2007 / 04 Vol. 13; Iss. 3

Efficient algorithms for finding a longest common increasing subsequence

Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu
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:
13
Language:
english
Pages:
12
Journal:
Journal of Combinatorial Optimization
DOI:
10.1007/s10878-006-9031-7
Date:
April, 2007
File:
PDF, 316 KB
english, 2007
Conversion to is in progress
Conversion to is failed