Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-09T08:31:53.893Z Has data issue: false hasContentIssue false

2 - Evolutionary trees

from Part I - Theory

Published online by Cambridge University Press:  05 October 2015

Alexei J. Drummond
Affiliation:
University of Auckland
Remco R. Bouckaert
Affiliation:
University of Auckland
Get access

Summary

Types of trees

This book is about evolution, and one of the fundamental features of evolutionary analysis is the tree. The terms tree and phylogeny are used quite loosely in the literature for the purposes of describing a number of quite distinct objects. Evolutionary trees are a subset of the group of objects that graph theorists know as trees, which are themselves connected graphs that do not contain cycles. An evolutionary tree typically has labelled leaf nodes (tips) and unlabelled internal nodes (an internal node may also be known as a divergence or coalescence). The leaf nodes are labelled with taxa, which might represent an individual organism, or a whole species, or more typically just a gene fragment, while the internal nodes represent unsampled (and thus inferred) common ancestors of the sampled taxa. For reasons mainly of history, the types of trees are many and varied; in the following we introduce the main types.

2.1.1 Rooted and unrooted trees

One of the more important distinctions is between rooted trees and unrooted trees (Figure 2.1). Both of the trees in Figure 2.1 describe the evolutionary relationships between four taxa labelled A to D.

A rooted tree has a notion of the direction in which evolution occurred. One internal node is identified as the root, and evolution proceeds from the root to the leaves. A tree is said to be binary if its internal nodes always have precisely two children. A rooted binary tree of n taxa can be described by 2n−1 nodes and 2n−2 branches, each with an associated branch length. A rooted binary tree is displayed in Figure 2.1a; note that the path length between two leaf nodes should be measured only by the sum of the lengths of the horizontal lines along the shortest path connecting the two leaves. The vertical lines exist purely for the purpose of visual layout. Taxon A is actually the shortest distance of all the taxa to taxon D, even though taxon A is the furthest from D vertically.

In contrast, an unrooted tree does not have a root and so does not admit any knowledge of which direction evolution ‘flows’. The starting point is not known, so the tree is generally drawn with the leaf nodes spread around the perimeter of the diagram.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2015

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 [email protected] 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.

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.

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.

Available formats
×