scientific article; zbMATH DE number 910861
From MaRDI portal
Publication:4886035
zbMATH Open0847.92013MaRDI QIDQ4886035FDOQ4886035
Authors: Sampath Kannan, Shibu Yooseph, Tandy J. Warnow 
Publication date: 28 July 1996
Title of this publication is not available (Why is that?)
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
optimization problemslinear time algorithmspolynomial time algorithmsevolutionary treesinference of consensuslocal consensus treepartial consensus rulestotal local consensus rule
Cited In (13)
- Consensus of Star Tree Hypergraphs
- Title not available (Why is that?)
- Greedy consensus tree and maximum greedy consensus tree problems
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- Tree enumeration modulo a consensus
- Evolutionary Computation in Combinatorial Optimization
- Determining the consistency of partial tree descriptions
- The asymmetric median tree. --- A new model for building consensus trees
- Average Consensus and Infinite Norm Consensus : Two Methods for Ultrametric Trees
- Computing a consensus of multilabeled trees
- Algorithms for building consensus MUL-trees
- Computing the unrooted maximum agreement subtree in sub-quadratic time
- s-consensus trees and indices
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)
