The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (2008 vol.5)
pp: 275-280
ABSTRACT
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set of regions to conserve so that the phylogenetic diversity of the set of species contained within those regions is maximized. Recently, it was shown in a paper by Moulton {\\em et al.} that this problem is NP-hard. In this paper, we establish a tight polynomial-time approximation algorithm for the Nature Reserve Section Problem. Furthermore, we resolve a question on the computational complexity of a related problem left open in Moulton {\\em et al.}
INDEX TERMS
Combinatorial algorithms, Trees
CITATION
Magnus Bordewich, Charles Semple, "Nature Reserve Selection Problem: A Tight Approximation Algorithm", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, no. 2, pp. 275-280, April-June 2008, doi:10.1109/TCBB.2007.70252
REFERENCES
[1] D.P. Faith, “Conservation Evaluation and Phylogenetic Diversity,” Biological Conservation, vol. 61, pp. 1-10, 1992.
[2] D.P. Faith and A.M. Baker, “Phylogenetic Diversity (PD) and Biodiversity Conservation: Some Bioinformatics Challenges,” Evolutionary Bioinformatics Online, pp. 70-77, 2006.
[3] U. Feige, “A Threshold of $\ln n$ for Approximating Set Cover,” J. ACM, vol. 45, pp. 634-652, 1998.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
[5] K. Hartmann and M. Steel, “Maximizing Phylogenetic Diversity in Biodiversity Conservation: Greedy Solutions to the Noah's Ark Problem,” Systematic Biology, vol. 55, pp. 644-651, 2006.
[6] D. Hochbaum, “Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems,” Approximation Algorithms for NP-Hard Problems. PWS, 1997.
[7] S. Khuller, A. Moss, and J. Naor, “The Budgeted Maximum Coverage Problem,” Information Processing Letters, vol. 70, pp. 39-45, 1999.
[8] C. Moritz and D.P. Faith, “Comparative Phylogeography and the Identification of Genetically Divergent Areas for Conservation,” Molecular Ecology, vol. 7, pp. 419-429, 1998.
[9] V. Moulton, C. Semple, and M. Steel, “Optimizing Phylogenetic Diversity under Constraints,” J. Theoretical Biology, vol. 246, pp. 186-194, 2007.
[10] F. Pardi and N. Goldmann, “Species Choice for Comparative Genomics: Being Greedy Works,” PLoS Genetics 1, p. e71, 2005.
[11] F. Pardi and N. Goldman, “Resource-Aware Taxon Selection for Maximising Phylogenetic Diversity,” Systematic Biology, vol. 56, no. 3, pp. 431-444, June 2007.
[12] A.S.L. Rodrigues and K.J. Gaston, “Maximising Phylogenetic Diversity in the Selection of Networks of Conservation Areas,” Biological Conservation, vol. 105, pp. 103-111, 2002.
[13] A.S.L. Rodrigues, T.M. Brooks, and K.J. Gaston, “Integrating Phylogenetic Diversity in the Selection of Priority Areas for Conservation: Does It Make a Difference,” Phylogeny and Conservation, A. Purvis, J.L. Gittleman, and T. Brooks, eds., Cambridge Univ. Press, 2005.
[14] C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
[15] T.B. Smith, K. Holder, D. Girman, K. O'Keefe, B. Larison, and Y. Chan, “Comparative Avian Phylogeography of Cameroon and Equatorial Guinea Mountains: Implications for Conservation,” Molecular Ecology, vol. 9, pp. 1505-1516, 2000.
[16] M. Steel, “Phylogenetic Diversity and the Greedy Algorithm,” Systematic Biology, vol. 54, pp. 527-529, 2005.
82 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool