Bioinformatics Advance Access originally published online on April 1, 2004
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Bioinformatics 20(13) © Oxford University Press 2004; all rights reserved.
A weighted least-squares approach for inferring phylogenies from incomplete distance matrices
1 Département d'Informatique, Université du Québec à Montréal, C.P. 8888, Succ. Centre-Ville, Montréal, Québec, Canada H3C 3P8, 2 Institute of Control Sciences, 65 Profsoyuznaya, Moscow 117806, Russia and 3 Département de Sciences Biologiques, Université de Montréal, C.P. 6128, Succ. Centre-ville, Montréal, Québec, Canada H3C 3J7
Received on April 4, 2003; revised on February 20, 2004; accepted on February 20, 2004
Advance Access Publication April 1, 2004
Motivation: The problem of phylogenetic inference from datasets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares approximation to solve the problem of missing entries. It can be applied to infer phylogenies from evolutionary data including some missing or uncertain information, for instance, when observed nucleotide or protein sequences contain gaps or missing entries.
Results: In a number of simulations involving incomplete datasets, the proposed method outperformed the well-known Ultrametric and Additive procedures. Generally, the new method also outperformed all the other competing approaches including Triangle and Fitch which is the most popular least-squares method for reconstructing phylogenies. We illustrate the usefulness of the introduced method by analyzing two well-known phylogenies derived from complete mammalian mtDNA sequences. Some interesting theoretical results concerning the NP-hardness of the ordinary and weighted least-squares fitting of a phylogenetic tree to a partial distance matrix are also established.
Availability: The T-Rex package including this method is freely available for download at http://www.info.uqam.ca/~makarenv/trex.html
Contact: makarenkov.vladimir{at}uqam.ca
* To whom correspondence should be addressed.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  F. Cheng, S. Hartmann, M. Gupta, J. G. Ibrahim, and T. J. Vision A hierarchical model for incomplete alignments in phylogenetic inference Bioinformatics, March 1, 2009; 25(5): 592 - 598. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 O. Gauthier and F.-J. Lapointe Seeing the Trees for the Network: Consensus, Information Content, and Superphylogenies Syst Biol, April 1, 2007; 56(2): 345 - 355. [Full Text] [PDF]
|
|
|
|
|
|
B. Holland, G. Conner, K. Huber, and V. Moulton Imputing Supertrees and Supernetworks from Quartets Syst Biol, February 1, 2007; 56(1): 57 - 67. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
A. Criscuolo, V. Berry, E. J. P. Douzery, and O. Gascuel SDM: A Fast Distance-Based Approach for (Super)Tree Building in Phylogenomics Syst Biol, October 1, 2006; 55(5): 740 - 755. [Abstract] [Full Text] [PDF]
|
|