Discrete Applied Mathematics
Handbook of Formal Languages
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
Natural Computing: an international journal
Decision problem for shuffled genes
Information and Computation
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
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
State complexity of chop operations on unary and finite languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
Ciliates are unicellular organisms, some of which perform complicated rearrangements of their DNA. Template-guided recombination (TGR) is a formal model for the DNA recombination which occurs in ciliates. TGR has been the subject of much research in formal language theory, as it can be viewed as an operation on formal languages. In TGR, a set of templates serves as a parameter to a language operation which controls which rearrangements can take place; thus, a set of templates is itself a language. Recently, the concept of equivalence in TGR has been considered: given two sets of templates, do they define the same language operation? This paper considers the related question of minimality: given a set of templates T, what is the smallest set of templates (with respect to inclusion) equivalent to T? We show that the minimal set of templates is unique, and consider closure properties and decidability questions related to minimality. We define an operational characterization for equivalence which is useful for results on minimality.