collaborators

5 papers

math.CO2017

Recovering tree-child networks from shortest inter-taxa distance information

Magnus Bordewich, Katharina T Huber, Vincent Moulton +1

Phylogenetic networks are a type of leaf-labelled, acyclic, directed graph used by biologists to represent the evolutionary history of species whose past includes reticulation even…

q-bio.PE2017

Quarnet inference rules for level-1 networks

Katharine T. Huber, Vincent Moulton, Charles Semple +1

An important problem in phylogenetics is the construction of phylogenetic trees. One way to approach this problem, known as the supertree method, involves inferring a phylogenetic…

math.CO2017

A universal tree-based network with the minimum number of reticulations

Magnus Bordewich, Charles Semple

A tree-based network on is universal if every rooted binary phylogenetic -tree is a base tree for . Hayamizu and, independently, Zhang constructivel…

math.CO2017

A splitter theorem for 3-connected 2-polymatroids

James Oxley, Charles Semple, Geoff Whittle

Seymour's Splitter Theorem is a basic inductive tool for dealing with -connected matroids. This paper proves a generalization of that theorem for the class of -polymatroids.…

q-bio.PE2009

Quantifying the Extent of Lateral Gene Transfer Required to Avert a `Genome of Eden'

Leo van Iersel, Charles Semple, Mike Steel

The complex pattern of presence and absence of many genes across different species provides tantalising clues as to how genes evolved through the processes of gene genesis, gene lo…