https://scholars.lib.ntu.edu.tw/handle/123456789/315314
Title: | A fast algorithm for computing a longest common increasing subsequence | Authors: | Yang, I.-H. Huang, C.-P. KUN-MAO CHAO |
Keywords: | Algorithms; Computational biology; Longest common subsequence; Longest increasing subsequence | Issue Date: | 2005 | Journal Volume: | 93 | Journal Issue: | 5 | Start page/Pages: | 249-253 | Source: | Information Processing Letters | Abstract: | Let 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 |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-12244307876&doi=10.1016%2fj.ipl.2004.10.014&partnerID=40&md5=9e9dcace03ddc76404b0be3421b537d5 http://scholars.lib.ntu.edu.tw/handle/123456789/315314 |
ISSN: | 00200190 | DOI: | 10.1016/j.ipl.2004.10.014 |
Appears in Collections: | 生醫電子與資訊學研究所 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.