Abstract
In this paper, we provide a method to increase the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, which is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secondary structures, which are typical structures in RNA sequences. Splicing on trees involves (1) complete subtrees as axioms, (2) restriction operated on the annealed subsequences, (3) rules to substitute a complete subtree with another. We show that splicing systems on trees with finite sets of axioms and finite sets of rules can generate the class of context-free languages without the need of imposing multiplicity constraints.
| Original language | English |
|---|---|
| Pages (from-to) | 227-243 |
| Number of pages | 17 |
| Journal | Theoretical Computer Science |
| Volume | 210 |
| Issue number | 2 |
| Publication status | Published - 1999 Jan 17 |
| Externally published | Yes |
Fingerprint
Keywords
- Context-free grammer
- DNA computer
- Splicing system
- Tree
ASJC Scopus subject areas
- Computational Theory and Mathematics
Cite this
Splicing on tree-like structures. / Sakakibara, Yasubumi; Ferretti, Claudio.
In: Theoretical Computer Science, Vol. 210, No. 2, 17.01.1999, p. 227-243.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Splicing on tree-like structures
AU - Sakakibara, Yasubumi
AU - Ferretti, Claudio
PY - 1999/1/17
Y1 - 1999/1/17
N2 - In this paper, we provide a method to increase the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, which is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secondary structures, which are typical structures in RNA sequences. Splicing on trees involves (1) complete subtrees as axioms, (2) restriction operated on the annealed subsequences, (3) rules to substitute a complete subtree with another. We show that splicing systems on trees with finite sets of axioms and finite sets of rules can generate the class of context-free languages without the need of imposing multiplicity constraints.
AB - In this paper, we provide a method to increase the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, which is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secondary structures, which are typical structures in RNA sequences. Splicing on trees involves (1) complete subtrees as axioms, (2) restriction operated on the annealed subsequences, (3) rules to substitute a complete subtree with another. We show that splicing systems on trees with finite sets of axioms and finite sets of rules can generate the class of context-free languages without the need of imposing multiplicity constraints.
KW - Context-free grammer
KW - DNA computer
KW - Splicing system
KW - Tree
UR - http://www.scopus.com/inward/record.url?scp=0348228254&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0348228254&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0348228254
VL - 210
SP - 227
EP - 243
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 2
ER -