SplitsTree explained
SplitsTree |
Developer: | Daniel Huson and David Bryant |
Latest Release Version: | 4.17.1 |
Latest Release Date: | 2021 |
Latest Preview Version: | 5.3 |
Latest Preview Date: | 2021 |
Operating System: | Windows, Linux, Mac OS X |
Genre: | Bioinformatics |
License: | Proprietary |
SplitsTree is a popular freeware program for inferring phylogenetic trees, phylogenetic networks, or, more generally, splits graphs, from various types of data such as a sequence alignment, a distance matrix or a set of trees.[1] [2] SplitsTree implements published methods such as split decomposition,[3] neighbor-net, consensus networks,[4] super networks methods or methods for computing hybridization or simple recombination networks. It uses the NEXUS file format. The splits graph is defined using a special data block (SPLITS block).
See also
External links
Notes and References
- Dress . A. . K. T. Huber. Katharina T. Huber . V. Moulton . 2001 . Metric spaces in pure and applied mathematics . Documenta Mathematica . 121–139 .
- Huson . D. H. . D. Bryant . 2006 . Application of Phylogenetic Networks in Evolutionary Studies . Mol. Biol. Evol. . 23 . 2 . 254–267 . 10.1093/molbev/msj030 . 16221896 . free .
- Bandelt. H. J.. Dress. A. W.. 1992. Split decomposition: a new and useful approach to phylogenetic analysis of distance data. Molecular Phylogenetics and Evolution. 1. 3. 242–252. 10.1016/1055-7903(92)90021-8. 1055-7903. 1342941.
- Holland. Barbara. Moulton. Vincent. 2003. Benson. Gary. Page. Roderic D. M.. Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees. Algorithms in Bioinformatics. 2812. Lecture Notes in Computer Science. en. Springer Berlin Heidelberg. 165–176. 10.1007/978-3-540-39763-2_13. 9783540397632.