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

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

A methodology for the structural and functional analysis of signaling and regulatory networks

BACKGROUND: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functional capabilities. While the structural analysis of metabolic networks is a well-established field, similar methodologies have been scarcely developed and applied to signaling and regulatory networks. RESULTS: We propose formalisms and methods, relying on adapted and partially newly introduced approaches, which facilitate a structural analysis of signaling and regulatory networks with focus on functional aspects. We use two different formalisms to represent and analyze interaction networks: interaction graphs and (logical) interaction hypergraphs. We show that, in interaction graphs, the determination of feedback cycles and of all the signaling paths between any pair of species is equivalent to the computation of elementary modes known from metabolic networks. Knowledge on the set of signaling paths and feedback loops facilitates the computation of intervention strategies and the classification of compounds into activators, inhibitors, ambivalent factors, and non-affecting factors with respect to a certain species. In some cases, qualitative effects induced by perturbations can be unambiguously predicted from the network scheme. Interaction graphs however, are not able to capture AND relationships which do frequently occur in interaction networks. The consequent logical concatenation of all the arcs pointing into a species leads to Boolean networks. For a Boolean representation of cellular interaction networks we propose a formalism based on logical (or signed) interaction hypergraphs, which facilitates in particular a logical steady state analysis (LSSA). LSSA enables studies on the logical processing of signals and the identification of optimal intervention points (targets) in cellular networks. LSSA also reveals network regions whose parametrization and initial states are crucial for the dynamic behavior. We have implemented these methods in our software tool CellNetAnalyzer (successor of FluxAnalyzer) and illustrate their applicability using a logical model of T-Cell receptor signaling providing non-intuitive results regarding feedback loops, essential elements, and (logical) signal processing upon different stimuli. CONCLUSION: The methods and formalisms we propose herein are another step towards the comprehensive functional analysis of cellular interaction networks. Their potential, shown on a realistic T-cell signaling model, makes them a promising tool

Computing the shortest elementary flux modes in genome-scale metabolic networks

This article is available open access through the publisher’s website through the link below. Copyright @ The Author 2009.Motivation: Elementary flux modes (EFMs) represent a key concept to analyze metabolic networks from a pathway-oriented perspective. In spite of considerable work in this field, the computation of the full set of elementary flux modes in large-scale metabolic networks still constitutes a challenging issue due to its underlying combinatorial complexity. Results: In this article, we illustrate that the full set of EFMs can be enumerated in increasing order of number of reactions via integer linear programming. In this light, we present a novel procedure to efficiently determine the K-shortest EFMs in large-scale metabolic networks. Our method was applied to find the K-shortest EFMs that produce lysine in the genome-scale metabolic networks of Escherichia coli and Corynebacterium glutamicum. A detailed analysis of the biological significance of the K-shortest EFMs was conducted, finding that glucose catabolism, ammonium assimilation, lysine anabolism and cofactor balancing were correctly predicted. The work presented here represents an important step forward in the analysis and computation of EFMs for large-scale metabolic networks, where traditional methods fail for networks of even moderate size. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online (http://bioinformatics.oxfordjournals.org/cgi/content/full/btp564/DC1).Fundação Calouste Gulbenkian, Fundação para a Ciência e a Tecnologia (FCT) and Siemens SA Portugal

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

An optimization model for metabolic pathways

This article is available open access through the publisher’s website through the link below. Copyright @ The Author 2009.Motivation: Different mathematical methods have emerged in the post-genomic era to determine metabolic pathways. These methods can be divided into stoichiometric methods and path finding methods. In this paper we detail a novel optimization model, based upon integer linear programming, to determine metabolic pathways. Our model links reaction stoichiometry with path finding in a single approach. We test the ability of our model to determine 40 annotated Escherichia coli metabolic pathways. We show that our model is able to determine 36 of these 40 pathways in a computationally effective manner. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online (http://bioinformatics.oxfordjournals.org/cgi/content/full/btp441/DC1)

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

Origem do adensamento em solos do tabuleiro sertanejo do estado de Pernambuco: pedogenetica e/ou deposicional.

O presente trabalho foi desenvolvido para identificar e caracterizar horizontes adensados em podzólico amarelo e solonetz solodizado no semi-árido pernambucano, visando testar a hipótese de que estes apresentam descontinuidade textural

A new computational method to split large biochemical networks into coherent subnets

<p>Abstract</p> <p>Background</p> <p>Compared to more general networks, biochemical networks have some special features: while generally sparse, there are a small number of highly connected metabolite nodes; and metabolite nodes can also be divided into two classes: internal nodes with associated mass balance constraints and external ones without. Based on these features, reclassifying selected internal nodes (separators) to external ones can be used to divide a large complex metabolic network into simpler subnetworks. Selection of separators based on node connectivity is commonly used but affords little detailed control and tends to produce excessive fragmentation.</p> <p>The method proposed here (Netsplitter) allows the user to control separator selection. It combines local connection degree partitioning with global connectivity derived from random walks on the network, to produce a more even distribution of subnetwork sizes. Partitioning is performed progressively and the interactive visual matrix presentation used allows the user considerable control over the process, while incorporating special strategies to maintain the network integrity and minimise the information loss due to partitioning.</p> <p>Results</p> <p>Partitioning of a genome scale network of 1348 metabolites and 1468 reactions for <it>Arabidopsis thaliana </it>encapsulates 66% of the network into 10 medium sized subnets. Applied to the flavonoid subnetwork extracted in this way, it is shown that Netsplitter separates this naturally into four subnets with recognisable functionality, namely synthesis of lignin precursors, flavonoids, coumarin and benzenoids. A quantitative quality measure called <it>efficacy </it>is constructed and shows that the new method gives improved partitioning for several metabolic networks, including bacterial, plant and mammal species.</p> <p>Conclusions</p> <p>For the examples studied the Netsplitter method is a considerable improvement on the performance of connection degree partitioning, giving a better balance of subnet sizes with the removal of fewer mass balance constraints. In addition, the user can interactively control which metabolite nodes are selected for cutting and when to stop further partitioning as the desired granularity has been reached. Finally, the blocking transformation at the heart of the procedure provides a powerful visual display of network structure that may be useful for its exploration independent of whether partitioning is required.</p