Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs

In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases of TRp have been investigated before in different contexts; the best previous results are as follows: (1) The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial

• Type: Journal
• Year: 2008
• Where: ALGORITHMICA
• Authors: Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag
• Keywords: ALGORITHMICA 2008, False Positive Inferences, P-ary Transitive Reduction, Special Case