A parallel algorithm for DNA sequences alignment based on MPI

DNA sequences have the fundamental information for each species and a comparison between DNA sequences is one of the basic biological problems. There are a large number of algorithms applying in sequence alignment. Some are for approximate alignment, and others are for exact alignment, which also plays an important role in biology research. In this paper, a new parallel algorithm based on FED algorithm for exact sequences alignment with MPI is proposed. The experimental results indicate that the proposed algorithm can report the matched positions in the specific sequence and improve the matching speed with MPI, as well as reduce the storage requirement.