Fast Coalescent-Based Computation of Local Branch Support from Quartet Frequencies

Mol Biol Evol. 2016 Jul;33(7):1654-68. doi: 10.1093/molbev/msw079. Epub 2016 Apr 15.

Abstract

Species tree reconstruction is complicated by effects of incomplete lineage sorting, commonly modeled by the multi-species coalescent model (MSC). While there has been substantial progress in developing methods that estimate a species tree given a collection of gene trees, less attention has been paid to fast and accurate methods of quantifying support. In this article, we propose a fast algorithm to compute quartet-based support for each branch of a given species tree with regard to a given set of gene trees. We then show how the quartet support can be used in the context of the MSC to compute (1) the local posterior probability (PP) that the branch is in the species tree and (2) the length of the branch in coalescent units. We evaluate the precision and recall of the local PP on a wide set of simulated and biological datasets, and show that it has very high precision and improved recall compared with multi-locus bootstrapping. The estimated branch lengths are highly accurate when gene tree estimation error is low, but are underestimated when gene tree estimation error increases. Computation of both the branch length and local PP is implemented as new features in ASTRAL.

Keywords: ASTRAL; Incomplete lineage sorting; branch length estimation.; local support; multi-species coalescent; posterior probability; quartet-based methods.

Publication types

  • Research Support, U.S. Gov't, Non-P.H.S.

MeSH terms

  • Algorithms
  • Bayes Theorem
  • Computational Biology / methods*
  • Computer Simulation
  • Genetic Speciation
  • Genomics / methods*
  • Models, Genetic*
  • Phylogeny
  • Probability