Academic Journal
Exploiting parallelism on progressive alignment methods.
| Τίτλος: | Exploiting parallelism on progressive alignment methods. |
|---|---|
| Συγγραφείς: | Orobitg, Miquel, Guirado, Fernando, Notredame, Cedric, Cores, Fernando |
| Πηγή: | Journal of Supercomputing; Nov2011, Vol. 58 Issue 2, p186-194, 9p |
| Θεματικοί όροι: | Sequence alignment, Parallel programs (Computer programs), Heuristic algorithms, Computer programming, Amino acid sequence |
| Περίληψη: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
καταχωρήστε σχόλιο πρώτοι!