Results 1  10
of
441
Artificial Chemistries  A Review
, 2000
"... This article reviews the growing body of scientific work in Artificial Chemistry. First, common motivations and fundamental concepts are introduced. Second, current research activities are discussed along three application dimensions: modelling, information processing and optimization. Finally, comm ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
(Show Context)
This article reviews the growing body of scientific work in Artificial Chemistry. First, common motivations and fundamental concepts are introduced. Second, current research activities are discussed along three application dimensions: modelling, information processing and optimization. Finally, common phenomena among the different systems are summarized. It is argued here that Artificial Chemistries are "the right stuff" for the study of prebiotic and biochemical evolution, and they provide a productive framework for questions regarding the origin and evolution of organizations in general. Furthermore, Artificial Chemistries have a broad application range to practical problems as shown in this review.
The Social System
"... into cally to a process of national selection. This article describes the process used, presents feedback from the assessors and candidates involved, and discusses possible improvements for future rounds. ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
(Show Context)
into cally to a process of national selection. This article describes the process used, presents feedback from the assessors and candidates involved, and discusses possible improvements for future rounds.
MGS: a RuleBased Programming Language for Complex Objects and Collections
, 2001
"... We present the first results in the development of a new declarative programming language called MGS. This language is devoted to the simulation of biological processes, especially those whose state space must be computed jointly with the current state of the system. MGS proposes a unified view on s ..."
Abstract

Cited by 40 (13 self)
 Add to MetaCart
(Show Context)
We present the first results in the development of a new declarative programming language called MGS. This language is devoted to the simulation of biological processes, especially those whose state space must be computed jointly with the current state of the system. MGS proposes a unified view on several computational mechanisms initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, Paun systems and cellular automata). The basic computation step in MGS replaces in a collection A of elements, some subcollection B, by another collection C. The collection C only depends on B and its adjacent elements in A. The pasting of C into A B depends on the shape of the involved collections. This step is called a transformation. The specification of the collection to be substituted can be done in many ways. We propose here a pattern language based on the neighborhood relationship induced by the topology of the collection. Several features to control the transformation applications are then presented.
Population P systems
 Journal of Universal Computer Science
"... Abstract. A class of P systems, called EP systems, with string objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EP systems, called EPP systems, is also defined and the power of both EP and EPP systems is investi ..."
Abstract

Cited by 38 (15 self)
 Add to MetaCart
(Show Context)
Abstract. A class of P systems, called EP systems, with string objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EP systems, called EPP systems, is also defined and the power of both EP and EPP systems is investigated in relationship with three parameters: number of membranes, states and set of distributed rules. It is shown that EPP systems represent a promising framework for solving NPcomplete problems. In particular linear time solutions are provided for the SAT problem.
P systems, a new computational modelling tool for Systems Biology
 Transactions on Computational Systems Biology VI. Lecture
, 2006
"... Abstract. In this paper we present P systems as a reliable computational modelling tool for Systems Biology that takes into account the discrete character of the quantity of components of biological systems, the inherently randomness in biological phenomena and the key role played by membranes in th ..."
Abstract

Cited by 31 (14 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we present P systems as a reliable computational modelling tool for Systems Biology that takes into account the discrete character of the quantity of components of biological systems, the inherently randomness in biological phenomena and the key role played by membranes in the function of living cells. We will introduce two different strategies for the evolution of P systems, namely, Multicompartmental Gillespie’s Algorithm based on the well known Gillespie’s Algorithm but running on more than one compartment; and Deterministic Waiting Times Algorithm, an exact deterministic method. In order to illustrate these two strategies we have modelled two biological systems: the EGFR Signalling Cascade and the Quorum Sensing System in the bacterium Vibrio Fischeri. Our simulations results show that for the former system a deterministic approach is valid whereas for the latter a stochastic approach like Multicompartmental Gillespie’s Algorithm is necessary. 1
Networks of evolutionary processors
 Acta Informatica
, 2003
"... Abstract. In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters are defined by random context conditions, we obtain an incomparability result with the families of regular and contextfree languages. Despite their simplicity, we show how the latter networks might be used for solving an NPcomplete problem, namely the “3colorability problem”, in linear time and linear resources (nodes, symbols, rules). 1
From cells to computers: Computing with membranes (P systems
 Biosystems
, 2001
"... The aim of this paper is to introduce to the reader the main ideas of computing with membranes, a recent branch of (theoretical) molecular computing. In short, in a celllike system, multisets of objects evolve according to given rules in the compartments defined by a membrane structure and compute ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
The aim of this paper is to introduce to the reader the main ideas of computing with membranes, a recent branch of (theoretical) molecular computing. In short, in a celllike system, multisets of objects evolve according to given rules in the compartments defined by a membrane structure and compute natural numbers as the result of halting sequences of transitions. The model is parallel, nondeterministic. Many variants have already been considered and many problems about them were investigated. We present here some of these variants, focusing on two central classes of results: (1) characterizations of the recursively enumerable sets of numbers and (2) possibilities to solve NPcomplete problems in polynomial — even linear — time (of course, by making use of an exponential space). The results are given without proofs. An almost complete bibliography of the domain, at the middle of October 2000, is
Solving NPcomplete problems with networks of evolutionary processors
 Proceedings of IWANN 2001, LNCS 2084, SpringerVerlag
, 2001
"... We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NPcomplete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher direction ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
(Show Context)
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NPcomplete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed.