A linear space algorithm for computing a longest common increasing subsequence

Authors:
Yoshifumi Sakai
Affiliations:
Graduate School of Agricultural Science, Tohoku University, Tsutsumidori-amamiyamachi, Aoba-ku, Sendai-shi, Japan
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 3

A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Enumerating longest increasing subsequences and patience sorting

Information Processing Letters
An almost-linear time and linear space algorithm for the longest common subsequence problem

Information Processing Letters
A fast algorithm for computing a longest common increasing subsequence

Information Processing Letters
Efficient algorithms for finding a longest common increasing subsequence

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Faster algorithms for computing longest common increasing subsequences

Journal of Discrete Algorithms
A linear algorithm for 3-letter longest common weakly increasing subsequence

Information Processing Letters
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

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.