36 citations · 178 across the 88 of their papers we have counts for
9 papers · 1 filter
Defining phylogenetic networks using ancestral profiles
Allan Bai, Peter Erdos, Charles Semple +1
Rooted phylogenetic networks provide a more complete representation of the ancestral relationship between species than phylogenetic trees when reticulate evolutionary processes are…
A class of phylogenetic networks reconstructable from ancestral profiles
Peter L. Erdos, Charles Semple, Mike Steel
Rooted phylogenetic networks provide an explicit representation of the evolutionary history of a set of sampled species. In contrast to phylogenetic trees which show only speci…
Phylogenetic flexibility via Hall-type inequalities and submodularity
Katharina T. Huber, Vincent Moulton, Mike Steel
Given a collection of subsets of a finite set , we say that is {\em phylogenetically flexible} if, for any collection of rooted phylogenetic trees whose leaf sets co…
Combinatorial properties of triplet covers for binary trees
Stefan Gruenewald, Katharina T. Huber, Vincent Moulton +1
It is a classical result that an unrooted tree having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between eac…
New Characterisations of Tree-Based Networks and Proximity Measures
Andrew Francis, Charles Semple, Mike Steel
Phylogenetic networks are a type of directed acyclic graph that represent how a set of present-day species are descended from a common ancestor by processes of speciation and r…
Minimum triplet covers of binary phylogenetic -trees
Katharina T. Huber, Vincent Moulton, Mike Steel
Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial res…
A matroid associated with a phylogenetic tree
Andreas Dress, Katharina Huber, Mike Steel
A (pseudo-)metric on a finite set is said to be a `tree metric' if there is a finite tree with leaf set and non-negative edge weights so that, for all , $D(x…
Reconstructing fully-resolved trees from triplet cover distances
Katharina T. Huber, Mike Steel
It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pa…
A Hall-type theorem for triplet set systems based on medians in trees
Andreas Dress, Mike Steel
Given a collection $\C$ of subsets of a finite set , let $\bigcup \C = \cup_{S \in \C}S$. Philip Hall's celebrated theorem \cite{hall} concerning `systems of distinct representa…