Parallel complexity of signed graphs for gene assembly in ciliates
From MaRDI portal
Publication:931445
DOI10.1007/s00500-007-0233-4zbMath1137.92305OpenAlexW2030891787MaRDI QIDQ931445
Chang Li, Ion Petre, Tero J.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
Applications of graph theory (05C90) Cell biology (92C37) Genetics and epigenetics (92D10) Signed and weighted graphs (05C22)
Related Items (4)
Graph reductions, binary rank, and pivots in gene assembly ⋮ Computing the graph-based parallel complexity of gene assembly ⋮ Graph theoretic approach to parallel gene assembly ⋮ The parallel complexity of signed graphs: Decidability results and an improved algorithm
Cites Work
This page was built for publication: Parallel complexity of signed graphs for gene assembly in ciliates
