Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Optimizing phylogenetic diversity under constraints.

Vincent Moulton1, Charles Semple, Mike Steel

  • 1School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK. vincent.moulton@cmp.uea.ac.uk

Journal of Theoretical Biology
|February 6, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Order-Dependent dissimilarity measures on phylogenetic trees.

Journal of mathematical biology·2026
Same author

Counting Rankings of Tree-Child Networks.

Bulletin of mathematical biology·2026
Same author

Correction: "Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances".

Bulletin of mathematical biology·2026
Same author

Predicting the depth of the most recent common ancestor of a random sample of k species: the impact of phylogenetic tree shape.

Journal of mathematical biology·2026
Same author

Characterizing semi-directed phylogenetic networks and their multi-rootable variants.

Theory in biosciences = Theorie in den Biowissenschaften·2025
Same author

Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances.

Bulletin of mathematical biology·2025
Same journal

The male-biased sex ratio in humans and its role in the transition from promiscuity to pair bonding.

Journal of theoretical biology·2026
Same journal

Quantifying the counter-intuitive effects of vaccination by coupling the transmission dynamics of COVID-19 and the evolution of human behaviors.

Journal of theoretical biology·2026
Same journal

An integrative model of FGF2-induced signaling and muscle cell proliferation.

Journal of theoretical biology·2026
Same journal

A hybrid reaction-diffusion and mechanical stimulus model for mandibular bone remodeling under chewing and vibratory loading.

Journal of theoretical biology·2026
Same journal

Integrated tick management strategies in fragmented peridomestic environments.

Journal of theoretical biology·2026
Same journal

Joint likelihood-free inference of the number of selected single nucleotide polymorphisms and their selection coefficients in an evolving population.

Journal of theoretical biology·2026
See all related articles

Phylogenetic diversity (PD) optimization for conservation can be efficiently solved using a greedy algorithm. However, extending this to phylogeography reveals NP-hard complexities, though some cases remain solvable.

Area of Science:

  • Evolutionary biology
  • Conservation science
  • Computational phylogenetics

Background:

  • Phylogenetic diversity (PD) quantifies biodiversity by measuring evolutionary divergence within taxa subsets.
  • A greedy algorithm was previously found to efficiently maximize PD for a given subset size.
  • Understanding the combinatorial structure and theoretical underpinnings of PD optimization is crucial.

Purpose of the Study:

  • To extend the understanding of phylogenetic diversity optimization problems.
  • To investigate the computational complexity of PD optimization in phylogeographic settings.
  • To explore the applicability of greedy algorithms to constrained PD optimization scenarios.

Main Methods:

  • Detailed combinatorial analysis of PD optimization problems.

Related Experiment Videos

  • Application of greedoid theory to PD optimization.
  • Investigation of NP-hardness for phylogeographic PD optimization.
  • Analysis of greedy algorithm performance on ecologically constrained PD problems.

    • Main Results:

    • The study explicitly describes the combinatorial structure of PD optimization and its link to greedoid theory.
    • Extending PD optimization to phylogeography results in an NP-hard problem, with a special case solvable by the greedy algorithm.
    • The greedy algorithm can solve specific cases of PD optimization with ecologically viable set restrictions.
    • Three PD-related measures were identified as not optimizable by the greedy algorithm.

    Conclusions:

    • While greedy algorithms efficiently solve basic PD optimization, phylogeographic extensions introduce significant computational challenges.
    • The greedy approach remains valuable for specific, constrained biodiversity conservation problems.
    • Further research is needed to address the NP-hard aspects of phylogeographic PD optimization.