CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008 vol.5 Issue No.02 - April-June

Subscribe

Issue No.02 - April-June (2008 vol.5)

pp: 235-244

ABSTRACT

In conservation biology it is a central problem to measure, predict, and preserve biodiversity as species face extinction. In 1992 Faith proposed measuring the diversity of a collection of species in terms of their relationships on a phylogenetic tree, and to use this information to identify collections of species with high diversity. Here we are interested in some variants of the resulting optimization problem that arise when considering species whose evolution is better represented by a network rather than a tree. More specifically, we consider the problem of computing phylogenetic diversity relative to a split system on a collection of species of size $n$. We show that for general split systems this problem is NP-hard. In addition we provide some efficient algorithms for some special classes of split systems, in particular presenting an optimal $O(n)$ time algorithm for phylogenetic trees and an $O(n\log n + n k)$ time algorithm for choosing an optimal subset of size $k$ relative to a circular split system.

INDEX TERMS

Biology and genetics, Life and Medical Sciences

CITATION

Andreas Spillner, Vincent Moulton, "Computing Phylogenetic Diversity for Split Systems",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.5, no. 2, pp. 235-244, April-June 2008, doi:10.1109/TCBB.2007.70260REFERENCES

- [2] G.M. Barker, “Phylogenetic Diversity: A Quantitative Framework for Measurement of Priority and Achievement in Biodiversity Conservation,”
Biological J. Linnean Soc., vol. 76, pp. 165-194, 2002.- [3] D.P. Faith and A.M. Baker, “Phylogenetic Diversity (PD) and Biodiversity Conservation: Some Bioinformatics Challenges,”
Evolutionary Bioinformatics Online, vol. 2, pp. 70-77, 2006.- [4] K. Hartmann and M. Steel, “Phylogenetic Diversity: From Combinatorics to Ecology,”
New Math. Models in Evolution, O.Gascuel and M. Steel, eds., Oxford Univ. Press, 2006.- [5] F. Pardi and N. Goldman, “Species Choice for Comparative Genomics: Being Greedy Works,”
PLoS Genetics, vol. 1, no. 6, 2005.- [6] D. Faith and K. Williams, “Phylogenetic Diversity and Biodiversity Planning,”
McGraw-Hill Yearbook of Science and Technology, pp.233-235, McGraw-Hill Professional, 2006.- [13] D. Bryant and D. Huson, “Application of Phylogenetic Networks in Evolutionary Studies,”
Molecular Biology and Evolution, vol. 23, pp. 254-267, 2006.- [15] D. Bryant and V. Moulton, “Neighbornet: An Agglomerative Method for the Construction of Phylogenetic Networks,”
Molecular Biology and Evolution, vol. 21, pp. 255-265, 2004.- [16] B.Q. Minh, S. Klaere, and A. von Haeseler, “Phylogenetic Diversity Algorithm,” http: //www.cibiv.at/softwarepda/, Aug. 2007.
- [17] B.Q. Minh, S. Klaere, and A. von Haeseler, “Phylogenetic Diversity on Split Networks,” unpublished manuscript, 2007.
- [19] P. Buneman, “The Recovery of Trees from Measures of Dissimilarity,”
Math. in the Archeological and Historical Sciences, F.R.Hodson, D.G. Kendall, and P. Tautu, eds., pp. 387-395, Edinburgh Univ. Press, 1971.- [20] M.R. Garey and D.S. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.- [21] D. Hochbaum, “Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems,”
Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, 1997.- [22] M. Bordewich and C. Semple, “Nature Reserve Selection Problem: A Tight Approximation Algorithm,“ Technical Report UCDMS2007/1, NZ, Univ. of Canterbury, 2007.
- [23] P. Alimonti and V. Kann, “Hardness of Approximating Problems on Cubic Graphs,”
Proc. Italian Conf. Algorithms and Complexity, pp. 288-298, 1997.- [24] C. Semple and M. Steel,
Phylogenetics. Oxford Univ. Press, 2003.- [27] R. Uehara and Y. Uno, “Efficient Algorithms for the Longest Path Problem,”
Proc. Int'l Symp. Algorithms and Computation, pp. 871-883, 2004.- [29] D. Bryant, V. Moulton, and A. Spillner, “Computing Planar Split Graphs,”
The Ann. New Zealand Phylogenetics Meeting, 2007.- [30] D. Eppstein, M.H. Overmars, G. Rote, and G.J. Woeginger, “Finding Minimum Area $k\hbox{-}{\rm Gons}$ ,”
Discrete and Computational Geometry, vol. 7, pp. 45-58, 1992.- [31] H. Edelsbrunner,
Algorithms in Combinatorial Geometry. Springer, 1987.- [34] K. Kalmanson, “Edgeconvex Circuits and the Travelling Salesman Problem,”
Canadian J. Math., vol. 27, pp. 1000-1010, 1975.- [35] V. Chepoi and B. Fichet, “A Note on Circular Decomposable Metrics,”
Geometriae Dedicata, vol. 69, pp. 237-240, 1998.- [37] H. Schwöbbermeyer and J.T. Kim, “A Comparative Analysis of Biodiversity Measures,”
Proc. European Conf. Advances in Artificial Life, pp. 119-128, 1999.- [40] A. Blum, P. Chalasani, D. Coppersmith, W.R. Pulleyblank, P. Raghavan, and M. Sudan, “The Minimum Latency Problem,”
Proc. ACM Symp. Theory of Computing, pp. 163-171, 1994.- [41] B.R. Holland, “Evolutionary Analysis of Large Data Sets: Trees and Beyond,” PhD dissertation, Massey Univ., 2001.
- [42] S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi, “Heuristic and Special Case Algorithms for Dispersion Problems,”
Operations Research, vol. 42, pp. 299-310, 1994.- [44] R. Chandrasekaran and A. Daughety, “Location on Tree Networks: $p\hbox{-}{\rm Centre}$ and $n\hbox{-}{\rm Dispersion}$ Problems,”
Math. Operations Research, vol. 6, pp. 50-57, 1981.- [46] G.M. Ziegler,
Lectures on Polytopes. Springer, 1995. |