Bounded hairpin completion

DOI10.1016/j.ic.2010.11.014zbMath1221.68136OpenAlexW1988320644MaRDI QIDQ553314

Victor Mitrana, Florin Manea, Masami Ito, Peter Leupold

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.014

zbMATH Keywords

DNA computingformal languageshairpin completionbounded hairpin completionbounded hairpin completion distancebounded hairpin reductioniterated bounded hairpin completion

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Hairpin Lengthening and Shortening of Regular Languages ⋮ Hairpin completions and reductions: semilinearity properties ⋮ The pseudopalindromic completion of regular languages ⋮ On iterated hairpin completion ⋮ Deciding regularity of hairpin completions of regular languages in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Combinatorial Queries and Updates on Partial Words
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast Pattern Matching in Strings
• Hairpin Completion Versus Hairpin Reduction
• Developments in Language Theory

This page was built for publication: Bounded hairpin completion