Efficient algorithms for finding a longest common increasing subsequence

Chan, Wun-Tat and Zhang, Yong and Fung, Stanley P. Y. and Ye, Deshi and Zhu, Hong (2007) Efficient algorithms for finding a longest common increasing subsequence. Journal of Combinatorial Optimization, 13 (3). pp. 277-288.

Full text not available from this repository.

Item Type:	Article
Subjects:	UNSPECIFIED
ID Code:	179
Deposited By:	Dr Joseph Wun-Tat Chan
Deposited On:	31 Oct 2007 18:08
Last Modified:	01 Nov 2007 17:44

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007