Reticulation in Evolution

نویسنده

  • Arndt von Haeseler
چکیده

Molecular phylogenetics, the study of reconstructing evolutionary trees, is a well-established field of scientific endeavor. However, in certain circumstances evolution is not completely tree-like. For example, a comparison of gene trees representing a set of present-day species and reconstructed for different genetic loci often reveals conflicting tree topologies. These discrepancies are not always due to missampling or difficulties in the gene tree reconstruction method, but rather due to reticulation events such as horizontal gene transfer (HGT) and hybridization. During an HGT event, a DNA segment is transferred from one organism to another which is not its offspring, whereas hybridization describes the origin of a new species through a mating between two different species. Both processes yield genomes that are mixtures of DNA regions derived from different ancestors. Consequently, evolutionary relationships between species whose past includes reticulation can often be better represented by using phylogenetic networks rather than trees. The main focus of this thesis is to develop new biologically motivated theoretical frameworks that provide insight into the extent to which reticulation events have influenced evolution. First, we have implemented the exact algorithm HybridNumber to compute the minimum number of hybridization events for two rooted binary phylogenetic trees. This approach is based on the notion of agreement forests and uses three rules that reduce the size of the problem instance, before calculating the hybridization number. We applied HybridNumber to a grass data set and analyzed the extent of hybridization. We also approached the question whether hybridization events have occurred relatively recently or in the distant past. Furthermore, since many biological data sets lead to reconstructed gene trees that are not fully resolved, we extended the above mentioned framework for rooted phylogenetic trees and showed that calculating the minimum number of hybridization events for two such trees is fixed-parameter tractable. Second, we present a new likelihood framework to estimate a rate of HGT for a set of taxa. To this end, we simulate an increasing number of HGT events on a species tree to obtain a tree distribution that can be used to estimate an HGT rate for a set of gene trees. This framework was applied to the COG (Clusters of Orthologous Groups of Proteins) data set and inaccuracies due to the gene tree reconstruction method were considered. Finally, we give a new result on how to speed up the exact calculation of the rooted subtree prune and regraft distance between two trees which is often used to model reticulation events and end with two interesting examples that give rise to questions for future research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding the Size of a Network Defined By Visibility Property

Phylogenetic networks are mathematical structures for modeling and visualization of reticulation processes in the study of evolution. Galled networks, reticulation visible networks, nearly-stable networks and stable-child networks are the four classes of phylogenetic networks that are recently introduced to study the topological and algorithmic aspects of phylogenetic networks. We prove the fol...

متن کامل

Hybrids in real time.

We describe some new and recent results that allow for the analysis and representation of reticulate evolution by non-tree networks. In particular, we (1) present a simple result to show that, despite the presence of reticulation, there is always a well-defined underlying tree that corresponds to those parts of life that do not have a history of reticulation; (2) describe and apply new theory f...

متن کامل

The categories of lattice-valued maps, equalities, free objects, and $mathcal C$-reticulation

In this paper, we study the concept of $mathcal C$-reticulation for the category $mathcal C$ whose objects are lattice-valued maps. The relation between the free objects in $mathcal C$ and the $mathcal C$-reticulation of rings and modules is discussed. Also, a method to construct $mathcal C$-reticulation is presented, in the case where $mathcal C$ is equational. Some relations between the conce...

متن کامل

Algorithmic Strategies for Estimating the Amount of Reticulation from a Collection of Gene Trees

Phylogenetic networks have emerged as a unifying evolutionary model of both vertical and horizontal inheritance. A major approach for reconstructing such networks is to reconcile gene trees that are reconstructed from various genomic regions. The Subtree Prune and Regraft (SPR) operation has been used to obtain lower bound estimates of the number of reticulation events from a pair of trees. How...

متن کامل

A decomposition theorem and two algorithms for reticulation-visible networks

In studies of molecular evolution, phylogenetic trees are rooted binary trees, whereas phylogenetic networks are rooted acyclic digraphs. Edges are directed away from the root and leaves are uniquely labeled with taxa in phylogenetic networks. For the purpose of validating evolutionary models, biologists check whether or not a phylogenetic tree (resp. cluster) is contained in a phylogenetic net...

متن کامل

11 Hybridization Networks

Reticulate evolution is a fundamental process in the evolution of certain groups of taxa. Consequently, conflicting signals in a data set may not be the result of sampling or modelling errors, but due to the fact that reticulation has played a role in the evolutionary history of the species under consideration. Assuming that our initial data set is correct, a fundamental problem is to compute t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011