scientific article
From MaRDI portal
zbMath0790.05021MaRDI QIDQ4004055
Alain Guénoche, Jean-Pierre Barthelemy
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Knowledge representation (68T30) Distance in graphs (05C12)
Related Items
An optimal algorithm to recognize Robinsonian dissimilarities, Testing metric properties, Distinguishing and classifying from \(n\)-ary properties, Replacing cliques by stars in quasi-median graphs, Optimal implementations of UPGMA and other common clustering algorithms, On the agreement of many trees, A parametric procedure for ultrametric tree estimation from conditional rank order proximity data, Exploring the set-theoretical structure of objects by additive trees, On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction, A geometrical framework for \(f\)-statistics, Polynomial kernels for 3-leaf power graph modification problems, Uprooted phylogenetic networks, Tree reconstruction from triplet cover distances, Computing the agreement of trees with bounded degrees, Injective split systems, New results on the robust coloring problem, Comparison to two ascendant hierarchical classification criteria under a contiguity constraint. Application to image processing, A note on tree realizations of matrices, Collective additive tree spanners for circle graphs and polygonal graphs, a-tint: a polymake extension for algorithmic tropical intersection theory, On the extension of a partial metric to a tree metric, Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition, Recovering trees from well-separated multi-state characters., Formalizing and enriching phenotype signatures using Boolean networks, The approximation of two-mode proximity matrices by sums of order-constrained matrices, Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices, An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex, \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform, The triangles method to buildX-trees from incomplete distance matrices, Exact leaf powers, Maximal sub-triangulation in pre-processing phylogenetic data, Invariant polynomials on tensors under the action of a product of orthogonal groups, Artificial intelligence and human decision making, Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results, Inferring evolutionary trees with strong combinatorial evidence, 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, A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction, An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees, Ordinal properties of tree distances, Simplicial Powers of Graphs, \(l_\infty\)-approximation via subdominants., Distinguished Minimal Topological Lassos, A structured family of clustering and tree construction methods, A New Algorithm for Inferring Hybridization Events Based on the Detection of Horizontal Gene Transfers
