9 citations · 21 across the 5 of their papers we have counts for
1 paper · 1 filter
Hadi Poormohammadi, Changiz Eslahchi, Ruzbeh Tusserkani
The problem of constructing an optimal rooted phylogenetic network from a set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripN…