Bounded hairpin completion

DOI10.1016/J.IC.2010.11.014MaRDI QIDQ553314zbMATH OpenOpenAlexFDO

Authors Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana

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

bounded hairpin completionbounded hairpin completion distancebounded hairpin reductionDNA computingformal languageshairpin completioniterated bounded hairpin completion

Mathematics Subject Classification ID

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

Recommendations

• Bounded Hairpin Completion
• On the hairpin incompletion
• scientific article; zbMATH DE number 5722790
• On the iterated hairpin completion
• On iterated hairpin completion

Cites work

• Combinatorial Queries and Updates on Partial Words
• Contextual insertions/deletions and computability
• Deleting string rewriting systems preserve regularity
• Developments in Language Theory
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast Pattern Matching in Strings
• Hairpin Completion Versus Hairpin Reduction
• scientific article; zbMATH DE number 3569864 (Why is no real title available?)
• scientific article; zbMATH DE number 1241377 (Why is no real title available?)
• scientific article; zbMATH DE number 3438420 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3307580 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On some algorithmic problems regarding the hairpin completion
• Some remarks on the hairpin completion
• Superposition based on Watson-Crick-like complementarity
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

Cited in

(12)

• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• On the hairpin incompletion
• Hairpin Lengthening and Shortening of Regular Languages
• Hairpin completion with bounded stem-loop
• Hairpin lengthening: language theoretic and algorithmic results
• Bounded Hairpin Completion
• The pseudopalindromic completion of regular languages
• Hairpin Completion Versus Hairpin Reduction
• On iterated hairpin completion
• Hairpin completions and reductions: semilinearity properties
• Deciding regularity of hairpin completions of regular languages in polynomial time
• Self-assembly of strings and languages revisited: efficiently deciding closure under self-assembly

This page was built for publication: Bounded hairpin completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553314)