A fast algorithm for computing a longest common increasing subsequence
Resource
Workshop on Combinatorial Mathematics and Computational Theory
Information Processing Letters 93 (5): 249-253
Journal
Information Processing Letters
Journal Volume
93
Journal Issue
5
Pages
249-253
Date Issued
2005
Author(s)
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
Subjects
Algorithms; Computational biology; Longest common subsequence; Longest increasing subsequence
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
06.pdf
Size
99.36 KB
Format
Adobe PDF
Checksum
(MD5):fd587b41d6a2257364be4b5d59a2f273