ASIA unversity:Item 310904400/13114
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90453/105672 (86%)
造访人次 : 12082722      在线人数 : 634
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊傳播學系 > 會議論文 >  Item 310904400/13114


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/13114


    题名: FMGA: Finding Motifs by Genetic Algorithm
    作者: 陳士農;Chen, Shih-Nung
    贡献者: 資訊傳播學系
    日期: 2004-05
    上传时间: 2012-11-22 16:46:02 (UTC+8)
    摘要: 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.
    關聯: IEEE Fourth Symposium on Bioinformatics and Bioengineering (BIBE 2004)
    显示于类别:[資訊傳播學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML130检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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