561 research outputs found

    Designing optimal experiments to discriminate interaction graph models

    Get PDF

    Predicting weighted unobserved nodes in a regulatory network using answer set programming.

    Get PDF
    peer reviewed[en] BACKGROUND: The impact of a perturbation, over-expression, or repression of a key node on an organism, can be modelled based on a regulatory and/or metabolic network. Integration of these two networks could improve our global understanding of biological mechanisms triggered by a perturbation. This study focuses on improving the modelling of the regulatory network to facilitate a possible integration with the metabolic network. Previously proposed methods that study this problem fail to deal with a real-size regulatory network, computing predictions sensitive to perturbation and quantifying the predicted species behaviour more finely. RESULTS: To address previously mentioned limitations, we develop a new method based on Answer Set Programming, MajS. It takes a regulatory network and a discrete partial set of observations as input. MajS tests the consistency between the input data, proposes minimal repairs on the network to establish consistency, and finally computes weighted and signed predictions over the network species. We tested MajS by comparing the HIF-1 signalling pathway with two gene-expression datasets. Our results show that MajS can predict 100% of unobserved species. When comparing MajS with two similar (discrete and quantitative) tools, we observed that compared with the discrete tool, MajS proposes a better coverage of the unobserved species, is more sensitive to system perturbations, and proposes predictions closer to real data. Compared to the quantitative tool, MajS provides more refined discrete predictions that agree with the dynamic proposed by the quantitative tool. CONCLUSIONS: MajS is a new method to test the consistency between a regulatory network and a dataset that provides computational predictions on unobserved network species. It provides fine-grained discrete predictions by outputting the weight of the predicted sign as a piece of additional information. MajS' output, thanks to its weight, could easily be integrated with metabolic network modelling

    Visualization of modular structures in biological networks

    Get PDF

    Statistical physics of information processing by cells

    Get PDF
    This thesis provides a physics account of the ability of cells to integrate environmental information to make complex decisions, a process commonly known as signaling. It strives to address the following questions: (i) How do cells relate the state of the environment (e.g. presence/absence of specific molecules) to a desired response such as gene expression? (ii) How can cells robustly transfer information? (iii) Is there a biophysical limit to a cells' ability to process information? (iv) Can we use the answers to the above questions to formulate biophysical principles that inform us about the evolution of signaling? Throughout, I borrow techniques from non-equilibrium statistical physics, statistical learning theory, information theory and information geometry to construct biophysical models capable of making quantitative experimental predictions. Finally, I address the connection of energy expenditure and biological efficiency by zeroing in on a process unique to eukaryotic cells-- nuclear transport. The thesis concludes with a discussion of our theory and its implications for synthetic biology

    Growth and Scaling during Development and Regeneration

    Get PDF
    Life presents fascinating examples of self-organization and emergent phenomena. In multi-cellular organisms, a multitude of cells interact to form and maintain highly complex body plans of well-defined size. In this thesis, we investigate theoretical feedback mechanisms for both self-organized body plan patterning and size control. The thesis is inspired by the astonishing scaling and regeneration abilities of flatworms. These worms can perfectly regrow their entire body plan even from tiny amputation fragments like the tip of the tail. Moreover, they can grow and actively de-grow by more than a factor of 40 in length depending on feeding conditions. These capabilities prompt for remarkable physical mechanisms of self-organized pattern formation and scaling. First, we explore the basic principles and challenges of pattern scaling in mechanisms previously proposed to describe biological pattern formation. Next, we present a novel class of patterning mechanisms yielding entirely self-organized and self-scaling patterns. This framework captures essential features of body plan regeneration and scaling in flatworms. Further, we analyze shape and motility of flatworms. By applying principal component analysis, we characterize shape dynamics during different motility modes and also identify shape variations between different flatworm species. Finally, we investigate the metabolic control of cell turnover and growth. We identify three mechanisms of metabolic energy storage; theoretical descriptions thereof can explain the measured organism growth by rules on the cellular scale. In a close collaboration with experimental biologists, we combine minimal theoretical descriptions with state-of-the-art experiments and data analysis. This allows us to identify generic principles of scalable body plan patterning and growth control in flatworms.Comment: PhD thesis, TU Dresden, German

    From condition-specific interactions towards the differential complexome of proteins

    Get PDF
    While capturing the transcriptomic state of a cell is a comparably simple effort with modern sequencing techniques, mapping protein interactomes and complexomes in a sample-specific manner is currently not feasible on a large scale. To understand crucial biological processes, however, knowledge on the physical interplay between proteins can be more interesting than just their mere expression. In this thesis, we present and demonstrate four software tools that unlock the cellular wiring in a condition-specific manner and promise a deeper understanding of what happens upon cell fate transitions. PPIXpress allows to exploit the abundance of existing expression data to generate specific interactomes, which can even consider alternative splicing events when protein isoforms can be related to the presence of causative protein domain interactions of an underlying model. As an addition to this work, we developed the convenient differential analysis tool PPICompare to determine rewiring events and their causes within the inferred interaction networks between grouped samples. Furthermore, we present a new implementation of the combinatorial protein complex prediction algorithm DACO that features a significantly reduced runtime. This improvement facilitates an application of the method for a large number of samples and the resulting sample-specific complexes can ultimately be assessed quantitatively with our novel differential protein complex analysis tool CompleXChange.Das Transkriptom einer Zelle ist mit modernen Sequenzierungstechniken vergleichsweise einfach zu erfassen. Die Ermittlung von Proteininteraktionen und -komplexen wiederum ist in großem Maßstab derzeit nicht möglich. Um wichtige biologische Prozesse zu verstehen, kann das Zusammenspiel von Proteinen jedoch erheblich interessanter sein als deren reine Expression. In dieser Arbeit stellen wir vier Software-Tools vor, die es ermöglichen solche Interaktionen zustandsbezogen zu betrachten und damit ein tieferes Verständnis darüber versprechen, was in der Zelle bei Veränderungen passiert. PPIXpress ermöglicht es vorhandene Expressionsdaten zu nutzen, um die aktiven Interaktionen in einem biologischen Kontext zu ermitteln. Wenn Proteinvarianten mit Interaktionen von Proteindomänen in Verbindung gebracht werden können, kann hierbei sogar alternatives Spleißen berücksichtigen werden. Als Ergänzung dazu haben wir das komfortable Differenzialanalyse-Tool PPICompare entwickelt, welches Veränderungen des Interaktoms und deren Ursachen zwischen gruppierten Proben bestimmen kann. Darüber hinaus stellen wir eine neue Implementierung des Proteinkomplex-Vorhersagealgorithmus DACO vor, die eine deutlich reduzierte Laufzeit aufweist. Diese Verbesserung ermöglicht die Anwendung der Methode auf eine große Anzahl von Proben. Die damit bestimmten probenspezifischen Komplexe können schließlich mit unserem neuartigen Differenzialanalyse-Tool CompleXChange quantitativ bewertet werden

    Non-acyclicity of coset lattices and generation of finite groups

    Get PDF

    COIN@AAMAS2015

    Get PDF
    COIN@AAMAS2015 is the nineteenth edition of the series and the fourteen papers included in these proceedings demonstrate the vitality of the community and will provide the grounds for a solid workshop program and what we expect will be a most enjoyable and enriching debate.Peer reviewe
    corecore