Polynomial-time completion of phylogenetic tree sets

DOI10.1007/S11538-026-01711-6MaRDI QIDQ7391279zbMATH OpenFDO

Authors Aleksandr Koshkarov, Nadia Tahiri

Publication date 2026

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11538-026-01711-6

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Cites work

• A supertree method for rooted trees
• Comparison of phylogenetic trees
• Computing the Local Consensus of Trees
• Consensus n-trees
• Faster algorithms for computing the R* consensus tree
• scientific article; zbMATH DE number 1945190 (Why is no real title available?)
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• scientific article; zbMATH DE number 6851886 (Why is no real title available?)
• Improved algorithms for constructing consensus trees
• Majority-rule (+) consensus trees
• Parameterized algorithms
• Reducibility among combinatorial problems

This page was built for publication: Polynomial-time completion of phylogenetic tree sets

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