Skip to main content Accessibility help

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 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.



Hide All
Akutsu, T., Miyano, S. and Kuhara, S. 1999. Identification of genetic networks from a small number of gene expression patterns under the boolean network model. In Proceedings of the Pacific Symposium on Biocomputing, vol. 4. World Scientific Press, 1728.
Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Oxford University Press, Oxford, UK.
Baral, C., Chancellor, K., Tran, N., Tran, N., Joy, A. and Berens, M. 2004. A knowledge based approach for representing and reasoning about signaling networks. In Proceedings of the Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology (ISMB'04/ECCB'04). 15–22.
Dal Palù, A., Dovier, A. and Pontelli, E. 2009. Logic programming techniques in protein structure determination: Methodologies and results. See Erdem et al., 560–566.
Durzinsky, M., Marwan, W. and Wagler, A. 2010. Reconstructing extended petri nets. Journal of Mathematical Biology. Preprint series: 10–19. URL:
Durzinsky, M., Wagler, A. and Weismantel, R. 2008. A combinatorial approach to reconstruct petri nets from experimental data. Lecture Notes in Bioinformatics 5307, 328346.
Durzinsky, M., Wagler, A. and Weismantel, R. 2010. An algorithmic framework for network reconstruction. Theoretical Computer Science. In Press, Corrected Proof. URL:
Durzinsky, M., Wagler, A., Weismantel, R. and Marwan, W. 2008. Automatic reconstruction of molecular and genetic networks from discrete time series data. Biosystems 93 (3), 181190.
Dworschak, S., Grell, S., Nikiforova, V., Schaub, T., and Selbig, J. 2008. Modeling biological networks by action languages via answer set programming. Constraints 13 (1–2), 2165.
Erdem, E. 2009. PHYLO-ASP: Phylogenetic systematics with answer set programming. See Erdem et al., 567–572.
Erdem, E., Lin, F. and Schaub, T., Eds. 2009. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09). Lecture Notes in Artificial Intelligence, vol. 5753. Springer-Verlag.
Erdem, E. and Türe, F. 2008. Efficient haplotype inference with answer set programming. In Proceedings of the Twenty-third National Conference on Artificial Intelligence (AAAI'08), Fox, D. and Gomes, C., Eds. AAAI, 436441.
Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S., and Veber, P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), Lin, F. and Sattler, U., Eds. AAAI, 497507.
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., and Thiele, S. A user's guide to gringo, clasp, clingo, and iclingo. Accessed 7 June 2011. URl:
Gebser, M., Schaub, T., Thiele, S., Usadel, B., and Veber, P. 2008. Detecting inconsistencies in large biological networks with answer set programming. In Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP'08), Garcia de la Banda, M. and Pontelli, E., Eds. Lecture Notes in Computer Science, vol. 5366. Springer-Verlag, Heidelberg, 130144.
Gebser, M., Kaufmann, B., and Schaub, T. 2009. Solution enumeration for projected Boolean search problems. In Proceedings of the Sixth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), van Hoeve, W. and Hooker, J., Eds. Lecture Notes in Computer Science, vol. 5547. Springer-Verlag, Heidelberg, 7186.
Gelfond, M. 2008. Answer sets. In Handbook of Knowledge Representation, Lifschitz, V., van Hermelen, F., and Porter, B., Eds. Elsevier, Chapter 7, 285316.
Gifford, D. and Jaakkola, T. 2001. Using graphical models and genomic expression data to statistically validate models of genetic regulatory networks. In Proceedings of the Pacific Symposium on Biocomputing vol. 6. 422–433.
goforsys. Accessed 7 June 2011. URL:
Laubenbacher, R. and Stigler, B. 2004. A computational algebra approach to the reverse engineering of gene regulatory networks. Journal of Theoretical Biology 229 (4), 523537.
Liang, S., Fuhrman, S. and Somogyi, R. 1998. Reveal, a general reverse engineering algorithm for inference of genetic network architectures. Pacific Symposium on Biocomputing 3, 1829.
Lin, F. and Zhao, Y. 2004. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 (1–2), 115137.
Marwan, W., Wagler, A. and Weismantel, R. 2008. A mathematical approach to solve the network reconstruction problem. Mathematical Methods of Operatios Research 67 (1), 117132.
Ostrowski, M. 2011. Asp encoding for automatic network reconstruction. Accessed 7 June 2011. URL:
Peer, D., Regev, A., Elidan, G. and Friedman, N. 2001. Inferring subnetworks from perturbed expression profiles. Bioinformatics 17 (suppl 1), 215224.
Repsilber, D., Liljenstrm, H. and Andersson, S. 2002. Reverse engineering of regulatory networks: simulation studies on a genetic algorithm approach for ranking hypotheses. Biosystems 66 (1–2), 3141.
Schaub, T. and Thiele, S. 2009. Metabolic network expansion with ASP. In Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), Hill, P. and Warren, D., Eds. Lecture Notes in Computer Science, vol. 5649. Springer-Verlag, Heidelberg, 312326.
Simons, P., Niemelä, I. and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138 (1–2), 181234.
Syrjänen, T. Lparse 1.0 User's Manual. Accessed 7 June 2011. URL:
Wagler, A. 2011. Prediction of network structure. Modeling in Systems Biology 16, 307336.
Yeung, M., Tegn(c)r, J., and Collins, J. 2002. Reverse engineering gene networks using singular value decomposition and robust regression. Proceedings of the National Academy of Sciences of the United States of America 99 (9), 61636168.

Automatic network reconstruction using ASP



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed