Consensus n-trees
From MaRDI portal
Publication:1150336
zbMath0455.92019MaRDI QIDQ1150336
Publication date: 1981
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Ordered sets (06A99) Mathematical sociology (including anthropology) (91D99)
Related Items (45)
Medians in median graphs and their cube complexes in linear time ⋮ Medians for weight metrics in the covering graphs of semilattices ⋮ Robust classifying of prokaryotic genomes ⋮ Parsimonious trees ⋮ Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ On the use of ordered sets in problems of comparison and consensus of classifications ⋮ N-trees as nestings: Complexity, similarity, and consensus ⋮ Arrow's Theorem for closed weak hierarchies ⋮ On finding the Adams consensus tree ⋮ Majority-rule (+) consensus trees ⋮ Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. ⋮ Computing consensus networks for collections of 1-nested phylogenetic networks ⋮ An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies ⋮ DASACT: a decision aiding software for axiomatic consensus theory ⋮ Unnamed Item ⋮ On an independence condition for consensus \(n\)-trees ⋮ Consensus weak hierarchies ⋮ On the weighted quartet consensus problem ⋮ Wilson's theorem for consensus functions on hierarchies ⋮ Discriminative measures for comparison of phylogenetic trees ⋮ Consensus sequences based on plurality rule ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ A new approach to isotonic agglomerative hierarchical clustering ⋮ Interpreting consensus sequences based on plurality rule ⋮ The majority decision function for trees with 3 leaves ⋮ Thresholded consensus for n-trees ⋮ The role of complexity in comparing classifications ⋮ TreeSOM: cluster analysis in the self-organizing map ⋮ Faster algorithms for computing the R* consensus tree ⋮ A characterization of majority rule for hierarchies ⋮ Arrowian characterizations of latticial federation consensus functions ⋮ The median procedure for n-trees ⋮ s-consensus index method: An additional axiom ⋮ On lattice consensus methods ⋮ Consensus rules based on decisive families: the case of hierarchies ⋮ Consensus functions defined on trees ⋮ Faithful consensus methods for n-trees ⋮ Efficient and binary consensus functions on transitively valued relations ⋮ Axioms for consensus functions on undirected phylogenetic trees ⋮ A formalization of consensus index methods ⋮ Polyhedral computational geometry for averaging metric phylogenetic trees ⋮ Optimal algorithms for comparing trees with labeled leaves ⋮ Minimum tree cost quartet puzzling ⋮ TreeOfTrees method to evaluate the congruence between gene trees
This page was built for publication: Consensus n-trees
