Parallelism in gene assembly
From MaRDI portal
Publication:876864
DOI10.1007/S11047-005-4462-0zbMATH Open1114.68043OpenAlexW1996114635MaRDI QIDQ876864FDOQ876864
Ion Petre, Chang Li, Grzegorz Rozenberg, Tero 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
Recommendations
Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
Cited In (8)
- Title not available (Why is that?)
- Pivots, determinants, and perfect matchings of graphs
- Sequential vs. Parallel complexity in simple gene assembly
- Parallel complexity of signed graphs for gene assembly in ciliates
- Graph theoretic approach to parallel gene assembly
- Computing the graph-based parallel complexity of gene assembly
- The parallel complexity of signed graphs: Decidability results and an improved algorithm
- DNA Computing
This page was built for publication: Parallelism in gene assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876864)