English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23199139      Online Users : 453
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8434

    Title: 應用遺傳演算法解序列組合問題;Using Genetic Algorithms to Solve Fragment Assembly
    Authors: 游昌翰;Chang-Hang Yo
    Contributors: 資訊工程研究所
    Keywords: 遺傳演算法;序列組合;fragment assembly;genetic algorithm
    Date: 2000-07-07
    Issue Date: 2009-09-22 11:26:52 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 序列組合問題在人類基因計畫中的DNA定序方面,扮演一個很重要的角色。在本論文裡,我們應用遺傳演算法來解序列組合問題。在研究的過程中,我們根據問題的特性來設計染色體的表示方式、演化和突變的運算子來解序列組合問題。最後我們也將我們的方法和其他相關的方法作一比較。 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.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明