Computing the graph-based parallel complexity of gene assembly (Q974100): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.02.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2023124941
@@ Property / OpenAlex ID: W2023124941 / rank @@
+Normal rank
@@ Property / cites work @@
+The parallel complexity of signed graphs: Decidability results and an improved algorithm
+Normal rank
@@ Property / cites work @@
+Formal systems for gene assembly in ciliates.
@@ Property / cites work: Formal systems for gene assembly in ciliates. / rank @@
+Normal rank
@@ Property / cites work @@
+Computation in living cells. Gene assembly in ciliates
+Normal rank
@@ Property / cites work @@
+Q4782120
@@ Property / cites work: Q4782120 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in gene assembly
@@ Property / cites work: Parallelism in gene assembly / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel complexity of signed graphs for gene assembly in ciliates
+Normal rank
@@ Property / cites work @@
+Graph theoretic approach to parallel gene assembly
+Normal rank
@@ Property / cites work @@
+Q3395994
@@ Property / cites work: Q3395994 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941174
@@ Property / cites work: Q4941174 / rank @@
+Normal rank