Faster algorithms for computing the R* consensus tree

DOI10.1007/S00453-016-0122-2MaRDI QIDQ727985zbMATH OpenOpenAlexFDO

Authors Jesper Jansson, Wing-Kin Sung, S. M. 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

zbMATH Keywords

phylogenetic treetripletApresjan clusterR* consensus treestrong cluster

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• Faster algorithms for computing the R* consensus tree
• A faster construction of greedy consensus trees
• Improved algorithms for constructing consensus trees
• Improved Algorithms for Constructing Consensus Trees
• Constructing the R* consensus tree of two trees in subcubic time
• Constructing the R* consensus tree of two trees in subcubic time
• Algorithms for building consensus MUL-trees
• Faithful consensus methods for n-trees
• Improved fixed-parameter algorithms for minimum-flip consensus trees

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 6297698 (Why is no real title available?)
• A structured family of clustering and tree construction methods
• Algorithms in bioinformatics. A practical introduction.
• An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
• An improved algorithm for the maximum agreement subtree problem
• Comparing and aggregating partially resolved trees
• Computing the Local Consensus of Trees
• Consensus n-trees
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• Constructing the R* consensus tree of two trees in subcubic time
• Fast Algorithms for Finding Nearest Common Ancestors
• The level ancestor problem simplified

Cited in

(9)

• Faster algorithms for computing the R* consensus tree
• On finding the Adams consensus tree
• Improved algorithms for constructing consensus 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?)
• On finding the Adams consensus tree
• Improved Algorithms for Constructing Consensus Trees

This page was built for publication: Faster algorithms for computing the R* consensus tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727985)