TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets
Hadi Poormohammadi, Changiz Eslahchi, and Ruzbeh Tusserkani
TL;DR
This paper introduces TripNet, a heuristic algorithm designed to construct rooted phylogenetic networks from triplet data, addressing an NP-hard problem with proven theoretical performance bounds.
Contribution
The paper presents a novel heuristic algorithm, TripNet, for constructing rooted phylogenetic networks from triplets, including theoretical justifications for its effectiveness.
Findings
Algorithm successfully constructs phylogenetic networks from triplet sets.
Theoretical performance bounds are established for TripNet.
The method offers a practical approach to a computationally hard problem.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenomics and Phylogenetic Studies · Genome Rearrangement Algorithms · Algorithms and Data Compression