178
to identify a subset of ktaxathatmaximizesPDonaphylogenetictreeofntaxa
(2 ≤ k < n).ForreserveselectionwedefinePDonasubsetofareasasthePDofthe
uniontaxonsetoftheareas.Thesimplestreserveselectionproblemisanalogously
to identify a subset of kareasthatmaximizesPDoverallsubsetsofkareas.Inthe
following, we reformulate these problems using SD and further integrate economi-
calandecologicalconstraintsintotheextensions.
Taxon Selection Problems
Westartwiththesimplesttaxonselectionproblemformallydefinedas:
Asanillustration,giventhesplitsetfortenpheasants(Fig. 2 ) we want to select
fourtaxamaximizingSD.Bydoingsoweyieldanoptimalsubset(highlightedin
Problem 1 (Taxon Selection)
Given a phylogenetic split set for ntaxa,findasubsetofktaxathatmaximizes
SD over all subsets of ktaxa.
Taxa Areas
Conservation targets
- Taxon
selection
Conservation Constraints
Ecology Economy
- Viable
taxon
selection - Budgeted
taxon
selection - Reserve
selection - Budgeted
reserve
selection
Fig. 3 The“network”ofbiodiversityoptimizationproblems
O. Chernomor et al.