Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
SplitsTree
Software

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.

Related Image Collections Add Image
We don't have any YouTube videos related to SplitsTree yet.
We don't have any PDF documents related to SplitsTree yet.
We don't have any Books related to SplitsTree yet.
We don't have any archived web articles related to SplitsTree yet.

Software

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

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. 978-3-98547-042-6

  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. https://doi.org/10.1093%2Fmolbev%2Fmsj030

  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. /wiki/Bibcode_(identifier)

  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. 9783540397632