Parallelizing optimal multiple sequence alignment by dynamic programming

Manal Helal, Hossam El-Gindy, Lenore Mullin, Bruno Gaeta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific computing problems, has failed to benefit from the improvements in computing performance brought about by multi-processor systems, due to the lack of suitable scheme to manage partitioning and dependencies. A scheme for parallel implementation of the dynamic programming multiple sequence alignment is presented, based on a peer to peer design and a multidimensional array indexing method. This design results in up to 5-fold improvement compared to a previously described master/slave design, and scales favourably with the number of processors used. This study demonstrates an approach for parallelising multi-dimensional dynamic programming and similar algorithms utilizing multi-processor architectures.

Original languageEnglish
Title of host publicationProceedings of the 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008
Pages669-674
Number of pages6
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008 - Sydney, NSW, Australia
Duration: 10 Dec 200812 Dec 2008

Publication series

NameProceedings of the 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008

Conference

Conference2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008
Country/TerritoryAustralia
CitySydney, NSW
Period10/12/0812/12/08

Fingerprint

Dive into the research topics of 'Parallelizing optimal multiple sequence alignment by dynamic programming'. Together they form a unique fingerprint.

Cite this