15,335 research outputs found
Evolutionary Dynamics in a Simple Model of Self-Assembly
We investigate the evolutionary dynamics of an idealised model for the robust
self-assembly of two-dimensional structures called polyominoes. The model
includes rules that encode interactions between sets of square tiles that drive
the self-assembly process. The relationship between the model's rule set and
its resulting self-assembled structure can be viewed as a genotype-phenotype
map and incorporated into a genetic algorithm. The rule sets evolve under
selection for specified target structures. The corresponding, complex fitness
landscape generates rich evolutionary dynamics as a function of parameters such
as the population size, search space size, mutation rate, and method of
recombination. Furthermore, these systems are simple enough that in some cases
the associated model genome space can be completely characterised, shedding
light on how the evolutionary dynamics depends on the detailed structure of the
fitness landscape. Finally, we apply the model to study the emergence of the
preference for dihedral over cyclic symmetry observed for homomeric protein
tetramers
Algorithms of maximum likelihood data clustering with applications
We address the problem of data clustering by introducing an unsupervised,
parameter free approach based on maximum likelihood principle. Starting from
the observation that data sets belonging to the same cluster share a common
information, we construct an expression for the likelihood of any possible
cluster structure. The likelihood in turn depends only on the Pearson's
coefficient of the data. We discuss clustering algorithms that provide a fast
and reliable approximation to maximum likelihood configurations. Compared to
standard clustering methods, our approach has the advantages that i) it is
parameter free, ii) the number of clusters need not be fixed in advance and
iii) the interpretation of the results is transparent. In order to test our
approach and compare it with standard clustering algorithms, we analyze two
very different data sets: Time series of financial market returns and gene
expression data. We find that different maximization algorithms produce similar
cluster structures whereas the outcome of standard algorithms has a much wider
variability.Comment: Accepted by Physica A; 12 pag., 5 figures. More information at:
http://www.sissa.it/dataclusterin
A tractable genotype-phenotype map for the self-assembly of protein quaternary structure
The mapping between biological genotypes and phenotypes is central to the
study of biological evolution. Here we introduce a rich, intuitive, and
biologically realistic genotype-phenotype (GP) map, that serves as a model of
self-assembling biological structures, such as protein complexes, and remains
computationally and analytically tractable. Our GP map arises naturally from
the self-assembly of polyomino structures on a 2D lattice and exhibits a number
of properties: (genotypes vastly outnumber phenotypes),
(genotypic redundancy varies greatly between
phenotypes), (phenotypes consist
of disconnected mutational networks) and (most
phenotypes can be reached in a small number of mutations). We also show that
the mutational robustness of phenotypes scales very roughly logarithmically
with phenotype redundancy and is positively correlated with phenotypic
evolvability. Although our GP map describes the assembly of disconnected
objects, it shares many properties with other popular GP maps for connected
units, such as models for RNA secondary structure or the HP lattice model for
protein tertiary structure. The remarkable fact that these important properties
similarly emerge from such different models suggests the possibility that
universal features underlie a much wider class of biologically realistic GP
maps.Comment: 12 pages, 6 figure
Is the Cell Really a Machine?
It has become customary to conceptualize the living cell as an intricate piece of machinery, different to a man-made machine only in terms of its superior complexity. This familiar understanding grounds the conviction that a cell's organization can be explained reductionistically, as well as the idea that its molecular pathways can be construed as deterministic circuits. The machine conception of the cell owes a great deal of its success to the methods traditionally used in molecular biology. However, the recent introduction of novel experimental techniques capable of tracking individual molecules within cells in real time is leading to the rapid accumulation of data that are inconsistent with an engineering view of the cell. This paper examines four major domains of current research in which the challenges to the machine conception of the cell are particularly pronounced: cellular architecture, protein complexes, intracellular transport, and cellular behaviour. It argues that a new theoretical understanding of the cell is emerging from the study of these phenomena which emphasizes the dynamic, self-organizing nature of its constitution, the fluidity and plasticity of its components, and the stochasticity and non-linearity of its underlying processes
Synthetic Gene Circuits: Design with Directed Evolution
Synthetic circuits offer great promise for generating insights into nature's underlying design principles or forward engineering novel biotechnology applications. However, construction of these circuits is not straightforward. Synthetic circuits generally consist of components optimized to function in their natural context, not in the context of the synthetic circuit. Combining mathematical modeling with directed evolution offers one promising means for addressing this problem. Modeling identifies mutational targets and limits the evolutionary search space for directed evolution, which alters circuit performance without the need for detailed biophysical information. This review examines strategies for integrating modeling and directed evolution and discusses the utility and limitations of available methods
- …