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 30 articles )

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

1 2 next

  1. Warnow, Tandy (ed.): Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret (2019)
  2. Keith, Jonathan M. (ed.): Bioinformatics. Volume I. Data, sequence analysis, and evolution (2017)
  3. Erciyes, K.: Distributed and sequential algorithms for bioinformatics (2015)
  4. Koichi, Shungo: The Buneman index via polyhedral split decomposition (2014)
  5. Cilibrasi, Rudi L.; Vitányi, Paul M. B.: A fast quartet tree heuristic for hierarchical clustering (2011)
  6. Arenas, Miguel; Patricio, Mateus; Posada, David; Valiente, Gabriel: Characterization of phylogenetic networks with nettest (2010) ioport
  7. Grünewald, S.; Koolen, J. H.; Lee, W. S.: Quartets in maximal weakly compatible split systems (2009)
  8. Grünewald, Stefan; Huber, Katharina T.; Moulton, Vincent; Semple, Charles; Spillner, Andreas: Characterizing weak compatibility in terms of weighted quartets (2009)
  9. Lemey, Philippe; Lott, Martin; Martin, Darren P.; Moulton, Vincent: Identifying recombinants in human and primate immunodeficiency virus sequence alignments using quartet scanning (2009) ioport
  10. Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge: Seeing the trees and their branches in the network is hard (2008)
  11. Dress, Andreas: The category of (X)-nets (2007)
  12. Kruspe, Matthias; Stadler, Peter F.: Progressive multiple sequence alignments from triplets (2007) ioport
  13. Huber, K. T.; Koolen, J. H.; Moulton, V.: On the structure of the tight-span of a totally split-decomposable metric (2006)
  14. Willson, Stephen J.: Unique reconstruction of tree-like phylogenetic networks from distances between leaves (2006)
  15. Zahid, M. A. H.; Mittal, Ankush; Joshi, R. C.: A pattern recognition-based approach for phylogenetic network construction with constrained recombination (2006)
  16. Huber, K. T.; Koolen, J. H.; Moulton, V.: The tight span of an antipodal metric space. I: combinatorial properties (2005)
  17. Weyer-Menkhoff, Jan; Devauchelle, Claudine; Grossmann, Alex; Grünewald, Stefan: Integer linear programming as a tool for constructing trees from quartet data (2005)
  18. Spencer, Matthew; Davidson, Elizabeth A.; Barbrook, Adrian C.; Howe, Christopher J.: Phylogenetics of artificial manuscripts (2004)
  19. Holmes, Susan: Statistics for phylogenetic trees (2003)
  20. 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)

1 2 next