Dynamics and feedback loops in the transforming growth factor ß signaling pathway.

Transforming growth factor ß (TGF-ß) ligands activate a signaling cascade with multiple cell context dependent outcomes. Disruption or disturbance leads to variant clinical disorders. To develop strategies for disease intervention, delineation of the pathway in further detail is required. Current theoretical models of this pathway describe production and degradation of signal mediating proteins and signal transduction from the cell surface into the nucleus, whereas feedback loops have not exhaustively been included. In this study we present a mathematical model to determine the relevance of feedback regulators (Arkadia, Smad7, Smurf1, Smurf2, SnoN and Ski) on TGF-ß target gene expression and the potential to initiate stable oscillations within a realistic parameter space. We employed massive sampling of the parameters space to pinpoint crucial players for potential oscillations as well as transcriptional product levels. We identified Smad7 and Smurf2 with the highest impact on the dynamics. Based on these findings, we conducted preliminary time course experiments.

Genetic algorithms and their application to in silico evolution of genetic regulatory networks.

A genetic algorithm (GA) is a procedure that mimics processes occurring in Darwinian evolution to solve computational problems. A GA introduces variation through "mutation" and "recombination" in a "population" of possible solutions to a problem, encoded as strings of characters in "genomes," and allows this population to evolve, using selection procedures that favor the gradual enrichment of the gene pool with the genomes of the "fitter" individuals. GAs are particularly suitable for optimization problems in which an effective system design or set of parameter values is sought.In nature, genetic regulatory networks (GRNs) form the basic control layer in the regulation of gene expression levels. GRNs are composed of regulatory interactions between genes and their gene products, and are, inter alia, at the basis of the development of single fertilized cells into fully grown organisms. This paper describes how GAs may be applied to find functional regulatory schemes and parameter values for models that capture the fundamental GRN characteristics. The central ideas behind evolutionary computation and GRN modeling, and the considerations in GA design and use are discussed, and illustrated with an extended example. In this example, a GRN-like controller is sought for a developmental system based on Lewis Wolpert's French flag model for positional specification, in which cells in a growing embryo secrete and detect morphogens to attain a specific spatial pattern of cellular differentiation.

The Systems Biology Graphical Notation.

Circuit diagrams and Unified Modeling Language diagrams are just two examples of standard visual languages that help accelerate work by promoting regularity, removing ambiguity and enabling software tool support for communication of complex information. Ironically, despite having one of the highest ratios of graphical to textual information, biology still lacks standard graphical notations. The recent deluge of biological knowledge makes addressing this deficit a pressing concern. Toward this goal, we present the Systems Biology Graphical Notation (SBGN), a visual language developed by a community of biochemists, modelers and computer scientists. SBGN consists of three complementary languages: process diagram, entity relationship diagram and activity flow diagram. Together they enable scientists to represent networks of biochemical interactions in a standard, unambiguous way. We believe that SBGN will foster efficient and accurate representation, visualization, storage, exchange and reuse of information on all kinds of biological knowledge, from gene regulation, to metabolism, to cellular signaling.

A model diagram layout extension for SBML.

MOTIVATION: Since the knowledge about processes in living cells is increasing, modelling and simulation techniques are used to get new insights into these complex processes. During the last few years, the SBML file format has gained in popularity and support as a means of exchanging model data between the different modelling and simulation tools. In addition to specifying the model as a set of equations, many modern modelling tools allow the user to create and to interact with the model in the form of a reaction graph. Unfortunately, the SBML file format does not provide for the storage of this graph data along with the mathematical description of the model. RESULTS: Therefore, we developed an extension to the SBML file format that makes it possible to store such layout information which describes position and size of objects in the graphical representation. AVAILABILITY: The complete specification can be found on (http://projects.villa-bosch.de/bcb/sbml/ (SBML Layout Extension documentation, 2005). Additionally, a complete implementation exists as part of libSBML (2006, http://www.sbml.org/software/libsbml/).

Quantification of cross correlations in complex spatiotemporal systems.

We propose a design of the equal time correlation matrix suitable for the analysis of multivariate time series with ill-defined phases. We present the cross-correlation analysis of model data sets taken from coupled stochastic oscillators and compare the concept with the results obtained from a conventional correlation matrix analysis. We show that the concept provides a higher sensitivity combined with a better statistical significance when quantifying weak cross correlations.

A new dynamical layout algorithm for complex biochemical reaction networks.

BACKGROUND: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly. RESULTS: Out of these reasons we have developed a new algorithm which tackles these problems by reducing the number of edge crossings in complex systems, taking further biological conventions into account to identify and visualise cycles. Furthermore the algorithm is independent from database information in order to be easily adopted in any application. It can also be tested as part of the SimWiz package (free to download for academic users at 1). CONCLUSION: The new algorithm reduces the complexity of pathways, as well as edge crossings and edge length in the resulting graphical representation. It also considers existing and further biological conventions to create a drawing most biochemists are familiar with. A lot of examples can be found on 2.

CombAlign: a protein sequence comparison algorithm considering recombinations.

The basic linear treatment of sequence comparisons limits the ability of contemporary sequence alignment algorithms to detect non-order-conserving recombinations. Here, we introduce the algorithm combAlign which addresses the assessment of pairwise sequence similarity on non-order-conserving recombinations on a large scale. Emphasizing a two-level approach, combAlign first detects locally well conserved subsequences in a target and a source sequence. Subsequently, the relative placement of alignments is mapped to a graph. Concatenating local alignments to reassemble the target sequence to the fullest extent, the maximum scoring path through the graph denotes the best attainable combAlignment. Parameters influencing this process can be set to meet the user's specific demands. combAlign is applied to examples demonstrating the possibility to reflect evolutionary kinship of proteins even if their domains and motifs are strongly rearranged.