Faster algorithms for computing the R* consensus tree
From MaRDI portal
Publication:727985
DOI10.1007/s00453-016-0122-2zbMath1355.68286OpenAlexW2337659313MaRDI QIDQ727985
Jesper Jansson, Wing-Kin Sung, Siu-Ming Yiu, Hoa T. Vu
Publication date: 21 December 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0122-2
Analysis of algorithms (68W40) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The level ancestor problem simplified
- Comparing and aggregating partially resolved trees
- An improved algorithm for the maximum agreement subtree problem
- Consensus n-trees
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- A structured family of clustering and tree construction methods
- Constructing the R* consensus tree of two trees in subcubic time
- An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Computing the Local Consensus of Trees
This page was built for publication: Faster algorithms for computing the R* consensus tree
