A Hybrid Parallel Neighbor-Joining Algorithm for Phylogenetic Tree Reconstruction on a Multicore Cluster

dc.creatorRucci, Enzo
dc.creatorChichizola, Franco
dc.creatorNaiouf, Marcelo
dc.creatorDe Giusti, Armando Eduardo
dc.date2013-03-15
dc.date2019-08-29T17:02:12Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/80066
dc.identifierissn:2304-9464
dc.descriptionBuilding phylogenetic trees is one of the significant applications within bioinformatics, mainly due to its involvement in multiple sequence alignment. Because of the high computational complexity required, the use of parallel processing during the building process is convenient. Taking into account that current cluster architectures are hybrid, in this paper we present a parallel algorithm to build phylogenetic trees based on the Neighbor-Joining method, which uses a hybrid communication model (combination of message passing and shared memory), and then analyze its performance. Finally, conclusions and possible future lines of work are presented
dc.descriptionFacultad de Informática
dc.formatapplication/pdf
dc.format74-80
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc/4.0/
dc.rightsCreative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
dc.subjectCiencias Informáticas
dc.subjectParallel programming languages
dc.subjectHybrid Programming
dc.subjectMulticore Cluster
dc.subjectPhylogenetic Trees
dc.subjectNeighbor-Joining Method
dc.titleA Hybrid Parallel Neighbor-Joining Algorithm for Phylogenetic Tree Reconstruction on a Multicore Cluster
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución