scholarly journals Learning Feedback Molecular Network Models Using Integer Linear Programming

2021 ◽  
Author(s):  
Mustafa Ozen ◽  
Ali Abdi ◽  
Effat S. Emamian

Analysis of intracellular molecular networks has many applications in understanding of the molecular bases of some complex diseases and finding the effective therapeutic targets for drug development. To perform such analyses, the molecular networks need to be converted into computational models. In general, network models constructed using literature and pathway databases may not accurately predict and reproduce experimental network data. This can be due to the incompleteness of literature on molecular pathways, the resources used to construct the networks, or some conflicting information in the resources. In this paper, we propose a network learning approach via an integer linear programming formulation that can efficiently incorporate biological dynamics and regulatory mechanisms of molecular networks in the learning process. Moreover, we present a method to properly take into account the feedback paths, while learning the network from data. Examples are also provided to show how one can apply the proposed learning approach to a network of interest. Overall, the proposed methods are useful for reducing the gap between the curated networks and experimental network data, and result in calibrated networks that are more reliable for making biologically meaningful predictions.

10.37236/1214 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Garth Isaak

We examine the size $s(n)$ of a smallest tournament having the arcs of an acyclic tournament on $n$ vertices as a minimum feedback arc set. Using an integer linear programming formulation we obtain lower bounds $s(n) \geq 3n - 2 - \lfloor \log_2 n \rfloor$ or $s(n) \geq 3n - 1 - \lfloor \log_2 n \rfloor$, depending on the binary expansion of $n$. When $n = 2^k - 2^t$ we show that the bounds are tight with $s(n) = 3n - 2 - \lfloor \log_2 n \rfloor$. One view of this problem is that if the 'teams' in a tournament are ranked to minimize inconsistencies there is some tournament with $s(n)$ 'teams' in which $n$ are ranked wrong. We will also pose some questions about conditions on feedback arc sets, motivated by our proofs, which ensure equality between the maximum number of arc disjoint cycles and the minimum size of a feedback arc set in a tournament.


Sign in / Sign up

Export Citation Format

Share Document