Iterated Hairpin Completions of Non-crossing Words
From MaRDI portal
Publication:2891380
DOI10.1007/978-3-642-27660-6_28zbMath1302.68167arXiv1110.0760OpenAlexW1651078702MaRDI QIDQ2891380
Steffen Kopecki, Lila Kari, Shinnosuke Seki
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.0760
Related Items (3)
Iterated Hairpin Completions of Non-crossing Words ⋮ The pseudopalindromic completion of regular languages ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On iterated hairpin completion
- A series of algorithmic results related to the iterated hairpin completion
- DNA sequence design using templates
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On some algorithmic problems regarding the hairpin completion
- Iterated Hairpin Completions of Non-crossing Words
- SOME REMARKS ON THE HAIRPIN COMPLETION
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
- On the Regularity of Iterated Hairpin Completion of a Single Word
- HAIRPIN LANGUAGES
- Hairpin Completion Versus Hairpin Reduction
- DNA Computing
This page was built for publication: Iterated Hairpin Completions of Non-crossing Words
