s-consensus trees and indices

MaRDI QIDQ798576zbMATH OpenFDO

Authors Ralph Stinebrickner

Publication date 1984

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

zbMATH Keywords

Adams-consensus treealgorithmconsensus indexn-treesnumerical taxonomy

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) General biology and biomathematics (92B05) Other natural sciences (mathematical treatment) (92F05)

Review text

In this paper, an s-consensus tree and a corresponding consensus index for a collection of n-trees are defined. The choice of a value for the parameter s determines the number of nodes in the s-consensus tree and its strictness. The consensus index associated with the s-consensus tree provides a measure of agreement among the original n-trees. An algorithm is proposed for the computation of the s-consensus tree and the corresponding consensus index. Basic properties of the s-consensus tree are established and briefly discussed.

Recommendations

• Improved Algorithms for Constructing Consensus Trees
• Improved algorithms for constructing consensus trees
• scientific article; zbMATH DE number 910861
• Computing the Local Consensus of Trees
• N-trees as nestings: Complexity, similarity, and consensus

Cited in

(8)

• A formalization of consensus index methods
• Optimal algorithms for comparing trees with labeled leaves
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• On the use of ordered sets in problems of comparison and consensus of classifications
• N-trees as nestings: Complexity, similarity, and consensus
• s-consensus index method: An additional axiom
• On lattice consensus methods
• DASACT: a decision aiding software for axiomatic consensus theory

This page was built for publication: s-consensus trees and indices

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