Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead

Published 21 Mar 2024 in cs.CC | (2403.14217v1)

Abstract: Phylogenetic Diversity (PD) is a measure of the overall biodiversity of a set of present-day species (taxa) within a phylogenetic tree. In Maximize Phylogenetic Diversity (MPD) one is asked to find a set of taxa (of bounded size/cost) for which this measure is maximized. MPD is a relevant problem in conservation planning, where there are not enough resources to preserve all taxa and minimizing the overall loss of biodiversity is critical. We consider an extension of this problem, motivated by real-world concerns, in which each taxon not only requires a certain amount of time to save, but also has an extinction time after which it can no longer be saved. In addition there may be multiple teams available to work on preservation efforts in parallel; we consider two variants of the problem based on whether teams are allowed to collaborate on the same taxa. These problems have much in common with machine scheduling problems, (with taxa corresponding to tasks and teams corresponding to machines), but with the objective function (the phylogenetic diversity) inspired by biological considerations. Our extensions are, in contrast to the original MPD, NP-hard, even in very restricted cases. We provide several algorithms and hardness-results and thereby show that the problems are fixed-parameter tractable (FPT) when parameterized the target phylogenetic diversity, and that the problem where teams are allowed to collaborate is FPT when parameterized the acceptable loss of diversity.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. A. Billionnet. Solution of the Generalized Noah’s Ark Problem. Systematic Biology, 62(1):147–156, 2013.
  2. A. Billionnet. How to take into account uncertainty in species extinction probabilities for phylogenetic conservation prioritization. Environmental Modeling & Assessment, 22(6):535–548, 2017.
  3. M. Bordewich and C. Semple. Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems. Journal of mathematical biology, 64:69–85, 02 2011.
  4. Optimizing phylogenetic diversity across two trees. Applied Mathematics Letters, 22(5):638–641, 2009.
  5. On the Complexity of optimising variants of Phylogenetic Diversity on Phylogenetic Networks. Theoretical Computer Science, 917:66–80, 2022.
  6. Parameterized Algorithms. Springer, 2015.
  7. Fixed-Parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141(1-2):109–131, 1995.
  8. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  9. D. P. Faith. Conservation evaluation and Phylogenetic Diversity. Biological Conservation, 61(1):1–10, 1992.
  10. “Strong” NP-Completeness Results: Motivation, Examples, and Implications. Journal of the ACM, 25(3):499–508, 1978.
  11. Optimization and approximation in deterministic sequencing and scheduling: a survey. In Annals of discrete mathematics, volume 5, pages 287–326. Elsevier, 1979.
  12. Knapsack Problems: A parameterized point of view. Theoretical Computer Science, 775:93–108, 2019.
  13. The Shapley value of Phylogenetic Trees. Journal of mathematical biology, 56(4):479–497, 2008.
  14. K. Hartmann. The equivalence of two Phylogenetic Diodiversity measures: the Shapley value and Fair Proportion index. Journal of Mathematical Biology, 67:1163–1170, 2013.
  15. K. Hartmann and M. Steel. Maximizing phylogenetic diversity in biodiversity conservation: Greedy solutions to the noah’s ark problem. Systematic Biology, 55(4):644–651, 08 2006.
  16. K. Heeger and D. Hermelin. Minimizing the Weighted Number of Tardy Jobs is W[1]-hard. arXiv preprint arXiv:2401.01740, 2024.
  17. Single Machine Scheduling with Few Deadlines. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023.
  18. New algorithms for minimizing the weighted number of tardy jobs on a single machine. Annals of Operations Research, 298:271–287, 2021.
  19. J. Hickel. Quantifying national responsibility for climate breakdown: an equality-based attribution approach for carbon dioxide emissions in excess of the planetary boundary. The Lancet Planetary Health, 4(9):e399–e404, 2020.
  20. IPCC 2023; Core Writing Team, H. Lee and J. Romero (eds.). Climate Change 2023: Synthesis Report. Contribution of Working Groups I, II and III to the Sixth Assessment Report of the Intergovernmental Panel on Climate Change. 2023.
  21. M. Jones and J. Schestag. How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2023.
  22. R. M. Karp. Reducibility among Combinatorial Problems. In Proceedings of a Symposium on the Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.
  23. C. Komusiewicz and J. Schestag. A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem. arXiv preprint arXiv:2307.03518, 2023.
  24. A functional equation and its application to resource allocation and sequencing problems. Management science, 16(1):77–84, 1969.
  25. W. L. Maxwell. On sequencing n𝑛nitalic_n jobs on one machine to minimize the number of late jobs. Management Science, 16(5):295–297, 1970.
  26. Phylogenetic Diversity on Split Networks. Technical report, 12 2007.
  27. Budgeted Phylogenetic Diversity on Circular Split Systems. IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM, 6:22–9, 04 2009.
  28. Phylogenetic Diversity within Seconds. Systematic Biology, 55(5):769–773, 10 2006.
  29. M. Mnich and R. Van Bevern. Parameterized complexity of machine scheduling: 15 open problems. Computers & Operations Research, 100:254–261, 2018.
  30. J. M. Moore. An n𝑛nitalic_n job, one machine sequencing algorithm for minimizing the number of late jobs. Management science, 15(1):102–109, 1968.
  31. Optimizing phylogenetic diversity under constraints. Journal of Theoretical Biology, 246(1):186–194, 2007.
  32. Splitters and near-optimal derandomization. Proceedings of IEEE 36th Annual Foundations of Computer Science, pages 182–191, 1995.
  33. F. Pardi and N. Goldman. Species Choice for Comparative Genomics: Being Greedy Works. PLoS Genetics, 1, 2005.
  34. F. Pardi and N. Goldman. Resource-Aware Taxon Selection for Maximizing Phylogenetic Diversity. Systematic Biology, 56(3):431–444, 2007.
  35. Incorporating evolutionary measures into conservation prioritization. Conservation Biology, 20(6):1670–1678, 2006.
  36. Maximising phylogenetic diversity in the selection of networks of conservation areas. Biological Conservation, 105(1):103–111, 2002.
  37. Integrating phylogenetic diversity in the selection of priority areas for conservation: does it make a difference?, page 101–119. Conservation Biology. Cambridge University Press, 2005.
  38. S. K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23(1):116–127, 1976.
  39. J. B. Sidney. An Extension of Moore’s Due Date Algotithm. In Symposium on the Theory of Scheduling and its Applications, pages 393–398. Springer, 1973.
  40. Computing Phylogenetic Diversity for Split Systems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2):235–244, 2008.
  41. M. Steel. Phylogenetic Diversity and the greedy algorithm. Systematic Biology, 54(4):527–529, 2005.
  42. H. M. Weingartner. Capital budgeting of interrelated projects: Survey and synthesis. Management Science, 12(7):485–516, 1966.
  43. K. Wicke and M. Fischer. Phylogenetic Diversity and biodiversity indices on Phylogenetic Networks. Mathematical Biosciences, 298:80–90, 2018.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up