An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss

  • Authors:

  • Glenn Hickey;Mathieu Blanchette;Paz Carmi;Anil Maheshwari;Norbert Zeh

  • Affiliations:

  • McGill University, Montreal;McGill University, Montreal;Ben-Gurion University of the Negev, Beer-Sheva;Carleton University, Ottawa;Dalhousie University, Halifax

  • Venue:
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The phylogenetic diversity (PD) of a set of species is a measure of their evolutionary distinctness based on a phylogenetic tree. PD is increasingly being adopted as an index of biodiversity in ecological conservation projects. The Noah's Ark Problem (NAP) is an NP-Hard optimization problem that abstracts a fundamental conservation challenge in asking to maximize the expected PD of a set of taxa given a fixed budget, where each taxon is associated with a cost of conservation and a probability of extinction. Only simplified instances of the problem, where one or more parameters are fixed as constants, have as of yet been addressed in the literature. Furthermore, it has been argued that PD is not an appropriate metric for models that allow information to be lost along paths in the tree. We therefore generalize the NAP to incorporate a proposed model of feature loss according to an exponential distribution and term this problem NAP with Loss (NAPL). In this paper, we present a pseudopolynomial time approximation scheme for NAPL.