scientific article; zbMATH DE number 910861

MaRDI QIDQ4886035zbMATHFDO

Authors Sampath Kannan, Shibu Yooseph, Tandy J. Warnow

Publication date 28 July 1996

zbMATH Keywords

optimization problemslinear time algorithmspolynomial time algorithmsevolutionary treesinference of consensuslocal consensus treepartial consensus rulestotal local consensus rule

Mathematics Subject Classification ID

Problems related to evolution (92D15) General biology and biomathematics (92B05)

Recommendations

• Computing the Local Consensus of Trees
• Computing a consensus of multilabeled trees
• Faithful consensus methods for n-trees
• Improved algorithms for constructing consensus trees
• Improved Algorithms for Constructing Consensus Trees
• Thresholded consensus for n-trees
• Finding similar consensus between trees: An algorithm and a distance hierarchy
• Faster algorithms for computing the R* consensus tree
• Faster algorithms for computing the R* consensus tree

Cited in

(13)

• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
• Greedy consensus tree and maximum greedy consensus tree problems
• Consensus of Star Tree Hypergraphs
• Average Consensus and Infinite Norm Consensus : Two Methods for Ultrametric Trees
• Algorithms for building consensus MUL-trees
• Computing a consensus of multilabeled trees
• Determining the consistency of partial tree descriptions
• Tree enumeration modulo a consensus
• Evolutionary Computation in Combinatorial Optimization
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• s-consensus trees and indices
• The asymmetric median tree. --- A new model for building consensus trees
• Computing the unrooted maximum agreement subtree in sub-quadratic time

This page was built for publication:

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