Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees

  • Barbara Holland
  • Vincent Moulton
Conference paper

DOI: 10.1007/978-3-540-39763-2_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2812)
Cite this paper as:
Holland B., Moulton V. (2003) Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees. In: Benson G., Page R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science, vol 2812. Springer, Berlin, Heidelberg

Abstract

We present a method for summarising collections of phylogenetic trees that extends the notion of consensus trees. Each branch in a phylogenetic tree corresponds to a bipartition or split of the set of taxa labelling its leaves. Given a collection of phylogenetic trees, each labelled by the same set of taxa, all those splits that appear in more than a predefined threshold proportion of the trees are displayed using a median network. The complexity of this network is bounded as a function of the threshold proportion. We demonstrate the method for a collection of 5000 trees resulting from a Monte Carlo Markov Chain analysis of 37 mammal mitochondrial genomes, and also for a collection of 80 equally parsimonious trees resulting from a heuristic search on 53 human mitochondrial sequences.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Barbara Holland
    • 1
  • Vincent Moulton
    • 2
  1. 1.Allan Wilson Centre for Molecular Ecology and EvolutionMassey UniversityNew Zealand
  2. 2.The Linnaeus Centre for BioinformaticsUppsala UniversityUppsalaSweden

Personalised recommendations