36 citations · 178 across the 88 of their papers we have counts for
6 papers · 1 filter
The optimal rate for resolving a near-polytomy in a phylogeny
Mike Steel, Christoph Leuenberger
The reconstruction of phylogenetic trees from discrete character data typically relies on models that assume the characters evolve under a continuous-time Markov process operating…
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…
Can we 'future-proof' consensus trees?
David Bryant, Andrew Francis, Mike Steel
Consensus methods are widely used for combining phylogenetic trees into a single estimate of the evolutionary tree for a group of species. As more taxa are added, the new source tr…
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…
Autocatalytic sets in polymer networks with variable catalysis distributions
Wim Hordijk, Mike Steel
All living systems -- from the origin of life to modern cells -- rely on a set of biochemical reactions that are simultaneously self-sustaining and autocatalytic. This notion of an…
Phylogenetic mixtures and linear invariants for equal input models
Marta Casanellas, Mike Steel
The reconstruction of phylogenetic trees from molecular sequence data relies on modelling site substitutions by a Markov process, or a mixture of such processes. In general, allowi…