Title: Two pairs of boolean functions in computational biology

We describe two quite different biological contexts where key properties can be encoded as monotone boolean functions. The first is describing the minimal knock out strategies in a metabolic network, the second is identifying minimal conflicting sets in ancestral genome reconstruction. Oracle-based versions of an algorithm of Fredman and Khachiyan are used to generate representations of these boolean functions. In the process of generation, a dual boolean function is identified. These dual functions have interesting interpretations in terms of the systems we are studying. We briefly mention computational results.

This is joint work with Cedric Chauve, Utz-Uwe Haus and Steffen Klamt.