@inbook{e944a7a18a71453ab6add7f10a38e4bc,

title = "Consensus networks: A method for visualising incompatibilities in collections of trees",

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.",

author = "Barbara Holland and Vincent Moulton",

year = "2003",

doi = "10.1007/978-3-540-39763-2_13",

language = "English",

volume = "2812",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin / Heidelberg",

pages = "165--176",

editor = "Gary Benson and Roderic Page",

booktitle = "Algorithms in Bioinformatics",

}