Computing the graph-based parallel complexity of gene assembly

DOI10.1016/j.tcs.2010.02.007zbMath1203.68051OpenAlexW2023124941MaRDI QIDQ974100

Chang Li, Ion Petre, Artiom Alhazov

Publication date: 27 May 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.007

zbMATH Keywords

parallelismparallel complexitysigned graphsalgorithmicsgene assembly

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Graph reductions, binary rank, and pivots in gene assembly ⋮ The parallel complexity of signed graphs: Decidability results and an improved algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallelism in gene assembly
• Parallel complexity of signed graphs for gene assembly in ciliates
• Graph theoretic approach to parallel gene assembly
• The parallel complexity of signed graphs: Decidability results and an improved algorithm
• Computation in living cells. Gene assembly in ciliates
• Formal systems for gene assembly in ciliates.