Jump to content

SplitsTree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by DasGrimm (talk | contribs) at 11:40, 31 October 2019 (Added references and updated the link list. The official programme's page, top hit on searches and provided as reference, appears to be either temporarily (since several weeks) or permanantly off-line.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
SplitsTree
Developer(s)Daniel Huson and David Bryant
Stable release
4.14.4 / 2008
Operating systemWindows, Linux, Mac OS X
TypeBioinformatics
LicenseProprietary
Websitehttp://www.splitstree.org

SplitsTree is a popular free-ware 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).

An example of a neighbor-net phylogenetic network generated by SplitsTree v4.6.

See also

References

  1. ^ Dress, A.; K. T. Huber; V. Moulton (2001). "Metric spaces in pure and applied mathematics" (PDF). Documenta Mathematica: 121–139.
  2. ^ Huson, D. H.; D. Bryant (2006). "Application of Phylogenetic Networks in Evolutionary Studies". Mol. Biol. Evol. 23 (2): 254–267. doi:10.1093/molbev/msj030. PMID 16221896.
  3. ^ 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. doi:10.1016/1055-7903(92)90021-8. ISSN 1055-7903. PMID 1342941.
  4. ^ Holland, Barbara; Moulton, Vincent (2003). Benson, Gary; Page, Roderic D. M. (eds.). "Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees". Algorithms in Bioinformatics. Lecture Notes in Computer Science. Springer Berlin Heidelberg: 165–176. doi:10.1007/978-3-540-39763-2_13. ISBN 9783540397632.