Computing the Local Consensus of Trees

DOI10.1137/S0097539795287642MaRDI QIDQ4210128zbMATH OpenFDO

Authors Sampath Kannan, Tandy J. Warnow

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsgraphsevolutionary trees

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08) General biology and biomathematics (92B05)

Recommendations

• scientific article; zbMATH DE number 910861
• Improved Algorithms for Constructing Consensus Trees
• Improved algorithms for constructing consensus trees
• scientific article; zbMATH DE number 871930

Cited in

(16)

• N-trees as nestings: Complexity, similarity, and consensus
• scientific article; zbMATH DE number 910861 (Why is no real title available?)
• Identifying consensus of trees through alignment
• 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
• scientific article; zbMATH DE number 5818908 (Why is no real title available?)
• Faster algorithms for computing the R* consensus tree
• Determining the consistency of partial tree descriptions
• Constructing the R* consensus tree of two trees in subcubic time
• Tree enumeration modulo a consensus
• Evolutionary Computation in Combinatorial Optimization
• s-consensus trees and indices
• Comparing and aggregating partially resolved trees

This page was built for publication: Computing the Local Consensus of Trees

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