ASIA unversity:Item 310904400/13114
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12082040      Online Users : 661
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

    Please use this identifier to cite or link to this item:

    Title: FMGA: Finding Motifs by Genetic Algorithm
    Authors: 陳士農;Chen, Shih-Nung
    Contributors: 資訊傳播學系
    Date: 2004-05
    Issue Date: 2012-11-22 16:46:02 (UTC+8)
    Abstract: In the era of post-genomics, almost all the genes have been sequenced and enormous amounts of data have been generated. Hence, to mine useful information from these data is a very important topic. In this paper we propose a new approach for finding potential motifs in the regions located from the -2000 bp upstream to +1000 bp downstream of transcription start site (TSS). This new approach is developed based on the genetic algorithm (GA). The mutation in the GA is performed by using position weight matrices to reserve the completely conserved positions. The crossover is implemented with special-designed gap penalties to produce the optimal child pattern. We also present a rearrangement method based on position weight matrices to avoid the presence of a very stable local minimum, which may make it quite difficult for the other operators to generate the optimal pattern. Our approach shows superior results by comparing with multiple em for motif elicitation (MEME) and Gibbs sampler, which are two popular algorithms for finding motifs.
    Relation: IEEE Fourth Symposium on Bioinformatics and Bioengineering (BIBE 2004)
    Appears in Collections:[Department of Information Communication] Proceedings

    Files in This Item:

    File Description 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