Identifying gene regulatory networks from experimental data
Parallel Computing - new trends in high performance computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
DS '02 Proceedings of the 5th International Conference on Discovery Science
Ant Colony Optimization
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
An integer optimization approach for reverse engineering of gene regulatory networks
Discrete Applied Mathematics
A GRASP metaheuristic for microarray data analysis
Computers and Operations Research
Hi-index | 0.05 |
In this paper, we propose a methodology for making sense of large, multiple time-series data sets arising in expression analysis. Specifically, we present a mathematical model to release a reduced and coherent regulatory system given a putative regulatory network. We give two equivalent formulations of the problem and prove that the problem is NP-complete. For solving large scale instances we implemented an Ant Colony Optimization procedure. A computational analysis on randomly generated test instances validates the proposed algorithm and the computations on real data concerning Saccharomyces cerevisiae show the practicability of the proposed methodology.