Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Trelles, O.
Right arrow Articles by Carazo, J. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Trelles, O.
Right arrow Articles by Carazo, J. M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics, Vol 14, 544-545, Copyright © 1998 by Oxford University Press

ARTICLES

New phylogenetic venues opened by a novel implementation of the DNAml algorithm

O Trelles, C Ceron, HC Wang, J Dopazo and JM Carazo
Computer Architecture Department, University of Malaga, 29071 Malaga, Spain. ots@ac.uma.es

SUMMARY : 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. AVAILABILITY: 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.htmlCONTACT: ots@ac.uma.es
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.