The following pages link to (Q4224915):
Displaying 16 items.
- On iterated hairpin completion (Q551189) (← links)
- Bounded hairpin completion (Q553314) (← links)
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Large-scale DNA memory based on the nested PCR (Q941691) (← links)
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
- On some algorithmic problems regarding the hairpin completion (Q1026117) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Strand design for biomolecular computation. (Q1853477) (← links)
- A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing (Q2396466) (← links)
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing (Q2455456) (← links)
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (Q3073627) (← links)
- Hairpin Lengthening and Shortening of Regular Languages (Q3166949) (← links)
- Bounded Hairpin Completion (Q3618601) (← links)
- Hairpin completions and reductions: semilinearity properties (Q6095486) (← links)
