Computing the Local Consensus of Trees

DOI10.1137/S0097539795287642zbMATH Open0915.05045MaRDI QIDQ4210128FDOQ4210128

Authors: Sampath Kannan, Tandy J. Warnow 

Publication date: 21 September 1998

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

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

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)

Cited In (14)

• Identifying consensus of trees through alignment
• Consensus of Star Tree Hypergraphs
• Tree enumeration modulo a consensus
• Evolutionary Computation in Combinatorial Optimization
• Faster algorithms for computing the R* consensus tree
• Determining the consistency of partial tree descriptions
• Average Consensus and Infinite Norm Consensus : Two Methods for Ultrametric Trees
• Algorithms for building consensus MUL-trees
• Constructing the R* consensus tree of two trees in subcubic time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparing and aggregating partially resolved trees
• s-consensus trees and indices
• N-trees as nestings: Complexity, similarity, and consensus

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)