First we present a series of language theoretic results regarding the one-step and iterated hairpin lengthening of languages from different classes of the ...
Jan 3, 2013 · The hairpin completion is a newly introduced operation on formal languages, inspired by biological phenomena and by DNA- computing.
This article proposes an efficient algorithm for the recognition of the iterated hair pin lengthening of a language, and shows how it can be particularized ...
Finally, we propose an algorithm for computing the hairpin lengthening distance between two words in quadratic time. Keywords: DNA computing, hairpin structure, ...
Missing: theoretic | Show results with:theoretic
Details ; Authors: Manea, Florin ; Martín-Vide, Carlos; Mitrana, Victor ; Issue Date: 2013 ; Journal: Journal of Logic and Computation ; ISSN: 0955-792X ; eISSN ...
Hairpin lengthening: language theoretic and algorithmic results. https://doi.org/10.1093/logcom/exs076 ·. Journal: Journal of Logic and Computation, 2013, № 4 ...
638. Datasets. Go Back. Hairpin lengthening: Language theoretic and algorithmic results. Show simple item record. DC Field, Value, Language. dc.contributor.
Hairpin lengthening: Language theoretic and algorithmic results. Article. Aug 2015. Florin Manea · Carlos Martin-Vide · Victor Mitrana.
The main results are: although any finite number of applications of the hairpin lengthening to a regular language may lead to non-regular languages, the ...
Hairpin formations arise in biochemical processes and play an important role in DNA-computing. We study language theoretical properties of hairpin ...