Yang, I.-H.I.-H.YangHuang, C.-P.C.-P.HuangKUN-MAO CHAO2018-09-102018-09-10200500200190https://www.scopus.com/inward/record.uri?eid=2-s2.0-12244307876&doi=10.1016%2fj.ipl.2004.10.014&partnerID=40&md5=9e9dcace03ddc76404b0be3421b537d5http://scholars.lib.ntu.edu.tw/handle/123456789/315314Let A=〈a1,a2,...,am〉 and B=〈b1,b2,...,bn〉 be two sequences, where each pair of elements in the sequences is comparable. A common increasing subsequence of A and B is a subsequence 〈ai1=bj1,ai2=bj2,...,ail=bjl〉, where i1<i2<⋯<il and j1<j2<⋯<jl, such that for all 1≤k<l, we have aik<aik+1. A longest common increasing subsequence of A and B is a common increasing subsequence of the maximum length. This paper presents an algorithm for delivering a longest common increasing subsequence in O(mn) time and O(mn) space. © 2004 Elsevier B.V. All rights reserved.application/pdf101749 bytesapplication/pdfAlgorithms; Computational biology; Longest common subsequence; Longest increasing subsequencejournal article10.1016/j.ipl.2004.10.0142-s2.0-12244307876