关键词: Motif发现 机群系统 并行算法 生物信息学

Abstract:

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.

Key words: Motif discovering, cluster computing system, parallel algorithm, bioinformatics