Parallel complexity of signed graphs for gene assembly in ciliates

DOI10.1007/S00500-007-0233-4MaRDI QIDQ931445zbMATH OpenOpenAlexFDO

Authors Chang Li, Ion Petre, Tero Harju

Publication date 25 June 2008

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-007-0233-4

zbMATH Keywords

parallelismgraph modelgene assembly

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Signed and weighted graphs (05C22) Cell biology (92C37)

Recommendations

• The parallel complexity of signed graphs: Decidability results and an improved algorithm
• 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
• Parallelism in gene assembly

Cited in

(7)

• Graph reductions, binary rank, and pivots in gene assembly
• Sequential vs. Parallel complexity in simple gene assembly
• 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
• Graph Polynomials Motivated by Gene Rearrangements in Ciliates
• REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES

This page was built for publication: Parallel complexity of signed graphs for gene assembly in ciliates

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