A Parallel Algorithm for Solving the Reversal Median Problem
We present a new algorithm called rEvoluzer II for solving the Reversal Median problem (RMP). Similar to its predecessor rEvoluzer I the new algorithm can preserve conserved intervals but it has the additional property that it is suitable for parallelization. For the parallel version of rEvoluzer II a master-slave parallelization scheme is used and several methods for reducing parallelization overheads have been incorporated. We show experimentally that rEvoluzer achieves very good results compared to other methods for the RMP. It is also shown that the parallel version has good scaling behavior for a not too large number of processors.
KeywordsParallel Algorithm Parallel Version Master Node Chunk Size Master Process
Unable to display preview. Download preview PDF.
- 5.Bernt, M., Merkle, D., Middendorf, M.: Genome rearrangement based on reversals that preserve conserved intervals. IEEE Transactions on Bioinformatics (accepted, 2005)Google Scholar
- 6.Bourque, G., Pevzner, P.: Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species. Genome Res. 12(1), 26–36 (2002)Google Scholar
- 10.Moret, B., Wyman, S., Bader, D.A., Warnow, T., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: Proc. 6th Pacific Symp. on Biocomputing (PSB 2001), World Scientific Pub., Singapore (2001)Google Scholar