Approximation Algorithms for Satisfiable Phylogenetic CSPsResearch Paper
A phylogenetic constraint satisfaction problem asks for a rooted binary tree whose leaves are given variables and which satisfies as many local constraints as possible, each constraint prescribing the shape of the subtree induced on a few leaves. Such problems formalize the reconstruction of an evolutionary tree from information about small groups of…