| Summary: | 碩士 === 義守大學 === 資訊管理學系碩士班 === 93 === Sequence alignment analysis is the most important work for gene and protein research. Dynamic programming is one of the most used algorithms to study pairwise sequence alignments. However, when the number of sequences (k) is greater than 2, two obstacles hinder the application of this method: (1)The computing time and storage space requirements increase proportionally to O(2k．nk) and O(nk), respectively, n being the length of the sequence. (2)The difficulty in the coding to deal with dynamic k. This study presents a modified algorithm, the recursive dynamic programming, to resolve the second obstacle.
|
|---|
