Computing the graph-based parallel complexity of gene assembly

DOI10.1016/J.TCS.2010.02.007MaRDI QIDQ974100zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Chang Li, Ion Petre

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

signed graphsparallelismalgorithmicsparallel complexitygene assembly

Mathematics Subject Classification ID

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

Recommendations

• The parallel complexity of signed graphs: Decidability results and an improved algorithm
• Parallel complexity of signed graphs for gene assembly in ciliates
• Graph theoretic approach to parallel gene assembly
• Sequential vs. Parallel complexity in simple gene assembly
• Extended strings and graphs for simple gene assembly

Cites work

• scientific article; zbMATH DE number 1836434 (Why is no real title available?)
• scientific article; zbMATH DE number 1408359 (Why is no real title available?)
• Computation in living cells. Gene assembly in ciliates
• Formal systems for gene assembly in ciliates.
• Gene assembly in ciliates. II. Formal frameworks.
• Graph theoretic approach to parallel gene assembly
• Parallel complexity of signed graphs for gene assembly in ciliates
• Parallelism in gene assembly
• The parallel complexity of signed graphs: Decidability results and an improved algorithm

Cited in

(11)

• Graph reductions, binary rank, and pivots in gene assembly
• Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
• 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
• Simple gene assembly as a rewriting of directed overlap-inclusion graphs
• Extended strings and graphs for simple gene assembly
• Calculating Genomic Distances in Parallel Using OpenMP
• Combinatorial Pattern Matching
• DNA Computing
• Gene assembly through cyclic graph decomposition

This page was built for publication: Computing the graph-based parallel complexity of gene assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974100)