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.DM2019
Combining Networks using Cherry Picking Sequences
Remie Janssen, Mark Jones, Yukihiro Murakami
Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks…
cs.DM2019
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
Leo van Iersel, Remie Janssen, Mark Jones +2
We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number…