摘要
Motif发现是生物信息学的一个重要研究问题。采用均匀分配后缀群策略、并行淘汰和归并方法,在机群系统上设计一种Motif发现并行投票算法。实验结果表明,在保证解精度的前提下,该并行算法获得了良好的加速,执行效率达到95%以上。
Motif discovering is an important problem in bioinformatics. By distributing evenly the suffix groups to the processors and by applying the parallel filtering and merging techniques, a parallel voting algorithra for Motif discovering is presented for the cluster computing systems. The experimental results show that the algorithm obtains a good speedup and an plus execution efficiency over 95% on the precondition to guarantee the given solution precision.
出处
《计算机工程与科学》
CSCD
2008年第11期126-128,共3页
Computer Engineering & Science
基金
广西高校优秀人才资助计划资助项目(RC2007004)
广西研究生教育创新计划资助项目
关键词
Motif发现
机群系统
并行算法
生物信息学
Motif discovering
cluster computing system
parallel algorithm
bioinformatics
