Consensus networks: A method for visualising incompatibilities in collections of trees

Holland, Barbara and Moulton, Vincent ORCID: https://orcid.org/0000-0001-9371-6435 (2003) Consensus networks: A method for visualising incompatibilities in collections of trees. In: Algorithms in Bioinformatics. Lecture Notes in Computer Science, 2812 . Springer Berlin / Heidelberg, pp. 165-176.

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

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.

Item Type:	Book Section
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018)
Depositing User:	EPrints Services
Date Deposited:	01 Oct 2010 13:42
Last Modified:	24 Sep 2024 07:47
URI:	https://ueaeprints.uea.ac.uk/id/eprint/3356
DOI:	10.1007/978-3-540-39763-2_13

Actions (login required)

View Item