Performance Comparison of MPI-Based Parallel Multiple Sequence Alignment Algorithm using Single and Multiple Guide Trees
Multiple alignment of biological sequences is cm interesting area of research for application of parallel processing algorithms. For multiple alignment of sequences, parallelism can be introduced at different levels to reduce the overall time. This paper is concerned with the comparison of an MPI-based multiple sequence alignment algorithm by using single and multiple guide trees. In this work, we will look at the application of Divide-and-Conquer algorithm for multiple sequence alignment and discuss two different implementations on MPL We compare the speed up of the two approaches and we contrast the quality of the alignments for these two approaches. These two approaches differ in using one single tree for alignment vs. multiple trees for alignment that we further discuss in this paper.
Multiple Sequence Alignment Guide tree Divide-and-Conquer technique Alignment quality.
Siamak Rezaei Md. Maruf Monwar Joanne Bai
Computer Science, University of Northern British Columbia, Prince George, BC, Canada
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
595-600
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）