Formal Language Tools for Template-Guided DNA Recombination

Authors:
Michael Domaratzki
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, Canada MB R3T 2N2
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 7
Cited 0

Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)

Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Template-guided DNA recombination

Theoretical Computer Science - Descriptional complexity of formal systems
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates

Theory of Computing Systems
Equivalence in template-guided recombination

Natural Computing: an international journal
Solutions to computational problems through gene assembly

DNA13'07 Proceedings of the 13th international conference on DNA computing
On computational properties of template-guided DNA recombination

DNA'05 Proceedings of the 11th international conference on DNA Computing
Iterated TGR languages: membership problem and effective closure properties

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Certain stichotrichous ciliates, single-celled organisms with hair-like structures called cilia, have a well-studied ability to rearrange their DNA during a form of asexual reproduction called conjugation. Ciliates also demonstrate nuclear dualism: each ciliate has both a micronucleus and a macronucleus. The unscrambling of DNA during conjugation occurs when the scrambled version, contained in the micronucleus, is rearranged in a precise way to produce an unscrambled equivalent which forms the macronucleus.