Parallel genome sequence searching on SupercomputerBlueGene/P

The aim of this paper is to investigate the efficiency of sequence alignment. The parallel computational model is based on mpiBlast algorithm, data decomposition and manager-worker algorithmic paradigm utilizing massage passing based on MPI and is verified on the basis of flat parallel program implementation on a supercomputer BlueGene/P.