The following pages link to Consensus n-trees (Q1150336):
Displaying 45 items.
- Minimum tree cost quartet puzzling (Q263274) (← links)
- TreeOfTrees method to evaluate the congruence between gene trees (Q263301) (← links)
- Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
- An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies (Q411843) (← links)
- Discriminative measures for comparison of phylogenetic trees (Q516872) (← links)
- Thresholded consensus for n-trees (Q582778) (← links)
- The role of complexity in comparing classifications (Q585631) (← links)
- Majority-rule (+) consensus trees (Q608873) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- A characterization of majority rule for hierarchies (Q734371) (← links)
- Faithful consensus methods for n-trees (Q794118) (← links)
- DASACT: a decision aiding software for axiomatic consensus theory (Q899602) (← links)
- On an independence condition for consensus \(n\)-trees (Q922253) (← links)
- Wilson's theorem for consensus functions on hierarchies (Q947073) (← links)
- Consensus rules based on decisive families: the case of hierarchies (Q1042322) (← links)
- Efficient and binary consensus functions on transitively valued relations (Q1059534) (← links)
- Axioms for consensus functions on undirected phylogenetic trees (Q1060980) (← links)
- A formalization of consensus index methods (Q1062389) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Parsimonious trees (Q1088345) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- N-trees as nestings: Complexity, similarity, and consensus (Q1104670) (← links)
- Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. (Q1129103) (← links)
- Consensus weak hierarchies (Q1176714) (← links)
- Consensus sequences based on plurality rule (Q1199388) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- A new approach to isotonic agglomerative hierarchical clustering (Q1203108) (← links)
- Interpreting consensus sequences based on plurality rule (Q1205295) (← links)
- Medians for weight metrics in the covering graphs of semilattices (Q1327234) (← links)
- On the weighted quartet consensus problem (Q1737590) (← links)
- Arrowian characterizations of latticial federation consensus functions (Q1813338) (← links)
- The median procedure for n-trees (Q1822174) (← links)
- s-consensus index method: An additional axiom (Q1822175) (← links)
- On lattice consensus methods (Q1822176) (← links)
- Consensus functions defined on trees (Q1839179) (← links)
- Arrow's Theorem for closed weak hierarchies (Q1917295) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- The majority decision function for trees with 3 leaves (Q2271871) (← links)
- Polyhedral computational geometry for averaging metric phylogenetic trees (Q2348943) (← links)
- Robust classifying of prokaryotic genomes (Q2359344) (← links)
- On finding the Adams consensus tree (Q2407110) (← links)
- TreeSOM: cluster analysis in the self-organizing map (Q2506536) (← links)
- (Q5002740) (← links)
- Computing consensus networks for collections of 1-nested phylogenetic networks (Q6075713) (← links)
