• Publications
  • Influence
A simple mass-action model for the eukaryotic heat shock response and its mathematical validation
TLDR
We propose here a simple mechanistic model for the eukaryotic heat shock response, including its mathematical validation. Expand
  • 53
  • 11
  • PDF
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
1 An Overview of the Cell.- 2 Ciliates.- 3 Molecular Operations for Gene Assembly.- 4 Model Forming.- 5 Mathematical Preliminaries.- 6 MDS Arrangements and MDS Descriptors.- 7 MDS Descriptor PointerExpand
  • 66
  • 7
  • PDF
Self-assembly of strings and languages
TLDR
We propose in this paper a string-based framework inspired by the principle of self-assembly: two strings with a common overlap, say uv and vw, yield a string Uvw; we say that string uvw has been assembled from strings uv. Expand
  • 21
  • 6
  • PDF
Matrix insertion-deletion systems
TLDR
We investigate in this article the operations of insertion and deletion working in a matrix-controlled manner. Expand
  • 29
  • 5
  • PDF
Parikh matrices and amiable words
TLDR
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same ParikhMatrix; these words are called ''amiable''. Expand
  • 46
  • 4
  • PDF
Universal and simple operations for gene assembly in ciliates
TLDR
We describe the model of gene assembly in ciliates presented in [2], [4], and [3]. Expand
  • 52
  • 2
  • PDF
Reaction System Models for the Heat Shock Response
TLDR
Reaction systems are a formal framework for modeling processes driven by biochemical reactions. Expand
  • 29
  • 2
Characterizing the Micronuclear Gene Patterns in Ciliates
TLDR
In this paper we continue to investigate the three molecular operations (ld, hi , and dlad ) that were postulated to carry out the gene assembly process in the intramolecular fashion. Expand
  • 37
  • 2
Algebraic Systems and Pushdown Automata
We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on theExpand
  • 43
  • 2
  • PDF
Conway's problem for three-word sets
TLDR
We show that the maximal language commuting with a three-element language, i.e. its centralizer, is rational, thus giving an affirmative answer to a special case of a problem proposed by Conway in 1971. Expand
  • 26
  • 2
  • PDF