Near-optimal algorithm for constructing greedy consensus tree

DOI10.4230/LIPICS.ICALP.2020.105MaRDI QIDQ6842465zbMATH OpenFDO

Authors Hongxun Wu

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.105

zbMATH Keywords

greedy consensus treesphylogenetic treessplay tree

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A faster construction of greedy consensus trees
• Computing the agreement of trees with bounded degrees
• Computing the Local Consensus of Trees
• Consensus n-trees
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• Faster algorithms for computing the R* consensus tree
• Greedy consensus tree and maximum greedy consensus tree problems
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• Improved algorithms for constructing consensus trees
• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Maintaining information in fully dynamic trees with top trees
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• On Finding Lowest Common Ancestors in Trees
• On finding the Adams consensus tree
• Optimal algorithms for comparing trees with labeled leaves
• Self-adjusting binary search trees

Cited in

(2)

• A faster algorithm for constructing the frequency difference consensus tree
• A faster algorithm for constructing the frequency difference consensus tree

This page was built for publication: Near-optimal algorithm for constructing greedy consensus tree

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