36 citations · 178 across the 88 of their papers we have counts for
8 papers · 1 filter
Can we avoid 'SIN' in the house of 'No Common Mechanism'?
Mike Steel
In 'no common mechanism' (NCM) models of character evolution, each character can evolve on a phylogenetic tree under a partially or totally separate process (e.g. with its own bran…
Trait-dependent extinction leads to greater expected biodiversity loss
Beata Faller, Mike Steel
We use a classical combinatorial inequality to establish a Markov inequality for multivariate binary Markov processes on trees. We then apply this result, alongside with the FKG in…
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…
Expected length of pendant and interior edges of a Yule tree
Mike Steel, Arne Mooers
The Yule (pure-birth) model is the simplest null model of speciation; each lineage gives rise to a new lineage independently with the same rate . We investigate the expected len…
Species, Clusters and the 'Tree of Life': A graph-theoretic perspective
Andreas Dress, Vincent Moulton, Mike Steel +1
A hierarchical structure describing the inter-relationships of species has long been a fundamental concept in systematic biology, from Linnean classification through to the more re…
Characterizing phylogenetically decisive taxon coverage
Mike Steel, Michael J. Sanderson
Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a `supertree' that classifies all the taxa.…
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…
An improved bound on the Maximum Agreement Subtree problem
Laszlo Szekely, Mike Steel
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same leaves have subtrees with the sam…