Modeling parsimonious putative regulatory networks: complexity and heuristic approach
Lecture Notes in Computer Science: Verification, Model Checking, and Abstract Interpretation
| dc.creator | Acuña, Vicente | |
| dc.creator | Aravena, Andrés | |
| dc.creator | Maass, Alejandro | |
| dc.creator | Siegel, Anne | |
| dc.date | 2020-07-29T17:42:10Z | |
| dc.date | 2022-07-08T20:13:36Z | |
| dc.date | 2020-07-29T17:42:10Z | |
| dc.date | 2022-07-08T20:13:36Z | |
| dc.date | 2014 | |
| dc.date.accessioned | 2023-08-22T11:41:38Z | |
| dc.date.available | 2023-08-22T11:41:38Z | |
| dc.identifier | 15090007 | |
| dc.identifier | 15090007 | |
| dc.identifier | https://hdl.handle.net/10533/242123 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8345123 | |
| dc.description | A relevant problem in systems biology is the description of the regulatory interactions between genes. It is observed that pairs of genes have significant correlation through several experimental conditions. The question is to find causal relationships that can explain this experimental evidence. A putative regulatory network can be represented by an oriented weighted graph, where vertices represent genes, arcs represent predicted regulatory interactions and the arc weights represent the p-value of the prediction. Given such graph, and experimental evidence of correlation between pairs of vertices, we propose an abstraction and a method to enumerate all parsimonious subgraphs that assign causality relationships compatible with the experimental evidence. When the problem is modeled as the minimization of a global weight function, we show that the enumeration of scenarios is a hard problem. As an heuristic, we model the problem as a set of independent minimization problems, each solvable in polynomial time, which can be combined to explore a relevant subset of the solution space. We present a logic-programming formalization of the model implemented using Answer Set Programming. When the problem is modeled as the minimization of a global weight function, we show that the enumeration of scenarios is a hard problem. As an heuristic, we model the problem as a set of independent minimization problems, each solvable in polynomial time, which can be combined to explore a relevant subset of the solution space. We present a logic-programming formalization of the model implemented using Answer Set Programming. | |
| dc.description | CRG | |
| dc.description | FONDAP | |
| dc.description | WOS | |
| dc.description | SCOPUS | |
| dc.description | FONDAP | |
| dc.language | eng | |
| dc.relation | instname: ANID | |
| dc.relation | reponame: Repositorio Digital RI2.0 | |
| dc.relation | https://link.springer.com/chapter/10.1007/978-3-642-54013-4_18 | |
| dc.rights | Atribución-NoComercial-SinDerivadas 3.0 Chile | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | Modeling parsimonious putative regulatory networks: complexity and heuristic approach | |
| dc.title | Lecture Notes in Computer Science: Verification, Model Checking, and Abstract Interpretation | |
| dc.type | Articulo | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion |