Open Access
On the computational power of insertion-deletion systems
Akihiro Takahara,Takashi Yokomori +1 more
- Vol. 2568, pp 269-280
Reads0
Chats0
TLDR
The generative power of insertion-deletion systems (InsDel systems) is investigated, and it is shown that the family INS11DEL11 is equal to the family of recursively enumerable languages.Abstract:
Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems (Kari and Thierrin, 1996; Kari et al., 1997). We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS11 DEL11 is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in Kari et al. (1997) where it was conjectured contrary.read more
Citations
More filters
Proceedings Article
On Minimal Context-Free Insertion-Deletion Systems
TL;DR: It is shown that if the length of the inserted/deleted string is bounded to two, then the obtained systems are not universal and a new complexity measure is introduced for insertion-deletion systems, which permits a better explanation of the obtained results.
Journal ArticleDOI
Computational power of insertion---deletion (P) systems with rules of size two
TL;DR: If context-free insertion and deletion rules of two symbols are used in combination with P systems, then the obtained model is still not computationally complete, but if the insertion and the deletion operations having same size are considered in the distributed framework of P systems then the computational power strictly increases and the obtained models become Computationally complete.
Journal Article
Recent Developments on Insertion-Deletion Systems
TL;DR: The origin of these operations, their formal deflnition and a series of results concerning language properties, decidability and computational completeness of families of languages generated by insertion-deletion systems and their extensions with the graphcontrol.
Journal ArticleDOI
Biological hypercomputation: A new research problem in complexity theory
TL;DR: The meaning and scope of biological hypercomputation BH is discussed that is to be considered as new research problem within the sciences of complexity and the framework here is computational, setting out that life is not a standard Turing Machine.
Journal ArticleDOI
Matrix insertion-deletion systems
Ion Petre,Sergey Verlan +1 more
TL;DR: It is shown that in the case of systems that are not computationally complete (with total size equal to 4), the computational completeness can be obtained by introducing the matrix control and using only binary matrices.
References
More filters
Journal ArticleDOI
DNA computing
TL;DR: The concept of self-assembly, which biological systems have evolved to form such structures as viruses, flagella, and microtubules, can lead the way to using DNA as the basis of nanorobotics.
Journal ArticleDOI
Contextual Insertions/Deletions and Computability
Lila Kari,Gabriel Thierrin +1 more
TL;DR: It is proved that every Turing machine can be simulated by a system based entirely on contextual insertions and deletions and decidability of existence of solutions to equations involving these operations.
Proceedings Article
On Minimal Context-Free Insertion-Deletion Systems
TL;DR: It is shown that if the length of the inserted/deleted string is bounded to two, then the obtained systems are not universal and a new complexity measure is introduced for insertion-deletion systems, which permits a better explanation of the obtained results.
Journal ArticleDOI
Computational power of insertion---deletion (P) systems with rules of size two
TL;DR: If context-free insertion and deletion rules of two symbols are used in combination with P systems, then the obtained model is still not computationally complete, but if the insertion and the deletion operations having same size are considered in the distributed framework of P systems then the computational power strictly increases and the obtained models become Computationally complete.