57 citations · 110 across the 40 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Metropolis-Hastings Sampling of Phylogenetic Networks: Correcting for Symmetries
Leo van Iersel, Remie Janssen, Mark Jones +2
In phylogenetics, Metropolis-Hastings methods are commonly used to sample phylogenetic trees or networks, for example from Bayesian posteriors. These methods generally use transiti…
cs.DM2013★ 2 cited
Kernelizations for the hybridization number problem on multiple nonbinary trees
Leo van Iersel, Steven Kelk, Celine Scornavacca
Given a finite set , a collection of rooted phylogenetic trees on and an integer , the Hybridization Number problem asks if there exists a phylogenetic netw…
cs.DM2009
Computing Rooted and Unrooted Maximum Consistent Supertrees
Leo van Iersel, Matthias Mnich
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted b…