TY  - JOUR
A1  - Durzinsky, Markus
A1  - Marwan, Wolfgang
A1  - Ostrowski, Max
A1  - Schaub, Torsten H.
A1  - Wagler, Annegret
T1  - Automatic network reconstruction using ASP
T2  - Theory and practice of logic programming
N2  - 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 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.
Y1  - 2011
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/36760
SN  - 1471-0684
VL  - 11
SP  - 749
EP  - 766
PB  - Cambridge Univ. Press
CY  - New York
ER  -