3 citations · 3 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
Jordan Dempsey, Leo van Iersel, Mark Jones +1
We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a re…
cs.DS2021
An algorithm for reconstructing level-2 phylogenetic networks from trinets
Leo van Iersel, Sjors Kole, Vincent Moulton +1
Evolutionary histories for species that cross with one another or exchange genetic material can be represented by leaf-labelled, directed graphs called phylogenetic networks. A maj…