Introduction to algorithms
Superposition Based on Watson–Crick-Like Complementarity
Theory of Computing Systems
Hairpin Completion Versus Hairpin Reduction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Language theoretical properties of hairpin formations
Theoretical Computer Science
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
| Hi-index | 0.00 |
The hairpin completion is a natural operation of formal languages which has been inspired by molecular phenomena in biology and by DNA-computing. We consider here a new variant of the hairpin completion, called hairpin lengthening, which seems more appropriate for practical implementation. The variant considered here concerns the lengthening of the word that forms a hairpin structure, such that this structure is preserved, without necessarily completing the hairpin. Although our motivation is based on biological phenomena, the present paper is more about some algorithmic properties of this operation. We prove that the iterated hairpin lengthening of a language recognizable in O(f(n)) time is recognizable in O(n2f(n)) time, while the one-step hairpin lengthening of such a language is recognizable in O(nf(n)) time. Finally, we propose an algorithm for computing the hairpin lengthening distance between two words in quadratic time.