The Community for Technology Leaders
RSS Icon
Issue No.01 - January-March (2009 vol.6)
pp: 22-29
Bui Quang Minh , CIBIV, Vienna
Fabio Pardi , EBI, Hinxton
Steffen Klaere , Center for Integrative Bioinformatics Vienna , Vienna
Arndt von Haeseler , CIBIV, Vienna
In the last 15 years, Phylogenetic Diversity (PD) has gained interest in the community of conservation biologists as a surrogate measure for assessing biodiversity. We have recently proposed two approaches to select taxa for maximizing PD, namely PD with budget constraints and PD on split systems. In this paper, we will unify these two strategies and present a dynamic programming algorithm to solve the unified framework of selecting taxa with maximal PD under budget constraints on circular split systems. An improved algorithm will also be given if the underlying split system is a tree.
Biology and genetics, Optimization
Bui Quang Minh, Fabio Pardi, Steffen Klaere, Arndt von Haeseler, "Budgeted Phylogenetic Diversity on Circular Split Systems", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, no. 1, pp. 22-29, January-March 2009, doi:10.1109/TCBB.2008.54
[1] Biodiversity, E.O. Wilson, ed., first ed. Nat'l Academies Press, 1988.
[2] K.J. Gaston and J.I. Spicer, Biodiversity: An Introduction, second ed. Blackwell Publishing Professional, 2004.
[3] R.M. May, “Taxonomy as Destiny,” Nature, vol. 347, pp. 129-130, 1990.
[4] R.I. Vane-Wright, C.J. Humphries, and P.H. Williams, “What to Protect?—Systematics and the Agony of Choice,” Biological Conservation, vol. 55, pp. 235-254, 1991.
[5] D.P. Faith, “Conservation Evaluation and Phylogenetic Diversity,” Biological Conservation, vol. 61, pp. 1-10, 1992.
[6] R.H. Crozier, “Genetic Diversity and the Agony of Choice,” Biological Conservation, vol. 61, pp. 11-15, 1992.
[7] R.H. Crozier, “Preserving the Information Content of Species: Genetic Diversity, Phylogeny, and Conservation Worth,” Ann. Rev. Ecology and Systematics, vol. 28, pp. 243-268, 1997.
[8] A. Purvis, J.L. Gittleman, and T. Brooks, Phylogeny and Conservation, Conservation Biology, Cambridge Univ. Press, 2005.
[9] M. Steel, “Phylogenetic Diversity and the Greedy Algorithm,” Systematic Biology, vol. 54, no. 4, pp. 527-529, 2005.
[10] F. Pardi and N. Goldman, “Species Choice for Comparative Genomics: Being Greedy Works,” PLoS Genetics, vol. 1, pp.672-675, 2005.
[11] B.Q. Minh, S. Klaere, and A. von Haeseler, “Phylogenetic Diversity within Seconds,” Systematic Biology, vol. 55, no. 5, pp.769-773, 2006.
[12] A. Spillner, B.T. Nguyen, and V. Moulton, Computing Phylogenetic Diversity for Split Systems, IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 5, no. 2, pp. 235-244, Apr.-June 2008.
[13] F. Pardi and N. Goldman, “Resource-Aware Taxon Selection for Maximising Phylogenetic Diversity,” Systematic Biology, vol. 56, pp. 431-444, 2007.
[14] M.L. Weitzman, “The Noah's Ark Problem,” Econometrica, vol. 66, no. 6, pp. 1279-1298, 1998.
[15] K. Hartmann and M. Steel, “Maximizing Phylogenetic Diversity in Biodiversity Conservation: Greedy Solutions to the Noah's Ark Problem,” Systematic Biology, vol. 55, no. 4, pp. 644-651, 2006.
[16] D. Graur and W.-H. Li, Fundamentals of Molecular Evolution, seconded. Sinauer Assoc., 2000.
[17] M. Nei, Molecular Evolutionary Genetics. Columbia Univ. Press, 1987.
[18] B.Q. Minh, S. Klaere, and A. von Haeseler, “Phylogenetic Diversity on Split Networks,” Technical Report NI07090-PLG, Isaac Newton Inst., 2007.
[19] D. Bryant and V. Moulton, “Neighbor-Net: An Agglomerative Method for the Construction of Phylogenetic Networks,” Molecular Biology and Evolution, vol. 21, pp. 255-265, 2004.
[20] C. Semple and M. Steel, Phylogenetics, Oxford Lectures Series in Mathematics and Its Applications, J. Ball and D. Welsh, eds., Oxford Univ. Press, 2003.
[21] H.-J. Bandelt and A.W.M. Dress, “Split Decomposition: A New and Useful Approach to Phylogenetic Analysis of Distance Data,” Molecular Phylogenetics and Evolution, vol. 1, pp. 242-252, 1992.
[22] F. Pardi, “Algorithms on Phylogenetic Trees,” PhD dissertation, Univ. of Cambridge, 2008.
[23] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press and McGraw-Hill, 2001.
[24] P.O. Lewis, “NCL: A C++ Class Library for Interpreting Data Files in NEXUS Format,” Bioinformatics, vol. 19, no. 17, pp. 2330-2331, 2003.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool