DocumentCode
2703180
Title
A New Algorithm for the Longest Common Subsequence Problem
Author
Xiang, Xuyu ; Zhang, Dafang ; Qin, Jiaohua
fYear
2007
fDate
15-19 Dec. 2007
Firstpage
112
Lastpage
115
Abstract
In order to find the longest common subsequence (LCS) as soon as possible, we, with the method of match pairs, propose the new algorithm of the sequence of DNA, which is efficient both in time and in space on the basis of the improved dynamic programming theorem.
Keywords
DNA; biology computing; computational complexity; dynamic programming; molecular biophysics; sequences; DNA sequence; LCS problem; dynamic programming theorem; longest common subsequence problem; nondynamic programming; Computational intelligence; Computer security; DNA computing; Dynamic programming; Genetic mutations; Heuristic algorithms; Sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on
Conference_Location
Harbin
Print_ISBN
978-0-7695-3073-4
Type
conf
DOI
10.1109/CISW.2007.4425458
Filename
4425458
Link To Document