Computing the Local Consensus of Trees
From MaRDI portal
Recommendations
Cited in
(19)- Determining the consistency of partial tree descriptions
- N-trees as nestings: Complexity, similarity, and consensus
- Tree enumeration modulo a consensus
- Constructing the R* consensus tree of two trees in subcubic time
- Greedy consensus tree and maximum greedy consensus tree problems
- scientific article; zbMATH DE number 5818908 (Why is no real title available?)
- Algorithms for building consensus MUL-trees
- scientific article; zbMATH DE number 910861 (Why is no real title available?)
- scientific article; zbMATH DE number 1444316 (Why is no real title available?)
- Computing a consensus of multilabeled trees
- Average Consensus and Infinite Norm Consensus : Two Methods for Ultrametric Trees
- Consensus of Star Tree Hypergraphs
- Evolutionary Computation in Combinatorial Optimization
- Identifying consensus of trees through alignment
- Comparing and aggregating partially resolved trees
- Near-optimal algorithm for constructing greedy consensus tree
- Faster algorithms for computing the R* consensus tree
- Polynomial-time completion of phylogenetic tree sets
- s-consensus trees and indices
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)