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 (2005) Efficient Algorithms for Finding a Longest Common Increasing Subsequence. In: The 16th International Symposium on Algorithms and Computation, December 19-21, 2005, Sanya, Hainan, China.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/11602613_67

Item Type:	Conference or Workshop Item (Paper)
Subjects:	UNSPECIFIED
ID Code:	200
Deposited By:	Dr Joseph Wun-Tat Chan
Deposited On:	31 Oct 2007 17:55
Last Modified:	01 Nov 2007 17:52

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007