4 citations · 5 across the 3 of their papers we have counts for
3 papers
q-bio.PE2024
Invariants for level-1 phylogenetic networks under the random walk 4-state Markov model
M. Frohn, N. Holtgrefe, L. van Iersel +2
Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees, such as hybridization, introgression, and lateral gene transfer. Studying ph…
cs.DS2020★ 4 cited
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees
Sander Borst, Leo van Iersel, Mark Jones +1
We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. First, we introduce an FPT algorithm fo…
cs.DM2014★ 1 cited
On low treewidth graphs and supertrees
Alexander Grigoriev, Steven Kelk, Nela Lekic
Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees there exists a larger tree (called…