Abstract: Phylogenetics is the study of the evolutionary relationships between organisms. One of the main challenges in the field is to take biological data for a group of organisms and to infer an evolutionary tree, a graph that represents these relationships. Developing practical and efficient methods for inferring phylogenetic trees has lead to a number of interesting mathematical questions across a variety of fields. However, due to hybridization and gene flow, a phylogenetic network may be a better representation of the evolutionary history of some groups of organisms. In this chapter, we introduce some of the basic concepts in phylogenetics, and present related undergraduate research projects on phylogenetic networks that touch on areas of graph theory and abstract algebra. In the first section, we describe several open research questions related to the combinatorics of phylogenetic networks. In the second, we describe problems related to understanding phylogenetic statistical models as algebraic varieties.
Recommendations
Cites work
- Algebraic statistics
- Algebraic Statistics for Computational Biology
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Basic phylogenetic combinatorics.
- Combinatorial secant varieties
- Distinguishing phylogenetic networks
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- scientific article; zbMATH DE number 5164182 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Identifiability of 3-class Jukes-Cantor mixtures
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Invariants of phylogenies in a simple case with discrete states
- Invariants of some probability models used in phylogenetic inference
- Mathematical Models in Biology
- New characterisations of tree-based networks and proximity measures
- On determining if tree-based networks contain fixed trees
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- Phylogeny. Discrete and random processes in evolution
- Quarnet inference rules for level-1 networks
- Quartet compatibility and the quartet graph
- Reconstructing a phylogenetic level-1 network from quartets
- Toric Ideals of Phylogenetic Invariants
- Trinets encode tree-child and level-2 phylogenetic networks
- Using invariants for phylogenetic tree construction
Cited in
(9)- Phylogenetic networks from multi-labelled trees
- The fine structure of galls in phylogenetic networks
- Folding and unfolding phylogenetic trees and networks
- Species-Driven Persistent Phylogeny
- Conformal blocks, Berenstein-Zelevinsky triangles, and group-based models
- Phylogenetic networks that display a tree twice
- Groves of phylogenetic trees
- The Pfaffian structure of CFN phylogenetic networks
- Biochemical and phylogenetic networks. I: Hypertrees and corona products
This page was built for publication: Phylogenetic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118413)
