English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90120/105278 (86%)
Visitors : 8908297      Online Users : 543
RC Version 6.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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 >  Item 310904400/65319

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/65319

    Title: Family competition pheromone genetic algorithm for comparative genome assembly
    Authors: Su, Chien-Hao;Chu, Hsueh-Ting;Wang, Pei-Jen;Kuo, Jung-Che;Chiou, Chien-Shun;Kao, Cheng-Yan
    Contributors: 資訊工程學系
    Keywords: genetic algorithm, assembly, next genera-tion sequencing
    Date: 2013-12
    Issue Date: 2013-12-18 10:43:03 (UTC+8)
    Abstract: Genome assembly is a prerequisite step for analyzing next generation sequencing data and also far from being solved.Many assembly tools have been pro-posed and used extensively. Majority of them aim to as-semble sequencing reads into contigs; however, we focus on the assembly of contigs into scaffolds in this paper. This is called scaffolding, which estimates the relative or-der of the contigs as well as the size of the gaps between these contigs. Pheromone trail-based genetic algorithm (PGA) was previously proposed and had decent perfor-mance according to their paper. From our previous study, we found that family competition mechanism in genetic algorithm is able to further improve the results. Therefore, we proposed family competition pheromone genetic algo-rithm (FCPGA) and also demonstrated the improvement over PGA.
    Relation: 2013全國計算機會議
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File SizeFormat

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

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback