Parallel complexity of signed graphs for gene assembly in ciliates
From MaRDI portal
Publication:931445
DOI10.1007/s00500-007-0233-4zbMath1137.92305MaRDI QIDQ931445
Ion Petre, Chang Li, 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
05C90: Applications of graph theory
92C37: Cell biology
92D10: Genetics and epigenetics
05C22: Signed and weighted graphs
Related Items
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