SplitsTree

SplitsTree
DevelopersDaniel Huson and David Bryant
Stable release
4.17.1 / 2021
Preview release
5.3 / 2021
Operating systemWindows, Linux, Mac OS X
TypeBioinformatics
LicenseProprietary
Websiteuni-tuebingen.de/fakultaeten/mathematisch-naturwissenschaftliche-fakultaet/fachbereiche/informatik/lehrstuehle/algorithms-in-bioinformatics/software/splitstree/
An example of a neighbor-net phylogenetic network generated by SplitsTree v4.6.

SplitsTree is a freeware program for inferring phylogenetic trees, phylogenetic networks, or, more generally, split graphs, from various types of data such as a sequence alignment, a distance matrix or a set of trees.

Software

SplitsTree implements published methods such as split decomposition, neighbor-net, consensus networks, 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

References

  1. ↑ Dress, A.; K. T. Huber; V. Moulton (2001). "Metric spaces in pure and applied mathematics" (PDF). Documenta Mathematica. Documenta Mathematica Series. 2: 121–139. doi:10.4171/dms/2/5. ISBN 978-3-98547-042-6.{{cite journal}}: CS1 maint: periodical has ISBN (link)
  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. Bibcode:1992MolPE...1..242B. doi:10.1016/1055-7903(92)90021-8. ISSN 1055-7903. PMID 1342941.
  4. ↑ Holland, Barbara; Moulton, Vincent (2003). "Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees". In Benson, Gary; Page, Roderic D. M. (eds.). Algorithms in Bioinformatics. Lecture Notes in Computer Science. Vol. 2812. Springer Berlin Heidelberg. pp. 165–176. doi:10.1007/978-3-540-39763-2_13. ISBN 9783540397632.