Bounded Hairpin Completion
From MaRDI portal
Publication:3618601
DOI10.1007/978-3-642-00982-2_37zbMath1234.68331OpenAlexW2696073070MaRDI QIDQ3618601
Peter Leupold, Victor Mitrana, Masami Ito
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_37
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contextual insertions/deletions and computability
- Deleting string rewriting systems preserve regularity
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On some algorithmic problems regarding the hairpin completion
- Superposition based on Watson-Crick-like complementarity
- SOME REMARKS ON THE HAIRPIN COMPLETION
- Hairpin Completion Versus Hairpin Reduction
- Developments in Language Theory
This page was built for publication: Bounded Hairpin Completion