Constructing the maximum consensus tree from rooted Triples
DOI10.1023/B:JOCO.0000021936.04215.68zbMATH Open1058.90071OpenAlexW2065746563MaRDI QIDQ1768596FDOQ1768596
Authors: Bang Ye Wu 
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000021936.04215.68
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (14)
- Kernel and fast algorithm for dense triplet inconsistency
- New results on optimizing rooted triplets consistency
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- New heuristics for rooted triplet consistency
- ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Title not available (Why is that?)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Building a small and informative phylogenetic supertree
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
- Constructing the R* consensus tree of two trees in subcubic time
- NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
This page was built for publication: Constructing the maximum consensus tree from rooted Triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768596)
