52,309 research outputs found
TinkerCell: Modular CAD Tool for Synthetic Biology
Synthetic biology brings together concepts and techniques from engineering
and biology. In this field, computer-aided design (CAD) is necessary in order
to bridge the gap between computational modeling and biological data. An
application named TinkerCell has been created in order to serve as a CAD tool
for synthetic biology. TinkerCell is a visual modeling tool that supports a
hierarchy of biological parts. Each part in this hierarchy consists of a set of
attributes that define the part, such as sequence or rate constants. Models
that are constructed using these parts can be analyzed using various C and
Python programs that are hosted by TinkerCell via an extensive C and Python
API. TinkerCell supports the notion of a module, which are networks with
interfaces. Such modules can be connected to each other, forming larger modular
networks. Because TinkerCell associates parameters and equations in a model
with their respective part, parts can be loaded from databases along with their
parameters and rate equations. The modular network design can be used to
exchange modules as well as test the concept of modularity in biological
systems. The flexible modeling framework along with the C and Python API allows
TinkerCell to serve as a host to numerous third-party algorithms. TinkerCell is
a free and open-source project under the Berkeley Software Distribution
license. Downloads, documentation, and tutorials are available at
www.tinkercell.com.Comment: 23 pages, 20 figure
Stochastic Simulation of Process Calculi for Biology
Biological systems typically involve large numbers of components with
complex, highly parallel interactions and intrinsic stochasticity. To model
this complexity, numerous programming languages based on process calculi have
been developed, many of which are expressive enough to generate unbounded
numbers of molecular species and reactions. As a result of this expressiveness,
such calculi cannot rely on standard reaction-based simulation methods, which
require fixed numbers of species and reactions. Rather than implementing custom
stochastic simulation algorithms for each process calculus, we propose to use a
generic abstract machine that can be instantiated to a range of process calculi
and a range of reaction-based simulation algorithms. The abstract machine
functions as a just-in-time compiler, which dynamically updates the set of
possible reactions and chooses the next reaction in an iterative cycle. In this
short paper we give a brief summary of the generic abstract machine, and show
how it can be instantiated with the stochastic simulation algorithm known as
Gillespie's Direct Method. We also discuss the wider implications of such an
abstract machine, and outline how it can be used to simulate multiple calculi
simultaneously within a common framework.Comment: In Proceedings MeCBIC 2010, arXiv:1011.005
Towards heterotic computing with droplets in a fully automated droplet-maker platform
The control and prediction of complex chemical systems is a difficult problem due to the nature of the interactions, transformations and processes occurring. From self-assembly to catalysis and self-organization, complex chemical systems are often heterogeneous mixtures that at the most extreme exhibit system-level functions, such as those that could be observed in a living cell. In this paper, we outline an approach to understand and explore complex chemical systems using an automated droplet maker to control the composition, size and position of the droplets in a predefined chemical environment. By investigating the spatio-temporal dynamics of the droplets, the aim is to understand how to control system-level emergence of complex chemical behaviour and even view the system-level behaviour as a programmable entity capable of information processing. Herein, we explore how our automated droplet-maker platform could be viewed as a prototype chemical heterotic computer with some initial data and example problems that may be viewed as potential chemically embodied computations
Automation on the generation of genome scale metabolic models
Background: Nowadays, the reconstruction of genome scale metabolic models is
a non-automatized and interactive process based on decision taking. This
lengthy process usually requires a full year of one person's work in order to
satisfactory collect, analyze and validate the list of all metabolic reactions
present in a specific organism. In order to write this list, one manually has
to go through a huge amount of genomic, metabolomic and physiological
information. Currently, there is no optimal algorithm that allows one to
automatically go through all this information and generate the models taking
into account probabilistic criteria of unicity and completeness that a
biologist would consider. Results: This work presents the automation of a
methodology for the reconstruction of genome scale metabolic models for any
organism. The methodology that follows is the automatized version of the steps
implemented manually for the reconstruction of the genome scale metabolic model
of a photosynthetic organism, {\it Synechocystis sp. PCC6803}. The steps for
the reconstruction are implemented in a computational platform (COPABI) that
generates the models from the probabilistic algorithms that have been
developed. Conclusions: For validation of the developed algorithm robustness,
the metabolic models of several organisms generated by the platform have been
studied together with published models that have been manually curated. Network
properties of the models like connectivity and average shortest mean path of
the different models have been compared and analyzed.Comment: 24 pages, 2 figures, 2 table
Inferring the function of genes from synthetic lethal mutations
Techniques for detecting synthetic lethal mutations in double gene deletion experiments are emerging as powerful tool for analysing genes in parallel or overlapping pathways with a shared function. This paper introduces a logic-based approach that uses synthetic lethal mutations for mapping genes of unknown function to enzymes in a known metabolic network. We show how such mappings can be automatically computed by a logical learning system called eXtended Hybrid Abductive Inductive Learning (XHAIL)
- …