Computation in living cells. Gene assembly in ciliates

zbMath1069.68048MaRDI QIDQ1773223

Ion Petre, Grzegorz Rozenberg, David M. Prescott, Andrzej Ehrenfeucht, Tero J.Harju

Publication date: 26 April 2005

Published in: Natural Computing Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Extended strings and graphs for simple gene assembly, Combining overlap and containment for gene assembly in ciliates, Algorithmic properties of ciliate sequence alignment, Transformations of assembly number for 4-regular graphs, Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax}, Quorum sensing P systems, Parallelism in gene assembly, Maximal pivots on graphs with an application to gene assembly, Sorting by reversals and the theory of 4-regular graphs, Sorting permutations: Games, genomes, and cycles, Recombination faults in gene assembly in ciliates modeled using multimatroids, Graph reductions, binary rank, and pivots in gene assembly, Nullity invariance for pivot and the interlace polynomial, A model for the origin of internal eliminated segments (IESs) and gene rearrangement in stichotrichous ciliates, The group structure of pivot and loop complementation on graphs and set systems, Four-regular graphs with rigid vertices associated to DNA recombination, Sequential vs. Parallel complexity in simple gene assembly, Extending the Overlap Graph for Gene Assembly in Ciliates, Parallel complexity of signed graphs for gene assembly in ciliates, The fibers and range of reduction graphs in ciliates, Equivalence in template-guided recombination, Solutions to computational problems through gene assembly, Strategies of loop recombination in ciliates, Patterns of simple gene assembly in ciliates, Decision problem for shuffled genes, DNA recombination through assembly graphs, Computing the graph-based parallel complexity of gene assembly, Reducibility of gene patterns in ciliates using the breakpoint graph., Rewriting rule chains modeling DNA rearrangement pathways, Simple gene assembly as a rewriting of directed overlap-inclusion graphs, Pivots, determinants, and perfect matchings of graphs, Equivalence in Template-Guided Recombination, Graph theoretic approach to parallel gene assembly, On Computational Properties of Template-Guided DNA Recombination, Simple Operations for Gene Assembly, Quantifying CDS sortability of permutations by strategic pile size, The parallel complexity of signed graphs: Decidability results and an improved algorithm, Minimality in template-guided recombination, Symbol Separation in Double Occurrence Words