Analyzing and visualizing sequence and distance data using SplitsTree
Discrete Applied Mathematics - Special volume on computational molecular biology
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Reconstructing reticulate evolution in species: theory and practice
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Phylogenetic Super-Networks from Partial Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Counting vertices and cubes in median graphs of circular split systems
European Journal of Combinatorics
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Constructing Phylogenetic Supernetworks from Quartets
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Improved Layout of Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Drawing Rooted Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Consistency of the QNet algorithm for generating planar split networks from weighted quartets
Discrete Applied Mathematics
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Counting Faces in Split Networks
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Beyond galled trees: decomposition and computation of galled networks
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Reducing distortion in phylogenetic networks
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Constructing and Drawing Regular Planar Split Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimizing Phylogenetic Networks for Circular Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reconstruction of reticulate networks from gene trees
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
SuperQ: Computing Supernetworks from Quartets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fishing for minimum evolution trees with Neighbor-Nets
Information Processing Letters
| Hi-index | 0.00 |
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.