CSCharles Semple

Charles Semple

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Charles Semple has a total of 96 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Binary normal networks without near reticulations can be reconstructed from their rooted triples

    by Andrew Francis, Charles Semple

    Normal networks are an important class of phylogenetic networks that have compelling mathematical properties which align with intuition about inference from genetic data. While tools enabling widespread use of phylogenetic networks in the biological literature are still under mathematical, statistical, and computational development, many such results are being assembled, and in particular for normal phylogenetic networks. For instance, it has been shown that binary normal networks can be reconstructed from the sets of three- and four-leaf rooted phylogenetic trees that they display. It is also known that one can reconstruct particular subclasses of normal networks from just the displayed rooted triples. This applies, for instance, to rooted binary phylogenetic trees and to binary level-1 normal networks. In this paper we address the question of how much of the class of binary normal networks can be reconstructed from just the rooted triples that they display. We find that all except those with substructures that we call “near-sibling reticulations” and “near-stack reticulations” can be reconstructed just from their rooted triples. This goes some way to answering the natural question of how much information can be extracted from a set of displayed rooted triples, which are arguably the simplest substructure that one may hope for in a phylogenetic object.

  • Open Access

    A Sharp Lower Bound for the Number of Phylogenetic Trees Displayed by a Tree-Child Network

    by Charles Semple, Kristina Wicke

    A normal (phylogenetic) network with k reticulations displays $$2^k$$ 2 k phylogenetic trees. In this paper, we establish an analogous result for tree-child (phylogenetic) networks with no underlying 3-cycles. In particular, we show that a tree-child network with $$k\ge 2$$ k ≥ 2 reticulations and no underlying 3-cycles displays at least $$2^{{k}/{2}}$$ 2 k / 2 phylogenetic trees if k is even and at least $$\frac{3}{2\sqrt{2}}2^{{k}/{2}}$$ 3 2 2 2 k / 2 if k is odd. Moreover, we show that these bounds are sharp and characterise the tree-child networks that attain these bounds.

  • Open Access

    Binary normal networks without near reticulations can be reconstructed from their rooted triples

    by Andrew Francis, Charles Semple

    Normal networks are an important class of phylogenetic networks that have compelling mathematical properties which align with intuition about inference from genetic data. While tools enabling widespread use of phylogenetic networks in the biological literature are still under mathematical, statistical, and computational development, many such results are being assembled, and in particular for normal phylogenetic networks. For instance, it has been shown that binary normal networks can be reconstructed from the sets of three- and four-leaf rooted phylogenetic trees that they display. It is also known that one can reconstruct particular subclasses of normal networks from just the displayed rooted triples. This applies, for instance, to rooted binary phylogenetic trees and to binary level-$1$ normal networks. In this paper we address the question of how much of the class of binary normal networks can be reconstructed from just the rooted triples that they display. We find that all except those with substructures that we call ``near-sibling reticulations'' and ``near-stack reticulations'' can be reconstructed just from their rooted triples. This goes some way to answering the natural question of how much information can be extracted from a set of displayed rooted triples, which are arguably the simplest substructure that one may hope for in a phylogenetic object.

  • Open Access

    The excluded minors of the class of spike minors

    by Sam Bastida, Nick Brettell, Rutger Campbell, George Drummond, Emma Hogan, Charles Semple, Gerry Toft

    Mayhew et al.\ (2021) posed the problem of showing that the minor-closed class of spikes and their minors has a finite set of excluded minors and describing all of them. In this paper, we resolve this problem.

  • Open Access

    A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network

    by Charles Semple, Kristina Wicke

    A normal (phylogenetic) network with $k$ reticulations displays $2^k$ phylogenetic trees. In this paper, we establish an analogous result for tree-child (phylogenetic) networks with no underlying $3$-cycles. In particular, we show that a tree-child network with $k\ge 2$ reticulations and no underlying $3$-cycles displays at least $2^{k/2}$ phylogenetic trees if $k$ is even and at least $\frac{3}{2\sqrt{2}}2^{k/2}$ if $k$ is odd. Moreover, we show that these bounds are sharp and characterise the tree-child networks that attain these bounds.

  • Open Access

    Bounding the SNPR Distance Between Two Tree-Child Networks Using Generalised Agreement Forests

    by Steven Kelk, Simone Linz, Charles Semple

    Agreement forests continue to play a central role in the comparison of phylogenetic trees since their introduction more than 25 years ago. More specifically, they are used to characterise several distances that are based on tree rearrangement operations and related quantifiers of dissimilarity between phylogenetic trees. In addition, the concept of agreement forests continues to underlie most advancements in the development of algorithms that exactly compute the aforementioned measures. In this paper, we introduce agreement digraphs, a concept that generalises agreement forests for two phylogenetic trees to two phylogenetic networks. Analogous to the way in which agreement forests compute the subtree prune and regraft distance between two phylogenetic trees but inherently more complex, we then use agreement digraphs to bound the subnet prune and regraft distance between two tree-child networks from above and below and show that our bounds are tight.


  • Open Access

    What is a $4$-Connected Matroid?

    by Nick Brettell, Susan Jowett, James Oxley, Charles Semple, Geoff Whittle

    The breadth of a tangle $\mathcal{T}$ in a matroid is the size of the largest spanning uniform submatroid of the tangle matroid of $\mathcal{T}$. The matroid $M$ is weakly $4$-connected if it is 3-connected and whenever $(X,Y)$ is a partition of $E(M)$ with $|X|,|Y|>4$, then $\lambda(X)\geq 3$. We prove that if $\mathcal{T}$ is a tangle of order $k\geq 4$ and breadth $l$ in a matroid $M$, then $M$ has a weakly 4-connected minor $N$ with a tangle $\mathcal{T}_N$ of order $k$, breadth $l$ and has the property that $\mathcal{T}$ is the tangle in $M$ induced by $\mathcal{T}_N$. A set $Z$ of elements of a matroid $M$ is $4$-connected if $\lambda(A)\geq\min\{|A\cap Z|,|Z-A|,3\}$ for all $A\subseteq E(M)$. As a corollary of our theorems on tangles we prove that if $M$ contains an $n$-element $4$-connected set where $n\geq 7$, then $M$ has a weakly $4$-connected minor that contains an $n$-element $4$-connected set.


  • Open Access

    Phylogenetic Trees Defined by at Most Three Characters

    by Katharina Huber, Simone Linz, Vincent Moulton, Charles Semple

    In evolutionary biology, phylogenetic trees are commonly inferred from a set of characters (partitions) of a collection of biological entities (e.g., species or individuals in a population). Such characters naturally arise from molecular sequences or morphological data. Interestingly, it has been known for some time that any binary phylogenetic tree can be (convexly) defined by a set of at most four characters, and that there are binary phylogenetic trees for which three characters are not enough. Thus, it is of interest to characterise those phylogenetic trees that are defined by a set of at most three characters. In this paper, we provide such a characterisation, in particular proving that a binary phylogenetic tree $T$ is defined by a set of at most three dcharacters precisely if $T$ has no internal subtree isomorphic to a certain tree.


  • Open Access

    When is a set of phylogenetic trees displayed by a normal network?

    by Magnus Bordewich, Simone Linz, Charles Semple

    A normal network is uniquely determined by the set of phylogenetic trees that it displays. Given a set $\mathcal{P}$ of rooted binary phylogenetic trees, this paper presents a polynomial-time algorithm that reconstructs the unique binary normal network whose set of displayed binary trees is $\mathcal{P}$, if such a network exists. Additionally, we show that any two rooted phylogenetic trees can be displayed by a normal network and show that this result does not extend to more than two trees. This is in contrast to tree-child networks where it has been previously shown that any collection of rooted phylogenetic trees can be displayed by a tree-child network. Lastly, we introduce a type of cherry-picking sequence that characterises when a collection $\mathcal{P}$ of rooted phylogenetic trees can be displayed by a normal network and, further, characterise the minimum number of reticulations needed over all normal networks that display $\mathcal{P}$. We then exploit these sequences to show that, for all $n\ge 3$, there exist two rooted binary phylogenetic trees on $n$ leaves that can be displayed by a tree-child network with a single reticulation, but cannot be displayed by a normal network with less than $n-2$ reticulations.

  • Open Access

    Quantifying the difference between phylogenetic diversity and diversity indices

    by Magnus Bordewich, Charles Semple

    Phylogenetic diversity is a popular measure for quantifying the biodiversity of a collection Y of species, while phylogenetic diversity indices provide a way to apportion phylogenetic diversity to individual species. Typically, for some specific diversity index, the phylogenetic diversity of Y is not equal to the sum of the diversity indices of the species in Y. In this paper, we investigate the extent of this difference for two commonly-used indices: Fair Proportion and Equal Splits. In particular, we determine the maximum value of this difference under various instances including when the associated rooted phylogenetic tree is allowed to vary across all rooted phylogenetic trees with the same leaf set and whose edge lengths are constrained by either their total sum or their maximum value.