most citedNew FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

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…