[PDF][PDF] DNA Computing-Foundations and Implications.
DNA computing is an area of natural computing based on the idea that molecular biology
processes can be used to perform arithmetic and logic operations on information encoded …
processes can be used to perform arithmetic and logic operations on information encoded …
Watson–Crick palindromes in DNA computing
L Kari, K Mahalingam - Natural Computing, 2010 - Springer
This paper provides an overview of existing approaches to encoding information on DNA
strands for biocomputing, with a focus on the notion of Watson–Crick (WK) palindromes. We …
strands for biocomputing, with a focus on the notion of Watson–Crick (WK) palindromes. We …
On iterated hairpin completion
S Kopecki - Theoretical Computer Science, 2011 - Elsevier
Abstract (Bounded) hairpin completion and its iterated versions are operations on formal
languages which have been inspired by hairpin formation in DNA biochemistry. The paper …
languages which have been inspired by hairpin formation in DNA biochemistry. The paper …
Faster algorithms for computing the hairpin completion distance and minimum ancestor
I Boneh, D Fried, A Miclăuş… - 34th Annual Symposium on …, 2023 - drops.dagstuhl.de
Hairpin completion is an operation on formal languages that has been inspired by hairpin
formation in DNA biochemistry and has many applications especially in DNA computing …
formation in DNA biochemistry and has many applications especially in DNA computing …
On pseudoknot-bordered words and their properties
L Kari, S Seki - Journal of Computer and System Sciences, 2009 - Elsevier
We study a generalization of the classical notions of bordered and unbordered words,
motivated by biomolecular computing. DNA strands can be viewed as finite strings over the …
motivated by biomolecular computing. DNA strands can be viewed as finite strings over the …
On the hairpin completion of regular languages
The hairpin completion is a natural operation of formal languages which has been inspired
by molecular phenomena in biology and by DNA-computing. The hairpin completion of a …
by molecular phenomena in biology and by DNA-computing. The hairpin completion of a …
Semigroup theory of symmetry
VR Rosenfeld, TE Nordahl - Journal of Mathematical Chemistry, 2016 - Springer
Symmetry is one of the most fundamental concepts of all nature. We discuss the general
theory of symmetry based on theory of semigroups. This includes and extends the theory of …
theory of symmetry based on theory of semigroups. This includes and extends the theory of …
Hairpin completion distance lower bound
Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an
operation applied to strings, particularly useful in DNA computing. Conceptually, a right …
operation applied to strings, particularly useful in DNA computing. Conceptually, a right …
Complexity results and the growths of hairpin completions of regular languages
V Diekert, S Kopecki - … Conference on Implementation and Application of …, 2010 - Springer
The hairpin completion is a natural operation on formal languages which has been inspired
by molecular phenomena in biology and by DNA-computing. In 2009 we presented in 6 a …
by molecular phenomena in biology and by DNA-computing. In 2009 we presented in 6 a …
[HTML][HTML] Deciding regularity of hairpin completions of regular languages in polynomial time
Hairpin completion is an operation on formal languages that has been inspired by hairpin
formation in DNA biochemistry and by DNA computing. In this paper we investigate the one …
formation in DNA biochemistry and by DNA computing. In this paper we investigate the one …