Abstract
Purchase PDF (106 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
and 
<
Purchase PDF (99 K)
doi:10.1016/j.ipl.2006.05.005 
Copyright © 2006 Elsevier B.V. All rights reserved.
A linear space algorithm for computing a longest common increasing subsequence
Yoshifumi Sakaia, 
Received 21 September 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Let X and Y be sequences of integers. A common increasing subsequence of X and Y is an increasing subsequence common to X and Y. In this note, we propose an O(|X|
|Y|)-time and O(|X|+|Y|)-space algorithm for finding one of the longest common increasing subsequences of X and Y, which improves the space complexity of Yang et al. [I.H. Yang, C.P. Huang, K.M. Chao, A fast algorithm for computing a longest common increasing subsequence, Inform. Process. Lett. 93 (2005) 249–253] O(|X||Y|)-time and O(|X||Y|)-space algorithm, where |X| and |Y| denote the lengths of X and Y, respectively.
Keywords: Algorithms; Longest common subsequence; Longest increasing subsequence
