Exploiting parallelism on progressive alignment methods

Multiple Sequence Alignment (MSA) constitutes an extremely powerful tool for important biological applications such as phylogenetic analysis, identification of conserved motifs and domains and structure prediction. In spite of the improvement in speed and accuracy introduced by MSA programs, the com...

Full description

Saved in:
Bibliographic Details
Published inJournal of supercomputing Vol. 58; no. 2; pp. 186 - 194
Main Authors Orobitg, Miquel, Guirado, Fernando, Notredame, Cedric, Cores, Fernando
Format Journal Article Conference Proceeding
LanguageEnglish
Published Boston Springer US 01.11.2011
Springer
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Multiple Sequence Alignment (MSA) constitutes an extremely powerful tool for important biological applications such as phylogenetic analysis, identification of conserved motifs and domains and structure prediction. In spite of the improvement in speed and accuracy introduced by MSA programs, the computational requirements for large-scale alignments requires high-performance computing and parallel applications. In this paper we present an improvement to a parallel implementation of T-Coffee, a widely used MSA package. Our approximation resolves the bottleneck of the progressive alignment stage on MSA. This is achieved by increasing the degree of parallelism by balancing the guide tree that drives the progressive alignment process. The experimental results show improvements in execution time of over 68% while maintaining the biological accuracy.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-009-0359-5