scientific article; zbMATH DE number 53860
From MaRDI portal
Publication:4004055
Recommendations
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
- Recognition of Tree Metrics
- From isomorphic rooted trees to isometric ultrametric spaces
- scientific article; zbMATH DE number 3982317
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
Cited in
(54)- Simplicial powers of graphs
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Artificial intelligence and human decision making
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
- On the agreement of many trees
- Exploring the set-theoretical structure of objects by additive trees
- On the extension of a partial metric to a tree metric
- Recovering trees from well-separated multi-state characters.
- Inferring evolutionary trees with strong combinatorial evidence
- Ordinal properties of tree distances
- \(l_\infty\)-approximation via subdominants.
- A structured family of clustering and tree construction methods
- Formalizing and enriching phenotype signatures using Boolean networks
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform
- Testing metric properties
- Replacing cliques by stars in quasi-median graphs
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
- Tree representations of non-symmetric group-valued proximities
- Comparison to two ascendant hierarchical classification criteria under a contiguity constraint. Application to image processing
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Mixtures of (constrained) ultrametric trees
- Optimal implementations of UPGMA and other common clustering algorithms
- Uprooted phylogenetic networks
- a-tint: a polymake extension for algorithmic tropical intersection theory
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- Maximal sub-triangulation in pre-processing phylogenetic data
- An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
- A geometrical framework for \(f\)-statistics
- An optimal algorithm to recognize Robinsonian dissimilarities
- Caterpiller distances
- The triangles method to build X-trees from incomplete distance matrices
- Invariant polynomials on tensors under the action of a product of orthogonal groups
- Distinguishing and classifying from n-ary properties
- scientific article; zbMATH DE number 3887720 (Why is no real title available?)
- A note on tree realizations of matrices
- Tree reconstruction from triplet cover distances
- scientific article; zbMATH DE number 1163862 (Why is no real title available?)
- Collective additive tree spanners for circle graphs and polygonal graphs
- scientific article; zbMATH DE number 1746438 (Why is no real title available?)
- Distinguished minimal topological lassos
- A new algorithm for inferring hybridization events based on the detection of horizontal gene transfers
- Simplicial Powers of Graphs
- Polynomial kernels for 3-leaf power graph modification problems
- Computing the agreement of trees with bounded degrees
- Injective split systems
- New results on the robust coloring problem
- The approximation of two-mode proximity matrices by sums of order-constrained matrices
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- Tree metrics and log-concavity for matroids
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- Exact leaf powers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004055)
