Quantificação de caulinita em latossolo por difração de raios-X.

bitstream/item/31910/1/CPATU-BP39.pd

Revisiting the Training of Logic Models of Protein Signaling Networks with a Formal Approach based on Answer Set Programming

A fundamental question in systems biology is the construction and training to data of mathematical models. Logic formalisms have become very popular to model signaling networks because their simplicity allows us to model large systems encompassing hundreds of proteins. An approach to train (Boolean) logic models to high-throughput phospho-proteomics data was recently introduced and solved using optimization heuristics based on stochastic methods. Here we demonstrate how this problem can be solved using Answer Set Programming (ASP), a declarative problem solving paradigm, in which a problem is encoded as a logical program such that its answer sets represent solutions to the problem. ASP has significant improvements over heuristic methods in terms of efficiency and scalability, it guarantees global optimality of solutions as well as provides a complete set of solutions. We illustrate the application of ASP with in silico cases based on realistic networks and data

Structural and functional analysis of cellular networks with CellNetAnalyzer

BACKGROUND: Mathematical modelling of cellular networks is an integral part of Systems Biology and requires appropriate software tools. An important class of methods in Systems Biology deals with structural or topological (parameter-free) analysis of cellular networks. So far, software tools providing such methods for both mass-flow (metabolic) as well as signal-flow (signalling and regulatory) networks are lacking. RESULTS: Herein we introduce CellNetAnalyzer, a toolbox for MATLAB facilitating, in an interactive and visual manner, a comprehensive structural analysis of metabolic, signalling and regulatory networks. The particular strengths of CellNetAnalyzer are methods for functional network analysis, i.e. for characterising functional states, for detecting functional dependencies, for identifying intervention strategies, or for giving qualitative predictions on the effects of perturbations. CellNetAnalyzer extends its predecessor FluxAnalyzer (originally developed for metabolic network and pathway analysis) by a new modelling framework for examining signal-flow networks. Two of the novel methods implemented in CellNetAnalyzer are discussed in more detail regarding algorithmic issues and applications: the computation and analysis (i) of shortest positive and shortest negative paths and circuits in interaction graphs and (ii) of minimal intervention sets in logical networks. CONCLUSION: CellNetAnalyzer provides a single suite to perform structural and qualitative analysis of both mass-flow- and signal-flow-based cellular networks in a user-friendly environment. It provides a large toolbox with various, partially unique, functions and algorithms for functional network analysis.CellNetAnalyzer is freely available for academic use

Logical network of genotoxic stress-induced NF-kB signal transduction predicts putative target structures for therapeutic intervention strategies

Genotoxic stress is induced by a broad range of DNA-damaging agents and could lead to a variety of human diseases including cancer. DNA damage is also therapeutically induced for cancer treatment with the aim to eliminate tumor cells. However, the effectiveness of radio- and chemotherapy is strongly hampered by tumor cell resistance. A major reason for radio- and chemotherapeutic resistances is the simultaneous activation of cell survival pathways resulting in the activation of the transcription factor nuclear factor-kappa B (NF-κB). Here, we present a Boolean network model of the NF-κB signal transduction induced by genotoxic stress in epithelial cells. For the representation and analysis of the model, we used the formalism of logical interaction hypergraphs. Model reconstruction was based on a careful meta-analysis of published data. By calculating minimal intervention sets, we identified p53-induced protein with a death domain (PIDD), receptor-interacting protein 1 (RIP1), and protein inhibitor of activated STAT y (PIASy) as putative therapeutic targets to abrogate NF-κB activation resulting in apoptosis. Targeting these structures therapeutically may potentiate the effectiveness of radio- and chemotherapy. Thus, the presented model allows a better understanding of the signal transduction in tumor cells and provides candidates as new therapeutic target structures. © 2009 Poltz et al, publisher and licensee Dove Medical Press Ltd. This is an Open Access article which permits unrestricted noncommercial use, provided the original work is properly cited. [accessed February 5th, 2010

Exploiting the pathway structure of metabolism to reveal high-order epistasis

<p>Abstract</p> <p>Background</p> <p>Biological robustness results from redundant pathways that achieve an essential objective, e.g. the production of biomass. As a consequence, the biological roles of many genes can only be revealed through multiple knockouts that identify a <it>set </it>of genes as essential for a given function. The identification of such "epistatic" essential relationships between network components is critical for the understanding and eventual manipulation of robust systems-level phenotypes.</p> <p>Results</p> <p>We introduce and apply a network-based approach for genome-scale metabolic knockout design. We apply this method to uncover over 11,000 minimal knockouts for biomass production in an <it>in silico </it>genome-scale model of <it>E. coli</it>. A large majority of these "essential sets" contain 5 or more reactions, and thus represent complex epistatic relationships between components of the <it>E. coli </it>metabolic network.</p> <p>Conclusion</p> <p>The complex minimal biomass knockouts discovered with our approach illuminate robust essential systems-level roles for reactions in the <it>E. coli </it>metabolic network. Unlike previous approaches, our method yields results regarding high-order epistatic relationships and is applicable at the genome-scale.</p

Computing paths and cycles in biological interaction graphs

<p>Abstract</p> <p>Background</p> <p>Interaction graphs (signed directed graphs) provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops) and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments.</p> <p>Results</p> <p>We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible) this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops.</p> <p>Conclusion</p> <p>The calculation of shortest positive/negative paths and cycles in interaction graphs is an important method for network analysis in Systems Biology. This contribution draws the attention of the community to this important computational problem and provides a number of new algorithms, partially specifically tailored for biological interaction graphs. All algorithms have been implemented in the <it>CellNetAnalyzer </it>framework which can be downloaded for academic use at <url>http://www.mpi-magdeburg.mpg.de/projects/cna/cna.html</url>.</p