SplitsTree

SplitsTree: A program for analyzing and visualizing evolutionary data. MOTIVATION: Real evolutionary data often contain a number of different and sometimes conflicting phylogenetic signals, and thus do not always clearly support a unique tree. To address this problem, Bandelt and Dress (Adv. Math., 92, 47-05, 1992) developed the method of split decomposition. For ideal data, this method gives rise to a tree, whereas less ideal data are represented by a tree-like network that may indicate evidence for different and conflicting phylogenies. RESULTS: SplitsTree is an interactive program, for analyzing and visualizing evolutionary data, that implements this approach. It also supports a number of distances transformations, the computation of parsimony splits, spectral analysis and bootstrapping.


References in zbMATH (referenced in 12 articles )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Keith, Jonathan M. (ed.): Bioinformatics. Volume I. Data, sequence analysis, and evolution (2017)
  2. Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge: Seeing the trees and their branches in the network is hard (2008)
  3. Dress, Andreas: The category of $X$-nets (2007)
  4. Huber, K.T.; Koolen, J.H.; Moulton, V.: On the structure of the tight-span of a totally split-decomposable metric (2006)
  5. Willson, Stephen J.: Unique reconstruction of tree-like phylogenetic networks from distances between leaves (2006)
  6. Zahid, M.A.H.; Mittal, Ankush; Joshi, R.C.: A pattern recognition-based approach for phylogenetic network construction with constrained recombination (2006)
  7. Huber, K.T.; Koolen, J.H.; Moulton, V.: The tight span of an antipodal metric space. I: combinatorial properties (2005)
  8. Weyer-Menkhoff, Jan; Devauchelle, Claudine; Grossmann, Alex; Grünewald, Stefan: Integer linear programming as a tool for constructing trees from quartet data (2005)
  9. Dress, A.; Huber, K.T.; Moulton, V.: An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex (2002)
  10. Dress, A.; Huber, K.T.; Moulton, V.: Antipodal metrics and split systems (2002)
  11. Bryant, D.; Moulton, V.: A polynomial time algorithm for constructing the refined Buneman tree (1999)
  12. Dilts, David; Khamalah, Joseph: A comparison of ordinal analysis techniques in medical resource usage research (1999)