PhyD* – Fast NJ-like algorithms to deal with incomplete Distance Matrices

PhyD*

:: DESCRIPTION

PhyD* implements four distance-based tree building algorithms: NJ*, UNJ*, BioNJ* and MVR*. These extend the four algorithms NJ (Saitou and Nei, 1987; Studier and Keppler, 1988), UNJ (Gascuel, 1997), BioNJ (Gascuel, 1997) and MVR (Gascuel, 2000) in order to build phylogenetic trees from incomplete distance matrices.

Advertisement

::DEVELOPER

Criscuolo A., Gascuel O.

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Windows / Linux / Mac OsX
  • Java

:: DOWNLOAD

 PhyD*

:: MORE INFORMATION

Citation

Fast NJ-like algorithms to deal with incomplete distance matrices.”
Criscuolo A., Gascuel O.
BMC Bioinformatics. 2008, Mar 26;9:166

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.