博碩士論文 87325039 完整後設資料紀錄

DC 欄位 語言
DC.contributor資訊工程學系zh_TW
DC.creator林靜媚zh_TW
DC.creatorChing-mei Linen_US
dc.date.accessioned2000-7-12T07:39:07Z
dc.date.available2000-7-12T07:39:07Z
dc.date.issued2000
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=87325039
dc.contributor.department資訊工程學系zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract多序列排比是分子序列分析上一個重要的工具。在演化的過程中,分子序列可能會發生許多的突變,例如插入、刪除、替代等突變事件; 而這些突變造成分子列序間的各種差異。多序列排比是透過同時比較多個序列,以找出序列之間的相似區域,故可找出序列間的結構關係。 本論文提出一個遺傳演算法,來解決多序列排比的問題。我們使用十七個序列的資料集合來測試我們所提出的方法,並且將我們的實驗結果與其它方法做比較。我們發現我們的方法在大多數具有高相似性的測試資料中擁有不錯的表現。zh_TW
dc.description.abstractMultiple sequence alignment is an important tool in molecular sequence analysis. In the evolutionary process, molecular sequences may have several mutations, such as insertion, deletion and substitution. These mutation events result in the diversified difference between sequences. Multiple sequences alignment can help compare the structure-relationship between sequences by simultaneously aligning multiple sequences to find the similar regions. This thesis presents genetic algorithms to solve multiple sequence alignments. Several data sets are tested and the experimental results are compared with other methods. We find our approach could obtain good performance in the majority of data sets with high similarity and long sequences.en_US
DC.subject分子序列分析zh_TW
DC.subject遺傳演數法zh_TW
DC.subject多序列排比zh_TW
DC.subjectmolecular sequence analysisen_US
DC.subjectgenetic algorithmen_US
DC.subjectmultiple sequence alignmenten_US
DC.title使用遺傳演算法解多序列排比的問題zh_TW
dc.language.isozh-TWzh-TW
DC.titleUsing Genetic Algorithms to Solve Multiple Sequence Alignmentsen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明