title: Optimizing phylogenetic networks for circular split systems.
abstract: We address the problem of realizing a given distance matrix by a planar phylogenetic network with a minimum number of faces. With the help of the popular software SplitsTree4, we start by approximating the distance matrix with a distance metric that is a linear combination of circular splits. The main results of this paper are the necessary and sufficient conditions for the existence of a network with a single face. We show how such a network can be constructed, and we present a heuristic for constructing a network with few faces using the first algorithm as the base case. Experimental results on biological data show that this heuristic algorithm can produce phylogenetic networks with far fewer faces than the ones computed by SplitsTree4, without affecting the approximation of the distance matrix.
authors.affiliation: University of Texas at Dallas, Richardson.
authors.forename: Paul
authors.initials: P
authors.lastname: Phipps
authors.forename: Sergey
authors.initials: S
authors.lastname: Bereg
mesh_terms: D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D019143:Evolution, Molecular; D008957:Models, Genetic; D010802:Phylogeny; D011323:Primates / Q000145:classification / Q000235:genetics