| A novel GA-based algorithm approach to fast biosequence alignment | |
|---|---|
| 學年 | 93 |
| 學期 | 1 |
| 出版（發表）日期 | 2004-12-01 |
| 作品名稱 | A novel GA-based algorithm approach to fast biosequence alignment |
| 作品名稱（其他語言） | |
| 著者 | 簡丞志 |
| 單位 | 淡江大學電機工程學系 |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Cybernetics and Intelligent Systems, 2004 IEEE Conference on 1, pp.602-607 |
| 摘要 | This paper presents a novel approach algorithm for bimolecular sequences alignment. Sequences comparison is the most important primitive operation in computational biology. There are many computational requirements for a alignment algorithm such as computer memory space requirement and computational complexity (computation time). To overcome the computational complexity of sequence alignment, the presented method first randomly divides the entire bimolecular sequences into several small sequences, and search for a partial near optima solution. After all of the partial near optima searching operations arc completed, the algorithm starts to search for better global optima by scan the new bimolecular sequences that are combined from the optimized small sequences. It allows pairwise alignment in each small sequence and does not apply dynamic programming at any optimization operation. The proposed algorithm also provides highly alignment efficient and very fast performance. Moreover, the proposed algorithm has been implemented in an x86 program, and used to verify the validity of the proposed algorithm and experiment on real DNA and protein datasets. |
| 關鍵字 | Sequences;DNA;Bioinformatics;Biology computing;Computational biology;Computational complexity;Dynamic programming;Proteins;Genomics;Software tools |
| 語言 | en_US |
| ISSN | |
| 期刊性質 | 國內 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/60861 ) |
GoogleAnalytics