Universal and simple operations for gene assembly in ciliates
Where mathematics, computer science, linguistics and biology meet
How ciliates manipulate their own DNA – A splendid example of natural computing
Natural Computing: an international journal
Formal systems for gene assembly in ciliates
Theoretical Computer Science
String and graph reduction systems for gene assembly in ciliates
Mathematical Structures in Computer Science
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Simple operations for gene assembly
DNA'05 Proceedings of the 11th international conference on DNA Computing
Sequential vs. parallel complexity in simple gene assembly
Theoretical Computer Science
Patterns of simple gene assembly in ciliates
Discrete Applied Mathematics
Extending the Overlap Graph for Gene Assembly in Ciliates
Language and Automata Theory and Applications
Decision problem for shuffled genes
Information and Computation
Three models for gene assembly in ciliates: a comparison
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Complexity measures for gene assembly
KDECB'06 Proceedings of the 1st international conference on Knowledge discovery and emergent complexity in bioinformatics
Directed Overlap-inclusion Graphs as Representations of Ciliate Genes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hi-index | 0.00 |
We investigate in this paper a simple intramolecular model for gene assembly in ciliates. Unlike the general intramolecular model, the folds that a micronuclear chromosome may form to assemble the genes is very restricted (minimal) here: between any two pointers there may be at most one coding block. It has been known that the general model is universal, being able to assemble any gene pattern (to sort any signed permutation). The simple model on the other hand is not universal: there exist signed permutations that cannot be sorted in this model. Remarkably though, all known micronuclear gene patterns in ciliates can indeed be assembled in the simple model. We prove in this paper that while the general model is non-deterministic, the simple model is "weakly deterministic": any gene pattern either has only successful or only unsuccessful sorting strategies. Moreover, although different strategies may lead to different permutations for the same input, these final results have the same structure.