SDM: A Fast Distance-Based Approach for (Super)Tree Building in Phylogenomics

• Published in: Systematic biology Vol. 55; no. 5; pp. 740 - 755
• Main Authors: Criscuolo, Alexis, Berry, Vincent, Douzery, Emmanuel J. P., Gascuel, Olivier, Bininda-Emonds, Olaf
• Format: Journal Article
• Language: English
• Published: England Society of Systematic Zoology 01.10.2006; Taylor & Francis; Oxford University Press; Oxford University Press (OUP)
• Subjects: Algorithms; Animals; Biodiversity; Bioinformatics; Classification - methods; Computer Science; Computer Simulation; Datasets; Distance method; Estimated taxes; Evolution; Evolutionary biology; evolutionary distances; Genetic algorithms; Genomics; Heterogeneity; Inference; Life Sciences; MRP; Parsimony; Phylogenetics; phylogenomics; Phylogeny; Populations and Evolution; Quantitative Methods; supermatrix; supertree; Taxa; Taxonomy; Topology; total evidence; total evidence; supermatrix; Distance method; evolutionary distances; MRP; phylogenomics; supertree; distance method
• ISSN: 1063-5157; 1076-836X; 1076-836X
• DOI: 10.1080/10635150600969872

Phylogenomic studies aim to build phylogenies from large sets of homologous genes. Such “genome-sized” data require fast methods, because of the typically large numbers of taxa examined. In this framework, distance-based methods are useful for exploratory studies and building a starting tree to be refined by a more powerful maximum likelihood (ML) approach. However, estimating evolutionary distances directly from concatenated genes gives poor topological signal as genes evolve at different rates. We propose a novel method, named super distance matrix (SDM), which follows the same line as average consensus supertree (ACS; Lapointe and Cucumel, 1997) and combines the evolutionary distances obtained from each gene into a single distance supermatrix to be analyzed using a standard distance-based algorithm. SDM deforms the source matrices, without modifying their topological message, to bring them as close as possible to each other; these deformed matrices are then averaged to obtain the distance supermatrix. We show that this problem is equivalent to the minimization of a least-squares criterion subject to linear constraints. This problem has a unique solution which is obtained by resolving a linear system. As this system is sparse, its practical resolution requires O(na ka) time, where n is the number of taxa, k the number of matrices, and a < 2, which allows the distance supermatrix to be quickly obtained. Several uses of SDM are proposed, from fast exploratory studies to more accurate approaches requiring heavier computing time. Using simulations, we show that SDM is a relevant alternative to the standard matrix representation with parsimony (MRP) method, notably when the taxa sets of the different genes have low overlap. We also show that SDM can be used to build an excellent starting tree for an ML approach, which both reduces the computing time and increases the topogical accuracy. We use SDM to analyze the data set of Gatesy et al. (2002, Syst. Biol. 51: 652–664) that involves 48 genes of 75 placental mammals. The results indicate that these genes have strong rate heterogeneity and confirm the simulation conclusions.