In a network orientation problem one is given a mixed graph, consisting of directed and undirected edges, and a set of source-target vertex pairs. The goal is to orient the undirected edges so that a maximum number of pairs admit a directed path from the source to the target. This problem is NP-complete and no approximation algorithms are known for it. It arises in the context of analyzing physical networks of protein-protein and protein-dna interactions. While the latter are naturally directed from a transcription factor to a gene, the direction of signal flow in protein-protein interactions is often unknown or cannot be measured en masse. One then tries to infer this information by using causality data on pairs of genes such that the perturbation of one gene changes the expression level of the other gene. Here we provide a first polynomial-size ilp formulation for this problem, which can be efficiently solved on current networks. We apply our algorithm to orient protein-protein interactions in yeast and measure our performance using edges with known orientations. We find that our algorithm achieves high accuracy and coverage in the orientation, outperforming simplified algorithmic variants that do not use information on edge directions. The obtained orientations can lead to better understanding of the structure and function of the network.
|Titel||Research in Computational Molecular Biology|
|Redakteure/-innen||Vineet Bafna, S. Cenk Sahinalp|
|Herausgeber (Verlag)||Springer Berlin Heidelberg|
|Publikationsstatus||Veröffentlicht - 03.2011|
|Veranstaltung||15th Annual International Conference, RECOMB 2011 - Vancouver, Kanada|
Dauer: 28.03.2011 → 31.03.2011