Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
Abteilung V

Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 2013 Copyright 2013 Universität Bonn, Institut für Informatik, Abt. V


Algorithmic Perspectives of Network Transitive Reduction Problems
Satabdi Aditya, Bhaskar DasGupta and Marek Karpinski
[Download PostScript] [Download PDF]

In this survey paper we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three major biological research questions: synthesizing and simplifying signal transduction networks, analyzing disease networks, and measuring redundancy of biological networks.

Last Change: 11/05/14 at 11:02:54
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope