Imputing Supertrees and Supernetworks from Quartets

Holland, B., Conner, Glenn, Huber, Katharina T. and Moulton, V. (2007) Imputing Supertrees and Supernetworks from Quartets. Systematic Biology, 56 (1). pp. 57-67. ISSN 1063-5157

Full text not available from this repository. (Request a copy)

Abstract

Inferring species phylogenies is an important part of understanding molecular evolution. Even so, it is well known that an accurate phylogenetic tree reconstruction for a single gene does not always necessarily correspond to the species phylogeny. One commonly accepted strategy to cope with this problem is to sequence many genes; the way in which to analyze the resulting collection of genes is somewhat more contentious. Supermatrix and supertree methods can be used, although these can suppress conflicts arising from true differences in the gene trees caused by processes such as lineage sorting, horizontal gene transfer, or gene duplication and loss. In 2004, Huson et al. (IEEE/ACM Trans. Comput. Biol. Bioinformatics 1:151–158) presented the Z-closure method that can circumvent this problem by generating a supernetwork as opposed to a supertree. Here we present an alternative way for generating supernetworks called Q-imputation. In particular, we describe a method that uses quartet information to add missing taxa into gene trees. The resulting trees are subsequently used to generate consensus networks, networks that generalize strict and majority-rule consensus trees. Through simulations and application to real data sets, we compare Q-imputation to the matrix representation with parsimony (MRP) supertree method and Z-closure, and demonstrate that it provides a useful complementary tool.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Vishal Gautam
Date Deposited: 18 May 2011 11:20
Last Modified: 21 Apr 2020 19:24
URI: https://ueaeprints.uea.ac.uk/id/eprint/21936
DOI: 10.1080/10635150601167013

Actions (login required)

View Item View Item