A canonical decomposition theory for metrics on a finite set
From MaRDI portal
(Redirected from Publication:1190163)
Recommendations
Cites work
- scientific article; zbMATH DE number 4215136 (Why is no real title available?)
- scientific article; zbMATH DE number 3995598 (Why is no real title available?)
- A note on the metric properties of trees
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Combinatorial approaches to multiflow problems
- Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
- Gated sets in metric spaces
- Hypermetric Spaces and the Hamming Cone
- Interval-regular graphs
- On the Extreme Rays of the Metric Cone
- Optimal imbeddings of metrics in graphs
- Properties of (0,1)-matrices with no triangles
- Recognition of Tree Metrics
- Reconstructing the shape of a tree from observed dissimilarity data
- Six theorems about injective metric spaces
- Submatrices of non-tree-realizable distance matrices
- The structure of distances in networks
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Weak hierarchies associated with similarity measures - An additive clustering technique
Cited in
(only showing first 100 items - show all)- The polytopal structure of the tight-span of a totally split-decomposable metric
- Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support
- Trees, tight-spans and point configurations
- Tropical geometric variation of tree shapes
- Recovering a tree from the leaf colourations it generates under a Markov model
- A comparison of ordinal analysis techniques in medical resource usage research
- Integer linear programming as a tool for constructing trees from quartet data
- A note on the uniqueness of coherent decompositions
- On the structure of the tight-span of a totally split-decomposable metric
- \(M\)-convex functions and tree metrics
- Obtaining splits from cut sets of tight spans
- Gromov product structures, quadrangle structures and split metric decompositions for finite metric spaces
- Biodiversity, Shapley value and phylogenetic trees: some remarks
- Curvature sets over persistence diagrams
- An algorithm for computing cutpoints in finite metric spaces
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- Counting vertices and cubes in median graphs of circular split systems
- Injective split systems
- Order distances and split systems
- Tverberg numbers for cellular bipartite graphs
- Phylogenetic analysis and homology
- Geometry of Data
- Multi-splits and tropical linear spaces from nested matroids
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
- A note on M-convexity in polyhedral split decomposition of distances
- Splitting metrics by \(T_0\)-quasi-metrics
- Antipodal metrics and split systems
- Totally split-decomposable metrics of combinatorial dimension two
- Six points suffice: How to check for metric consistency
- Quarnet inference rules for level-1 networks
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- Mixed-up trees: the structure of phylogenetic mixtures
- Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
- Compatible decompositions and block realizations of finite metrics
- Distance-preserving subgraphs of Johnson graphs
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Decomposition and \(l_1\)-embedding of weakly median graphs
- A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction
- Optimizing phylogenetic diversity under constraints
- Some variations on a theme by Buneman
- Excluded minors for the class of split matroids
- A solvable case of the quadratic assignment problem
- The split decomposition of a \(k\)-dissimilarity map
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Optimal realizations and the block decomposition of a finite metric space
- Circular Networks from Distorted Metrics
- Fishing for minimum evolution trees with neighbor-nets
- Likelihood-mapping: A simple method to visualize phylogenetic content of a sequence alignment
- Inferring evolutionary trees with strong combinatorial evidence
- Fundamental polytopes of metric trees via parallel connections of matroids
- A new tractable case of the QAP with a Robinson matrix
- A structured family of clustering and tree construction methods
- Embedding metric spaces in the rectilinear plane: a six-point criterion
- The neighbor-net algorithm
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Breaking the 2-competitiveness barrier for two servers in a tree
- On the facets of the secondary polytope
- Spectral analysis and a closest tree method for genetic sequences
- The tight span of an antipodal metric space. I: combinatorial properties
- Quartets in maximal weakly compatible split systems
- The Buneman index via polyhedral split decomposition
- On a class of metrics related to graph layout problems
- Group algebra of characteristic 1 and invariant distances over a finite group
- On some characterizations of antipodal partial cubes
- Phylogenetic diversity indices from an affine and projective viewpoint
- R-LINE: a better randomized 2-server algorithm on the line
- Characterizing weak compatibility in terms of weighted quartets
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- Optimal realizations of generic five-point metrics
- Clustered SplitsNetworks
- Retractions of finite distance functions onto tree metrics
- First-order logic axiomatization of metric graph theory
- The coherency index
- The structure of circular decomposable metrics
- Hyperconvexity and tight-span theory for diversities
- On the number of vertices and edges of the Buneman graph
- A classification of the six-point prime metrics
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- On tight spans for directed distances
- The size of 3-compatible, weakly compatible split systems
- Induced cycles in crossing graphs of median graphs
- Netlike partial cubes, V: completion and netlike classes
- Injective metrizability and the duality theory of cubings
- The three-dimensional matching problem in kalmanson matrices
- Combining polynomial running time and fast convergence for the disk-covering method.
- Deformations on symbolic Cantor sets and ultrametric spaces
- Two novel closure rules for constructing phylogenetic super-networks
- A T_X-approach to some results on cuts and metrics
- From modular decomposition trees to rooted median graphs
- Optimal algorithms for computing edge weights in planar split networks
- Functorial hierarchical clustering with overlaps
- The multi-stripe travelling salesman problem
- From weakly separated collections to matroid subdivisions
- Optimal realizations of two-dimensional, totally-decomposable metrics
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- Totally splittable polytopes
- A geometric study of the split decomposition
- Even set systems
- Split decomposition over an Abelian group. I: Generalities
- Betweenness structures of small linear co-size
This page was built for publication: A canonical decomposition theory for metrics on a finite set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190163)
