A High-performance Parallel Algorithm for Gene Sequence Discovery

This paper first and foremost illustrates the problem of gene sequence discovery and introduces the way to show gene sequence discovery mode, the scoring mode, the evaluation index as well as other contents about the method of calculation in gene sequence discovery. Meanwhile, this paper detailedly analyzes the primary thought and feature about the discovery, and then a further study is made to confirm the feasibility of parallelization. This paper takes branch bounding method and parallel algorithm to improve its running speed and algorithm performance. By analyzing experimental data, a conclusion is drawn that the parallel algorithm of gene sequence discovery could considerably improve its performance and guarantee its validity.