TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets
classification
💻 cs.DS
q-bio.PE
keywords
rootedalgorithmphylogenetictripletsconstructingheuristicnetworkoptimal
read the original abstract
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 TripNet which tries to construct an optimal rooted phylogenetic network from an arbitrary set of triplets. We prove some theorems to justify the performance of the algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.