000			01614naa a2200277 a 4500
003			AR-LpUFIB
005			20250311170422.0
008			230201s2013 xx o 000 0 eng d
024	8		_aDIF-M6710 _b6850 _zDIF006120
040			_aAR-LpUFIB _bspa _cAR-LpUFIB
100	1		_aRucci, Enzo
245	1	0	_aA hybrid parallel neighbor-joining algorithm for phylogenetic tree reconstruction on a multicore cluster
300			_a1 archivo (192,2 KB)
500			_aFormato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
520			_aBuilding 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.
534			_aParallel & Cloud Computing, 2(3), pp. 74-80
650		4	_aPROGRAMACIÓN PARALELA
650		4	_aSISTEMAS HÍBRIDOS
650		4	_aÁRBOLES
650		4	_aCLUSTERS
700	1		_aChichizola, Franco
700	1		_aDe Giusti, Armando Eduardo
700	1		_aNaiouf, Ricardo Marcelo
856	4	0	_uhttp://goo.gl/CjGvwJ
942			_cCP
999			_c55902 _d55902