title: Constructing splits graphs.
abstract: Phylogenetic trees correspond one-to-one to compatible systems of splits and so splits play an important role in theoretical and computational aspects of phylogeny. Whereas any tree reconstruction method can be thought of as producing a compatible system of splits, an increasing number of phylogenetic algorithms are available that compute split systems that are not necessarily compatible and, thus, cannot always be represented by a tree. Such methods include the split decomposition, Neighbor-Net, consensus networks, and the Z-closure method. A more general split system of this kind can be represented graphically by a so-called splits graph, which generalizes the concept of a phylogenetic tree. This paper addresses the problem of computing a splits graph for a given set of splits. We have implemented all presented algorithms in a new program called SplitsTree4.
authors.affiliation: Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany. Andreas.Dress@mis.mpg.de
authors.forename: Andreas W M
authors.initials: AW
authors.lastname: Dress
authors.forename: Daniel H
authors.initials: DH
authors.lastname: Huson
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D008957:Models, Genetic; D010802:Phylogeny; D012984:Software