Cristian Gratie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cristian Gratie has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Eugen Czeizler
Åbo Akademi University
1 shared publication - Ion Petre
Department of Mathematics and Statistics, University of Turku, Turku, Finland
1 shared publication - Kai-Chiu Wu
Abo Akademi Institutionen for naturvetenskaper, 278232 Turku, Länsi-Suomen lääni Finland
1 shared publication - Krishna Kanhaiya
Computational Biomodeling Laboratory, Turku Centre for Computer Science, and Department of Computer Science, Å bo Akademi University, Domkyrkotorget 3, Turku, 20500, Finland
1 shared publication
Latest Publications
- 23 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 15 (4) , 1217-1228
Structural Target Controllability of Linear Networks
Computational analysis of the structure of intra-cellular molecular interaction networks can suggest novel therapeutic approaches for systemic diseases like cancer. Recent research in the area of network science has shown that network control theory can be a powerful tool in the understanding and manipulation of such bio-medical networks. In 2011, Liu et al. developed a polynomial time algorithm computing the size of the minimal set of nodes controlling a linear network. In 2014, Gao et al. generalized the problem for target control, minimizing the set of nodes controlling a target within a linear network. The authors developed a Greedy approximation algorithm with no suggestions over the complexity of the optimization problem. In here we prove that the target controllability problem is NP-hard in all practical matters, i.e., when the control power of any individual input is bounded by some constant. Also, we show that the algorithm provided by Gao et al. fails in some special cases to provide a valid solution, and a subsequent validation step is required. Also, we improve their algorithm using several heuristics, obtaining in the end up to a 10-fold decrease in running time and also a decrease in the size of solutions.
- 23 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 15 (4) , 1217-1228
Structural Target Controllability of Linear Networks
Computational analysis of the structure of intra-cellular molecular interaction networks can suggest novel therapeutic approaches for systemic diseases like cancer. Recent research in the area of network science has shown that network control theory can be a powerful tool in the understanding and manipulation of such bio-medical networks. In 2011, Liu et al. developed a polynomial time algorithm computing the size of the minimal set of nodes controlling a linear network. In 2014, Gao et al. generalized the problem for target control, minimizing the set of nodes controlling a target within a linear network. The authors developed a Greedy approximation algorithm with no suggestions over the complexity of the optimization problem. In here we prove that the target controllability problem is NP-hard in all practical matters, i.e., when the control power of any individual input is bounded by some constant. Also, we show that the algorithm provided by Gao et al. fails in some special cases to provide a valid solution, and a subsequent validation step is required. Also, we improve their algorithm using several heuristics, obtaining in the end up to a 10-fold decrease in running time and also a decrease in the size of solutions.