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

Bioinformatics. 1998;14(6):544-5. doi: 10.1093/bioinformatics/14.6.544.

Abstract

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.html

Contact: ots@ac.uma.es

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Computational Biology
  • DNA / genetics*
  • Databases, Factual
  • Likelihood Functions*
  • Phylogeny*
  • Software*

Substances

  • DNA