Tree structures for proximity data

Cited in

(51)

A probabilistic feature model for unfolding tested for perfect and imperfect nestings
On the stability of hierarchical classification: qualitative approaches
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
Combinatorial optimisation and hierarchical classifications
Injectivity and weak ternary separation
Quarnet inference rules for level-1 networks
A phase transition for a random cluster model on phylogenetic trees.
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
Families of multiweights and pseudostars
Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis
Axioms for consensus functions on undirected phylogenetic trees
On the maximum quartet distance between phylogenetic trees
Wilson's theorem for consensus functions on hierarchies
The complexity of reconstructing trees from qualitative characters and subtrees
On some relations between 2-trees and tree metrics
Patching up \(X\)-trees
Inferring evolutionary trees with strong combinatorial evidence
A few logs suffice to build (almost) all trees. II
Inducibility in binary trees and crossings in random tanglegrams
A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies
A fixed-parameter algorithm for minimum quartet inconsistency
Consensus functions on trees that satisfy an independence axiom
Teasing Apart Two Trees
Characterizing weak compatibility in terms of weighted quartets
Consensus rules based on decisive families: the case of hierarchies
Hierarchies and ternary separation
Encoding phylogenetic trees in terms of weighted quartets
A fast quartet tree heuristic for hierarchical clustering
Arboreal networks and their underlying trees
A few logs suffice to build (almost) all trees (I)
Weighted graphs with distances in given ranges
scientific article; zbMATH DE number 7561411 (Why is no real title available?)
An improved bound on the maximum agreement subtree problem
Explosions and hot spots in supertree methods
Reconstructing phylogenetic trees from multipartite quartet systems
DASACT: a decision aiding software for axiomatic consensus theory
Stability conditions for consensus functions defined on \(n\)-trees
A property tester for tree-likeness of quartet topologies
On an independence condition for consensus \(n\)-trees
Preserving consensus hierarchies
Binary clustering
Reconstructing the shape of a tree from observed dissimilarity data
The additive random feature model for unfolding and the feature structure of choice objects
Sen's theorem for hierarchies
A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
Patchworks
A characterization of dissimilarity families of trees
`Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
Reconstructing unrooted phylogenetic trees from symbolic ternary metrics
Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Tree structures for proximity data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925773)