New phylogenetic venues opened by a novel implementation of the DNAml algorithm.
CONCLUSIONS
This note describes the parallelization of a key biological application, such as the construction of phylogenetic trees, using the DNAml program. A careful run-time analysis allowed us to propose an efficient parallelization that scaled very well to large problem sizes.


BACKGROUND
By anonymous ftp at ftp.ac.uma. es (/pub/ots/pDNAml) or from our web site http://www.cnb.uam. es/www/software/software_index.html


BACKGROUND
ots@ac.uma.es
Computer Architecture Department, University of Malaga, 29071 Malaga, Spain. ots@ac.uma.es
O
O
Trelles
C
C
Ceron
H C
HC
Wang
J
J
Dopazo
J M
JM
Carazo
D000465:Algorithms; D019295:Computational Biology; D004247:DNA / Q000235:genetics*; D016208:Databases, Factual; D016013:Likelihood Functions; D010802:Phylogeny; D012984:Software
D004247:DNA