The minimal seed set problem

Avitan Gefen, Ronen I. Brafman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

This paper defines and studies a new, interesting, and challenging benchmark problem that originates in systems biology. The minimal seed-set problem is defined as follows: given a description of the metabolic reactions of an organism, characterize the minimal set of nutrients with which it could synthesize all nutrients it is capable of synthesizing. Current methods used in systems biology yield only approximate solutions. And although it is natural to cast it as a planning problem, current optimal planners are unable to solve it, while non-optimal planners return plans that are very far from optimal. As a planning problem, it is inherently delete-free, has many zero-cost actions, all propositions are landmarks, and many legal permutations of the plan exist. We show how a simple uninformed search algorithm that exploits inherent independence between sub-goals can solve it optimally by reducing the branching factor drastically.

Original languageEnglish
Title of host publicationICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling
Pages319-322
Number of pages4
StatePublished - 27 Oct 2011
Event21st International Conference on Automated Planning and Scheduling, ICAPS 2011 - Freiburg, Germany
Duration: 11 Jun 201116 Jun 2011

Publication series

NameICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Conference

Conference21st International Conference on Automated Planning and Scheduling, ICAPS 2011
Country/TerritoryGermany
CityFreiburg
Period11/06/1116/06/11

Fingerprint

Dive into the research topics of 'The minimal seed set problem'. Together they form a unique fingerprint.

Cite this