Hairpin Structures in DNA Words
From MaRDI portal
Publication:3618686
DOI10.1007/11753681_12zbMATH Open1234.68216OpenAlexW1553144061MaRDI QIDQ3618686FDOQ3618686
Authors: Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin
Publication date: 2 April 2009
Published in: DNA Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11753681_12
Recommendations
Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Theoretical and experimental DNA computation.
- Title not available (Why is that?)
- Title not available (Why is that?)
- DNA Computing
- DNA Computing
- DNA Computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection and union of regular languages and state complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developments in Language Theory
- Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro
- Sticky-free and overhang-free DNA languages
- Title not available (Why is that?)
- DNA Computing
Cited In (21)
- Watson-Crick Conjugate and Commutative Words
- k-involution codes and related sets
- Aspects of Molecular Computing
- Watson-Crick palindromes in DNA computing
- The syntactic monoid of hairpin-free languages
- Title not available (Why is that?)
- On pseudoknot-bordered words and their properties
- DNA codes from skew dihedral group ring
- Title not available (Why is that?)
- On iterated hairpin completion
- Inner palindromic closure
- Deciding regularity of hairpin completions of regular languages in polynomial time
- A formal language analysis of DNA hairpin structures
- On conflict free DNA codes
- Hairpin structures defined by DNA trajectories
- Testing DNA code words properties of regular languages
- Hairpin Structures Defined by DNA Trajectories
- Developments in Language Theory
- Unravel Four Hairpins!
- Hairpin languages
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
This page was built for publication: Hairpin Structures in DNA Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618686)