Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study

Published 27 May 2024 in cs.CC | (2405.17314v1)

Abstract: In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree $T$ over a set of taxa $X$, a food-web that describes the prey-predator relationships in $X$, and integers $k$ and $D$. The task is to find a set $S$ of $k$ species that is viable in the food-web such that the subtree of $T$ obtained by retaining only the vertices of $S$ has total edge weight at least $D$. Herein, viable means that for every predator taxon of $S$, the set $S$ contains at least one prey taxon. We provide the first systematic analysis of PDD and its special case s-PDD from a parameterized complexity perspective. For solution-size related parameters, we show that PDD is FPT with respect to $D$ and with respect to $k$ plus the height of the phylogenetic tree. Moreover, we consider structural parameterizations of the food-web. For example, we show an FPT-algorithm for the parameter that measures the vertex deletion distance to graphs where every connected component is a complete graph. Finally, we show that s-PDD admits an FPT-algorithm for the treewidth of the food-web. This disproves a conjecture of Faller et al. [Annals of Combinatorics, 2011] who conjectured that s-PDD is NP-hard even when the food-web is a tree.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. Color-coding. Journal of the Association for Computing Machinery (JACM), 42(4):844–856, 1995.
  2. T. Beyer and S. M. Hedetniemi. Constant time generation of rooted trees. SIAM Journal on Computing, 9(4):706–712, 1980.
  3. On the Complexity of optimising variants of Phylogenetic Diversity on Phylogenetic Networks. Theoretical Computer Science, 917:66–80, 2022.
  4. A review of species role concepts in food webs. Food Webs, 16:e00093, 2018.
  5. Parameterized Algorithms. Springer, 2015.
  6. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141(1-2):109–131, 1995.
  7. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  8. D. P. Faith. Conservation evaluation and Phylogenetic Diversity. Biological Conservation, 61(1):1–10, 1992.
  9. Optimizing phylogenetic diversity with ecological constraints. Annals of Combinatorics, 15(2):255–266, 2011.
  10. Phylogenetic patterns are not proxies of community assembly mechanisms (they are far better). Functional Ecology, 29(5):600–614, 2015.
  11. 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, 2006.
  12. Mammals on the edge: conservation priorities based on threat and phylogeny. PloS one, 2(3):e296, 2007.
  13. 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.
  14. M. Jones and J. Schestag. Maximizing Phylogenetic Diversity under Time Pressure: Planning with Extinctions Ahead. arXiv preprint arXiv:2403.14217, 2024.
  15. C. Komusiewicz and J. Schestag. A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem. In Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages 109–121. Springer, 2023.
  16. Evolutionary dynamics on graphs. Nature, 433(7023):312–316, 2005.
  17. Prioritizing phylogenetic diversity captures functional diversity unreliably. Nature Communications, 9(1):2888, 2018.
  18. Phylogenetic Diversity within Seconds. Systematic Biology, 55(5):769–773, 10 2006.
  19. B. Mohar. Face covers and the genus problem for apex graphs. Journal of Combinatorial Theory, Series B, 82(1):102–117, 2001.
  20. Optimizing phylogenetic diversity under constraints. Journal of Theoretical Biology, 246(1):186–194, 2007.
  21. Splitters and near-optimal Derandomization. Proceedings of IEEE 36th Annual Foundations of Computer Science, pages 182–191, 1995.
  22. F. Pardi and N. Goldman. Species Choice for Comparative Genomics: Being Greedy Works. PLoS Genetics, 1, 2005.
  23. F. Pardi and N. Goldman. Resource-aware taxon selection for maximizing phylogenetic diversity. Systematic Biology, 56(3):431–444, 2007.
  24. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B, 52(2):153–190, 1991.
  25. P. W. Shor. A new proof of Cayley’s formula for counting labeled trees. Journal of Combinatorial Theory, Series A, 71(1):154–158, 1995.
  26. Computing phylogenetic diversity for split systems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2):235–244, 2008.
  27. M. Steel. Phylogenetic Diversity and the greedy algorithm. Systematic Biology, 54(4):527–529, 2005.
  28. Maximizing network phylogenetic diversity. arXiv preprint arXiv:2405.01091, 2024.
  29. K. Wicke and M. Fischer. Phylogenetic Diversity and biodiversity indices on Phylogenetic Networks. Mathematical Biosciences, 298:80–90, 2018.

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free