Parallelism in gene assembly

DOI10.1007/s11047-005-4462-0zbMath1114.68043OpenAlexW1996114635MaRDI QIDQ876864

Ion Petre, Chang Li, Grzegorz Rozenberg, Tero J.Harju

Publication date: 19 April 2007

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

Full work available at URL: https://doi.org/10.1007/s11047-005-4462-0

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (6)

Sequential vs. Parallel complexity in simple gene assembly ⋮ Parallel complexity of signed graphs for gene assembly in ciliates ⋮ Computing the graph-based parallel complexity of gene assembly ⋮ Pivots, determinants, and perfect matchings of graphs ⋮ Graph theoretic approach to parallel gene assembly ⋮ The parallel complexity of signed graphs: Decidability results and an improved algorithm

Cites Work

• Characterizing the micronuclear gene patterns in ciliates
• Computation in living cells. Gene assembly in ciliates
• Formal systems for gene assembly in ciliates.
• DNA Computing
• Unnamed Item

This page was built for publication: Parallelism in gene assembly