Optimizing phylogenetic diversity under constraints

DOI10.1016/j.jtbi.2006.12.021zbMath1451.92227OpenAlexW2047460558WikidataQ33271776 ScholiaQ33271776MaRDI QIDQ2210035

Charles Semple, Mike A. Steel, Vincent L. Moulton

Publication date: 5 November 2020

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jtbi.2006.12.021

zbMATH Keywords

greedy algorithmphylogenetic diversity

Mathematics Subject Classification ID

Problems related to evolution (92D15) Approximation algorithms (68W25)

Related Items

On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks ⋮ Counting and optimising maximum phylogenetic diversity sets ⋮ Capturing diversity: split systems and circular approximations for conservation ⋮ The Bhargava greedoid ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Maximizing a submodular function with viability constraints ⋮ Phylogenetic diversity and the maximum coverage problem ⋮ A greedoid and a matroid inspired by Bhargava's \(p\)-orderings ⋮ NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization ⋮ Optimizing phylogenetic diversity across two trees ⋮ Mathematical optimization ideas for biodiversity conservation

Cites Work

• Unnamed Item
• Unnamed Item
• Greedoids
• A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
• A canonical decomposition theory for metrics on a finite set
• Greedy algorithm compatibility and heavy-set structures