Projekteja vuodessa
Abstrakti
Recent research has revealed new applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic questions, this time with a much stronger motivation for their tackling. One of these questions regards the socalled Structural Target Control optimization problem, known in previous literature also as Structural Output Controllability problem. Given a directed network (graph) and a target subset of nodes, the task is to select a small (or the smallest) set of nodes from which the target can be independently controlled, i.e., it can be driven from any given initial configuration to any desired final one, through a finite sequence of input values. In recent work, this problem has been shown to be NPhard, and several heuristic algorithms were introduced and analyzed, both on randomly generated networks, and on biomedical ones. In this paper, we show that the Structural Target Controllability problem is fixed parameter tractable when parameterized by the number of target nodes. We also prove that the problem is hard to approximate at a factor better than O(logn)" role="presentation">O(logn).
Alkuperäiskieli  Ei tiedossa 

Otsikko  Algorithms for Computational Biology : 5th International Conference, AlCoB 2018, Hong Kong, China, June 25–26, 2018, Proceedings 
Toimittajat  Jansson Jesper, MartinVide Carlos, VegaRodriguez Miguel 
Kustantaja  Springer 
Sivut  103–114 
ISBN (elektroninen)  9783319919386 
ISBN (painettu)  9783319919379 
DOI  pysyväislinkit  
Tila  Julkaistu  2018 
OKMjulkaisutyyppi  A4 Artikkeli konferenssijulkaisuussa 
Tapahtuma  International Conference on Algorithms for Computational Biology (AlCoB)  5th International Conference on Algorithms for Computational Biology, AlCoB Kesto: 25 kesäk. 2018 → 26 kesäk. 2018 
Konferenssi
Konferenssi  International Conference on Algorithms for Computational Biology (AlCoB) 

Ajanjakso  25/06/18 → 26/06/18 
Keywords
 Cancer
 Efficient algorithms
 Graphsearch algorithms
 computational complexity
Projektit
 1 Päättynyt

NetPharma: Network pharmacology: drug repurposing and discovery of multidrug therapies by analytical approaches (Business Finland)
Czeizler, E.
01/06/16 → 31/12/18
Projekti: Research