On Computational Properties of Template-Guided DNA Recombination
From MaRDI portal
Publication:3618678
DOI10.1007/11753681_3zbMath1234.68108OpenAlexW2118829552MaRDI QIDQ3618678
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_3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Some properties of involution codes ⋮ Counting (Watson-Crick) palindromes in Watson-Crick conjugates ⋮ Some properties of related involution palindrome words ⋮ Equivalence in template-guided recombination ⋮ Watson-Crick palindromes in DNA computing ⋮ Some properties of involution palindrome languages ⋮ Equivalence in Template-Guided Recombination ⋮ Watson-Crick Conjugate and Commutative Words ⋮ INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION ⋮ Minimality in template-guided recombination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Template-guided DNA recombination
- Computation in living cells. Gene assembly in ciliates
- Useful templates and iterated template-guided DNA recombination in ciliates
This page was built for publication: On Computational Properties of Template-Guided DNA Recombination
