Automatic network reconstruction using ASP
- Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarativeBuilding biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.…
Author details: | Markus Durzinsky, Wolfgang Marwan, Max OstrowskiGND, Torsten SchaubORCiDGND, Annegret Wagler |
---|---|
URN: | urn:nbn:de:kobv:517-opus4-412419 |
DOI: | https://doi.org/10.25932/publishup-41241 |
ISSN: | 1866-8372 |
Title of parent work (English): | Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe |
Publication series (Volume number): | Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (560) |
Publication type: | Postprint |
Language: | English |
Date of first publication: | 2019/01/30 |
Publication year: | 2011 |
Publishing institution: | Universität Potsdam |
Release date: | 2019/01/30 |
Tag: | answer; biological networks; regulatory networks |
Issue: | 560 |
Number of pages: | 18 |
Source: | Theory and Practice of Logic Programming 11 (2011) 4–5, pp. 749–766 DOI 10.1017/S1471068411000287 |
Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät |
DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
Peer review: | Referiert |
Publishing method: | Open Access |
Grantor: | Cambridge University Press (CUP) |
License (German): | Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
External remark: | Bibliographieeintrag der Originalveröffentlichung/Quelle |