Showing papers by "Grzegorz Rozenberg published in 2003"
TL;DR: A molecular model of template-guided recombination is proposed to explain the excision of the 100,000-150,000 IESs and splicing of MDSs, including unscrambling, in the genome of stichotrichous ciliates.
94 citations
01 Feb 2003
TL;DR: This work defines team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions to serve as a formal framework for modeling both the conceptual and the architectural level of groupware systems.
Abstract: Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which basic groupware notions can be rigorously defined and studied. At the architectural level, team automata can be used as building blocks in the design of groupware systems.
72 citations
TL;DR: It is proved that although the graph rewriting system is more "abstract" than the string rewriting system, no "essential information" is lost, in the sense that one can translate assembly strategies from one system into the other.
56 citations
TL;DR: A DNA based algorithm for solving the satisfiability problem by blocking (inactivating) this part of the total library of molecules that does not contribute to (finding) a solution.
39 citations
TL;DR: Basic computational properties of fe systems operating on strings, a model of molecular computing based on two kinds of "boundary conditions": forbidding and enforcing, are investigated in the framework of strings.
20 citations
01 Jan 2003
17 citations
TL;DR: Several elements of molecular biology of bacteria are recalled, also discussing their (possible) relevance for the membrane computing area.
Abstract: We recall several elements of molecular biology of bacteria, also discussing their (possible) relevance for the membrane computing area.
10 citations
TL;DR: This paper considers and solves the overlap equivalence problem for realistic strings: when do two different realistic legal strings translate into the same overlap graph?
Abstract: Gene assembly in ciliates is a life process fascinating from both the biological and the computational points of view. Several formal models of this process have been formulated and investigated, among them a model based on (legal) strings and a model based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the overlap equivalence problem for realistic strings: when do two different realistic legal strings translate into the same overlap graph? Realistic legal strings are legal strings that “really” correspond to genes generated during the gene assembly process.
8 citations
Journal Article•
TL;DR: This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, the objective of which is to provide real-time information about the response of the immune system to computer attacks.
Abstract: 1 Dept. of Mathematics, University of Turku, FIN-20014 Turku, Finland. 2 Dept. of Computer Science, Åbo Akademi University, FIN-20520 Turku, Finland. 3 Leiden Institute for Advanced Computer Science, Leiden University Niels Bohrweg 1, 2333 CA Leiden, The Netherlands and Department of Computer Science, University of Colorado, Boulder, Co 80309-0347, USA. emails: harju@utu.fi, ipetre@abo.fi, rozenber@liacs.nl
1 citations