The parallel complexity of signed graphs: Decidability results and an improved algorithm

DOI10.1016/J.TCS.2009.02.028MaRDI QIDQ1019708zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Ion Petre, Vladimir Rogojin

Publication date 4 June 2009

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

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

zbMATH Keywords

algorithmciliatesdecidabilityparallel complexityparallel gene assemblysigned graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Cell biology (92C37) Genetics and epigenetics (92D10)

Recommendations

• Parallel complexity of signed graphs for gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly
• 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

• Computation in living cells. Gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 2156287 (Why is no real title available?)
• scientific article; zbMATH DE number 2156288 (Why is no real title available?)
• Parallel complexity of signed graphs for gene assembly in ciliates
• Parallelism in gene assembly

Cited in

(4)

• Graph theoretic approach to parallel gene assembly
• Graph reductions, binary rank, and pivots in gene assembly
• Parallel complexity of signed graphs for gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly

This page was built for publication: The parallel complexity of signed graphs: Decidability results and an improved algorithm

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