Efficient Algorithms for Finding a Longest Common Increasing Subsequence

Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu. Efficient Algorithms for Finding a Longest Common Increasing Subsequence. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 665-674, Springer, 2005. [doi]

Abstract

Abstract is missing.