2012/01/18 by Hadi Poormohammadi, Poormohammadi, Hadi, Changiz Eslahchi +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #FOS: Biological sciences #FOS: Computer and information sciences #Genome Rearrangement Algorithms #Genomics and Phylogenetic Studies #Populations and Evolution (q-bio.PE) #cs.DS #q-bio.PE
paper · pdf · doi:10.48550/arxiv.1201.3722
20 pages, 5 figures, Regular paper
arxiv created 2012/01/18 · openalex publication_date 2012/01/18 · arxiv updated 2012/01/19 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.