Skip to main content Accessibility help
×
Hostname: page-component-5c6d5d7d68-wbk2r Total loading time: 0 Render date: 2024-08-16T22:18:13.173Z Has data issue: false hasContentIssue false

6 - Consensus and Agreement Trees

from PART I - BASIC TECHNIQUES

Published online by Cambridge University Press:  26 October 2017

Tandy Warnow
Affiliation:
University of Illinois, Urbana-Champaign
Get access

Summary

Introduction

In this chapter we discuss techniques for analyzing sets of trees, which are called profiles. Depending on how the set of trees was computed and the objective of the analysis, different techniques are needed.

For example, when a maximum parsimony analysis is performed, many equally good trees may be found, all having the same “best” score (meaning that it is the best score found during the analysis). Similarly, when a Bayesian MCMC (see Section 8.7) analysis is performed, then a random sample of the trees is examined. Sometimes, many different types of methods are used on the same data, and for each analysis a set of trees is obtained. Then, from the full set of trees, each of which has been estimated on the same data, again some kind of point estimate is sought. In each of these cases, a “consensus method” is used to provide a point estimate of the tree from the full set of trees.

An alternative objective might be to find those subsets of the taxon set on which all or most of the trees in the profile agree; this kind of approach does not produce a point estimate of the true tree, but can be used to identify the portion of the history on which all trees agree, and also (potentially) problematic taxa. We refer to this type of approach as an “agreement method.”

In this chapter, we discuss consensus and agreement methods, which are methods for analyzing datasets of trees under the assumption that all the trees are estimated species trees with the same leafset S. We discuss supertree methods in Chapter 7, which extend the consensus methods in this chapter to allow for the taxon sets to be different between trees. Finally, methods for analyzing sets of gene trees that can differ from each other due to incomplete lineage sorting, horizontal gene transfer, or gene duplication and loss are discussed in Chapter 10. Many of the methods described in Chapter 10 can also be used as supertree methods.

Consensus Trees

In general, consensus methods are applied to unrooted trees (and we will define them in that context), but they can be modified so as to be applicable to rooted trees as well.

Type
Chapter
Information
Computational Phylogenetics
An Introduction to Designing Methods for Phylogeny Estimation
, pp. 109 - 120
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Consensus and Agreement Trees
  • Tandy Warnow, University of Illinois, Urbana-Champaign
  • Book: Computational Phylogenetics
  • Online publication: 26 October 2017
  • Chapter DOI: https://doi.org/10.1017/9781316882313.008
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Consensus and Agreement Trees
  • Tandy Warnow, University of Illinois, Urbana-Champaign
  • Book: Computational Phylogenetics
  • Online publication: 26 October 2017
  • Chapter DOI: https://doi.org/10.1017/9781316882313.008
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Consensus and Agreement Trees
  • Tandy Warnow, University of Illinois, Urbana-Champaign
  • Book: Computational Phylogenetics
  • Online publication: 26 October 2017
  • Chapter DOI: https://doi.org/10.1017/9781316882313.008
Available formats
×