An integer optimization approach for reverse engineering of gene regulatory networks

Cordone, Roberto and Lulli, Guglielmo (2013) An integer optimization approach for reverse engineering of gene regulatory networks. Discrete Applied Mathematics, 161 (4-5). pp. 580-592. ISSN 0166-218X

Full text not available from this repository.

Abstract

Gene regulatory networks are a common tool to describe the chemical interactions between genes in a living cell. This paper considers the Weighted Gene Regulatory Network (WGRN) problem, which consists in identifying a reduced set of interesting candidate regulatory elements which can explain the expression of all other genes. We provide an integer programming formulation based on a graph model and derive from it a branch-and-bound algorithm which exploits the Lagrangian relaxation of suitable constraints. This allows to determine lower bounds tighter than CPLEX on most benchmark instances, with the exception of the sparser ones. In order to determine feasible solutions for the problem, which appears to be a hard task for general-purpose solvers, we also develop and compare two metaheuristic approaches, namely a Tabu Search and a Variable Neighborhood Search algorithm. The experiments performed on both of them suggest that diversification is a key feature to solve the problem.

Item Type:
Journal Article
Journal or Publication Title:
Discrete Applied Mathematics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2604
Subjects:
?? gene regulatory networkslagrangian relaxationtabu searchvariable neighborhood searchapplied mathematicsdiscrete mathematics and combinatorics ??
ID Code:
75940
Deposited By:
Deposited On:
21 Oct 2015 05:02
Refereed?:
Yes
Published?:
Published
Last Modified:
16 Sep 2024 13:25