Minimality in template-guided recombination
From MaRDI portal
Publication:1041038
DOI10.1016/j.ic.2009.02.009zbMath1192.68274OpenAlexW1973178331MaRDI QIDQ1041038
Publication date: 27 November 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.009
Related Items (4)
The chop of languages ⋮ Equations in the Partial Semigroup of Words with Overlapping Products ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ State Complexity of Overlap Assembly
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence in template-guided recombination
- Solutions to computational problems through gene assembly
- Decision problem for shuffled genes
- Simple splicing systems
- Template-guided DNA recombination
- Computation in living cells. Gene assembly in ciliates
- Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates
- RNA-guided DNA assembly
- Useful templates and iterated template-guided DNA recombination in ciliates
- INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION
- Generalized periodicity and primitivity for words
- Iterated TGR Languages: Membership Problem and Effective Closure Properties
- On Computational Properties of Template-Guided DNA Recombination
- COVERS FROM TEMPLATES
- Developments in Language Theory
- Formal Reductions of the General Combinatorial Decision Problem
This page was built for publication: Minimality in template-guided recombination
