Optimizing phylogenetic diversity under constraints

DOI10.1016/J.JTBI.2006.12.021zbMATH Open1451.92227OpenAlexW2047460558WikidataQ33271776 ScholiaQ33271776MaRDI QIDQ2210035FDOQ2210035

Authors: Charles Semple, Vincent Moulton, Mike Steel 

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

Recommendations

• Optimizing phylogenetic diversity with ecological constraints
• Optimizing phylogenetic diversity across two trees
• Counting and optimising maximum phylogenetic diversity sets
• On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
• Phylogenetic diversity and the maximum coverage problem
• scientific article; zbMATH DE number 1303534
• Optimal Diversity‐Dependent Contributions of Genotypes to Mixtures
• A parallel optimization approach for controlling allele diversity in conservation schemes
• Optimizing tree and character compatibility across several phylogenetic trees

zbMATH Keywords

greedy algorithmphylogenetic diversity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A canonical decomposition theory for metrics on a finite set
• Greedoids
• A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
• Greedy algorithm compatibility and heavy-set structures

Cited In (15)

• Fast phylogenetic biodiversity computations under a non-uniform random distribution
• The Bhargava greedoid as a Gaussian elimination greedoid
• The matroid structure of representative triple sets and triple-closure computation
• The Bhargava greedoid
• On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
• Capturing diversity: split systems and circular approximations for conservation
• Phylogenetic diversity and the maximum coverage problem
• Optimizing phylogenetic diversity across two trees
• An interchange property for the rooted phylogenetic subnet diversity on phylogenetic networks
• A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
• A parallel optimization approach for controlling allele diversity in conservation schemes
• Counting and optimising maximum phylogenetic diversity sets
• NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
• Optimizing phylogenetic diversity with ecological constraints
• Mathematical optimization ideas for biodiversity conservation

This page was built for publication: Optimizing phylogenetic diversity under constraints

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