| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 游昌翰 | zh_TW |
| DC.creator | Chang-Hang Yo | en_US |
| dc.date.accessioned | 2000-7-7T07:39:07Z | |
| dc.date.available | 2000-7-7T07:39:07Z | |
| dc.date.issued | 2000 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=87325012 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 序列組合問題在人類基因計畫中的ＤＮＡ定序方面，扮演一個很重要的角色。在本論文裡，我們應用遺傳演算法來解序列組合問題。在研究的過程中，我們根據問題的特性來設計染色體的表示方式、演化和突變的運算子來解序列組合問題。最後我們也將我們的方法和其他相關的方法作一比較。 | zh_TW |
| dc.description.abstract | Fragment assembly plays an important role in DNA sequences of Human Genome Project. In this thesis, we apply genetic algorithms to solve fragment assembly. The proposed approach is based on the problem’s characteristics to design crossover and mutation operators. We also compare our approach with other works in the literature. | en_US |
| DC.subject | 遺傳演算法 | zh_TW |
| DC.subject | 序列組合 | zh_TW |
| DC.subject | fragment assembly | en_US |
| DC.subject | genetic algorithm | en_US |
| DC.title | 應用遺傳演算法解序列組合問題 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Using Genetic Algorithms to Solve Fragment Assembly | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |