SplitsTree

{{Short description|Software for inferring bioinformatics split graphs}}

{{Infobox software

| name = SplitsTree

| logo =

| screenshot =

| caption =

| 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

| platform =

| genre = Bioinformatics

| license = Proprietary

| website = {{URL|https://uni-tuebingen.de/fakultaeten/mathematisch-naturwissenschaftliche-fakultaet/fachbereiche/informatik/lehrstuehle/algorithms-in-bioinformatics/software/splitstree/}}

}}

File:Heterobranchia tree.png 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.{{cite journal |last=Dress |first=A. |author2=K. T. Huber|author2-link=Katharina T. Huber |author3=V. Moulton |year=2001 |title= Metric spaces in pure and applied mathematics |journal= Documenta Mathematica |series=Documenta Mathematica Series |volume=2 |pages=121–139 |doi=10.4171/dms/2/5 |doi-access=free |isbn=978-3-98547-042-6 |url=http://www.emis.de/journals/DMJDMV/lsu/dress-huber-multon.pdf }}{{cite journal |last=Huson |first=D. H. |author2=D. Bryant |year=2006 |title= Application of Phylogenetic Networks in Evolutionary Studies |journal=Mol. Biol. Evol. |volume=23 |issue=2 |pages= 254–267 | doi=10.1093/molbev/msj030 |pmid=16221896 |doi-access=free }}

Software

SplitsTree implements published methods such as split decomposition,{{Cite journal|last1=Bandelt|first1=H. J.|last2=Dress|first2=A. W.|year=1992|title=Split decomposition: a new and useful approach to phylogenetic analysis of distance data|journal=Molecular Phylogenetics and Evolution|volume=1|issue=3|pages=242–252|doi=10.1016/1055-7903(92)90021-8|issn=1055-7903|pmid=1342941|bibcode=1992MolPE...1..242B }} neighbor-net, consensus networks,{{Cite book|last1=Holland|first1=Barbara|last2=Moulton|first2=Vincent|date=2003|editor-last=Benson|editor-first=Gary|editor2-last=Page|editor2-first=Roderic D. M.|chapter=Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees|title=Algorithms in Bioinformatics|volume=2812|series=Lecture Notes in Computer Science|language=en|publisher=Springer Berlin Heidelberg|pages=165–176|doi=10.1007/978-3-540-39763-2_13|isbn=9783540397632}} 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

{{Reflist}}