Two new distance based methods for phylogenetic tree reconstruction

Phylogenetic tree reconstruction is a fundamental problem in biology. In this paper, we propose two new distance based methods for phylogenetic tree reconstruction. One is called double selecting (DS) method. Gronau and Moran (J. Comput. Biol., 14 (2007): 1–5) proposed a Deepest Least Common Ancestor (DLCA) method for phylogenetic tree reconstruction. Our another method is modified version of DLCA and called mDLCA method. Using some data sets, we study the accuracy of these two methods in obtaining the correct unrooted tree in comparison with that of three other tree-making methods: the neighbor-joining (NJ) method, the unweighted pair group (UPGMA) method and DLCA algorithms. The results show that the DS method and mDLCA method perform same well as the NJ method, and are better than UPGMA and DLCA methods. Especially, the DS method even is slightly better than the NJ method in some cases.

[1]  Wen-Hsiung Li,et al.  NJML+: an extension of the NJML method to handle protein sequence data and computer software implementation. , 2001, Molecular biology and evolution.

[2]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[3]  O Gascuel,et al.  BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. , 1997, Molecular biology and evolution.

[4]  P. Sneath,et al.  Numerical Taxonomy , 1962, Nature.

[5]  D. Faith.  Distance Methods and the Approximation of Most-Parsimonious Trees , 1985 .

[6]  J. Hartigan.  MINIMUM MUTATION FITS TO A GIVEN TREE , 1973 .

[7]  W. Fitch,et al.  Construction of phylogenetic trees. , 1967, Science.

[8]  Shlomo Moran,et al.  Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances , 2007, J. Comput. Biol..

[9]  K. Chu,et al.  Phylogeny of Prokaryotes and Chloroplasts Revealed by a Simple Composition Approach on All Protein Sequences from Complete Genomes Without Sequence Alignment , 2005, Journal of Molecular Evolution.

[10]  Wei Zhang,et al.  Random local neighbor joining: a new method for reconstructing phylogenetic trees. , 2008, Molecular phylogenetics and evolution.

[11]  J. A. Studier,et al.  A note on the neighbor-joining algorithm of Saitou and Nei. , 1988, Molecular biology and evolution.

[12]  Walter M. Fitch,et al.  A non-sequential method for constructing trees and hierarchical classifications , 2005, Journal of Molecular Evolution.

[13]  Thomas Mailund,et al.  QuickJoin - fast neighbour-joining tree reconstruction , 2004, Bioinform..

[14]  N. Saitou,et al.  Relative Efficiencies of the Fitch-Margoliash, Maximum-Parsimony, Maximum-Likelihood, Minimum-Evolution, and Neighbor-joining Methods of Phylogenetic Tree Construction in Obtaining the Correct Tree , 1989 .

[15]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[16]  Zu-Guo Yu,et al.  Proper Distance Metrics for Phylogenetic Analysis Using Complete Genomes without Sequence Alignment , 2010, International journal of molecular sciences.

[17]  M. Nei,et al.  A Simple Method for Estimating and Testing Minimum-Evolution Trees , 1992 .

[18]  E. Tillier,et al.  Neighbor Joining and Maximum Likelihood with RNA Sequences: Addressing the Interdependence of Sites , 1995 .

[19]  Yoshio Tateno,et al.  Accuracy of estimated phylogenetic trees from molecular data , 2005, Journal of Molecular Evolution.

[20]  A. Tversky,et al.  Additive similarity trees , 1977 .

[21]  J. Felsenstein.  Phylogenies from molecular sequences: inference and reliability. , 1988, Annual review of genetics.

[22]  J. Felsenstein.  Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.