Sciweavers

51 search results - page 3 / 11
» On Representing Biological Systems through Multiset Rewritin...
Sort
View
RTA
2010
Springer
13 years 11 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
AB
2007
Springer
14 years 1 months ago
Attenuation Regulation as a Term Rewriting System
Abstract The classical attenuation regulation of gene expression in bacteria is considered. We propose to represent the secondary RNA structure in the leader region of a gene or an...
Eugene Asarin, Thierry Cachat, Alexander Seliverst...
DILS
2005
Springer
14 years 1 months ago
BioNavigation: Selecting Optimum Paths Through Biological Resources to Evaluate Ontological Navigational Queries
Publicly available biological resources form a complex maze of highly heterogeneous data sources, interconnected by navigational capabilities and applications. Although it offers ...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...
ICNC
2005
Springer
14 years 1 months ago
Reaction-Driven Membrane Systems
Abstract. Membrane systems are gaining a prominent role in the modeling of biochemical processes and cellular dynamics. We associate specific reactivity values to the production r...
Luca Bianco, Federico Fontana, Vincenzo Manca
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel