Improved algorithms for constructing consensus trees
From MaRDI portal
Publication:3177802
Recommendations
Cited in
(22)- Greedy consensus tree and maximum greedy consensus tree problems
- scientific article; zbMATH DE number 1974599 (Why is no real title available?)
- New heuristics for rooted triplet consistency
- An improvement of the tree code construction
- scientific article; zbMATH DE number 1974602 (Why is no real title available?)
- Evolutionary Computation in Combinatorial Optimization
- Faster algorithms for computing the R* consensus tree
- Faster algorithms for computing the R* consensus tree
- On finding the Adams consensus tree
- Majority-rule (+) consensus trees
- Consensus of phylogenetic trees using genetic algorithms
- Algorithms for improving the quality of \(R\)-trees
- Algorithms for building consensus MUL-trees
- Constructing the R* consensus tree of two trees in subcubic time
- Constructing the R* consensus tree of two trees in subcubic time
- A faster construction of greedy consensus trees
- scientific article; zbMATH DE number 910861 (Why is no real title available?)
- A consensus algorithm in CAT(0) space and its application to distributed fusion of phylogenetic trees
- DASACT: a decision aiding software for axiomatic consensus theory
- On finding the Adams consensus tree
- s-consensus trees and indices
- Fast algorithms for constructing maximum entropy summary trees
This page was built for publication: Improved algorithms for constructing consensus trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177802)