PhyD*: Fast NJ-like algorithms to deal with incomplete distance matrices.

Paper

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

Related paper

• "Concerning the NJ algorithm and its unweighted version, UNJ."
  Gascuel O.
  "Mathematical Hierarchies and Biology", Mirkin B., McMorris F.R., Roberts F.S., and Rzhetsky A. (Eds.).
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Amer. Math. Society, Providence
  1997 149-170.
• "BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data."
  Gascuel O.
  Molecular Biology and Evolution. 1997 14:685-695.
• "Data model and classification by trees: the minimum variance reduction (MVR) method."
  Gascuel O.
  Journal of Classification. 2000 17(1):67-99.
• "The neighbor-joining method: a new method for reconstructing phylogenetic trees."
  Saitou N., Nei M.
  Molecular Biology and Evolution. 1987 4:406-425.
• "A note on the neighbor-joining method of Saitou and Nei."
  Studier J.A., Keppler K.J.
  Molecular Biology and Evolution. 1988 5:729-731.

References

• "PHYLIP: Phylogeny inference package, version 3.6b."
  Felsenstein J.
  Distributed by the author. University of Washinton, Seattle.

Contacts

• Alexis Criscuolo (author)
  LIRMM, Montpellier, France.
  Web page: http://www.lirmm.fr/~criscuol/
• Olivier Gascuel (author)
  LIRMM, Montpellier, France.