SplitsTree
From MaRDI portal
Software:24165
swMATH12234MaRDI QIDQ24165FDOQ24165
Author name not available (Why is that?)
Cited In (30)
- A note on the uniqueness of coherent decompositions
- On the structure of the tight-span of a totally split-decomposable metric
- Distributed and sequential algorithms for bioinformatics
- Antipodal metrics and split systems
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination
- Fullerenes and coordination polyhedra versus half-cube embeddings
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
- Some variations on a theme by Buneman
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- Seeing the trees and their branches in the network is hard
- The tight span of an antipodal metric space. I: combinatorial properties
- A polynomial time algorithm for constructing the refined Buneman tree
- Title not available (Why is that?)
- Quartets in maximal weakly compatible split systems
- The Buneman index via polyhedral split decomposition
- Characterizing weak compatibility in terms of weighted quartets
- Statistics for phylogenetic trees
- Galois connections for phylogenetic networks and their polytopes
- A fast quartet tree heuristic for hierarchical clustering
- Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks
- Retractions of finite distance functions onto tree metrics
- The Category of X-Nets
- Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
- On the number of vertices and edges of the Buneman graph
- Phylogenetics of artificial manuscripts
- Bioinformatics. Volume I. Data, sequence analysis, and evolution
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- A comparison of ordinal analysis techniques in medical resource usage research
- Integer linear programming as a tool for constructing trees from quartet data
This page was built for software: SplitsTree
