Tree structures for proximity data
From MaRDI portal
Publication:3925773
DOI10.1111/j.2044-8317.1981.tb00626.xzbMath0472.62107OpenAlexW2045875391MaRDI QIDQ3925773
Hans Colonius, Hans-Henning Schulze
Publication date: 1981
Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.2044-8317.1981.tb00626.x
Related Items (49)
A fixed-parameter algorithm for minimum quartet inconsistency ⋮ Families of multiweights and pseudostars ⋮ Hierarchies and ternary separation ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Preserving consensus hierarchies ⋮ A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors ⋮ Reconstructing phylogenetic trees from multipartite quartet systems ⋮ Stability conditions for consensus functions defined on \(n\)-trees ⋮ Weighted graphs with distances in given ranges ⋮ A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies ⋮ Reconstructing unrooted phylogenetic trees from symbolic ternary metrics ⋮ A probabilistic feature model for unfolding tested for perfect and imperfect nestings ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ A fast quartet tree heuristic for hierarchical clustering ⋮ DASACT: a decision aiding software for axiomatic consensus theory ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ A few logs suffice to build (almost) all trees. II ⋮ A property tester for tree-likeness of quartet topologies ⋮ On an independence condition for consensus \(n\)-trees ⋮ Injectivity and weak ternary separation ⋮ Sen's theorem for hierarchies ⋮ A phase transition for a random cluster model on phylogenetic trees. ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Encoding phylogenetic trees in terms of weighted quartets ⋮ Binary clustering ⋮ Wilson's theorem for consensus functions on hierarchies ⋮ A characterization of dissimilarity families of trees ⋮ The additive random feature model for unfolding and the feature structure of choice objects ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ Patchworks ⋮ Combinatorial optimisation and hierarchical classifications ⋮ On the stability of hierarchical classification: qualitative approaches ⋮ Teasing Apart Two Trees ⋮ A few logs suffice to build (almost) all trees (I) ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ Unnamed Item ⋮ Quarnet inference rules for level-1 networks ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Explosions and hot spots in supertree methods ⋮ Characterizing weak compatibility in terms of weighted quartets ⋮ Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis ⋮ An improved bound on the maximum agreement subtree problem ⋮ Inferring evolutionary trees with strong combinatorial evidence ⋮ Consensus rules based on decisive families: the case of hierarchies ⋮ A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance ⋮ On some relations between 2-trees and tree metrics ⋮ Patching up \(X\)-trees ⋮ Axioms for consensus functions on undirected phylogenetic trees ⋮ Consensus functions on trees that satisfy an independence axiom
This page was built for publication: Tree structures for proximity data
