Reconstructing reticulate evolution in species: theory and practice
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing recombination networks from binary sequences
Bioinformatics
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
Improved Layout of Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A fundamental decomposition theory for phylogenetic networks and incompatible characters
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Reconstruction of reticulate networks from gene trees
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
New common ancestor problems in trees and directed acyclic graphs
Information Processing Letters
| Hi-index | 0.00 |
The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.