6 citations · 8 across the 4 of their papers we have counts for
4 papers
Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests
Benjamin Albrecht
There exist several methods dealing with the reconstruction of rooted phylogenetic networks explaining different evolutionary histories given by rooted binary phylogenetic trees. I…
Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees
Benjamin Albrecht
Evolutionary scenarios displaying reticulation events are often represented by rooted phylogenetic networks. Due to biological reasons, those events occur very rarely, and, thus, n…
Computing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests
Benjamin Albrecht
It is a known fact that, given two rooted binary phylogenetic trees, the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum h…
A first step towards computing all hybridization networks for two rooted binary phylogenetic trees
Celine Scornavacca, Simone Linz, Benjamin Albrecht
Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimu…