A linear space algorithm for computing a longest common increasing subsequence

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)203-207
Number of pages5
JournalInformation Processing Letters
Volume99
Issue number5
DOIs
Publication statusPublished - 2006 Sep 15

Keywords

  • Algorithms
  • Longest common subsequence
  • Longest increasing subsequence

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A linear space algorithm for computing a longest common increasing subsequence'. Together they form a unique fingerprint.

Cite this