scientific article; zbMATH DE number 5722790
From MaRDI portal
Publication:3568133
Recommendations
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- Hairpin Structures in DNA Words
- scientific article; zbMATH DE number 1568800
- DNA Coding Using the Subword Closure Operation
- DNA computing, insertion of words and left-symmetric algebras
- STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION
- A formal language analysis of DNA hairpin structures
- DNA origami words and rewriting systems
- DNA origami words, graphical structures and their rewriting systems
Cited in
(25)- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- On some algorithmic problems regarding the hairpin completion
- Word blending in formal languages: the Brangelina effect
- On the overlap assembly of strings and languages
- Superposition based on Watson-Crick-like complementarity
- Iterated hairpin completions of non-crossing words
- 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 Lengthening and Shortening of Regular Languages
- On Some Algorithmic Problems Regarding the Hairpin Completion
- Bounded Hairpin Completion
- Language theoretical properties of hairpin formations
- The pseudopalindromic completion of regular languages
- Two-sided derivatives for regular expressions and for hairpin expressions
- STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION
- Word blending in formal languages
- Further remarks on DNA overlap assembly
- On iterated hairpin completion
- Bounded hairpin completion
- State complexity of overlap assembly
- Formal properties of PA-matching
- A series of algorithmic results related to the iterated hairpin completion
- Hairpin completions and reductions: semilinearity properties
- Hairpin completion distance lower bound
- Deciding regularity of hairpin completions of regular languages in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568133)
