Superstring Graph: A New Approach for Genome Assembly (Q2830057): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2506121776
@@ Property / OpenAlex ID: W2506121776 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for shortest cyclic cover of strings
+Normal rank
@@ Property / cites work @@
+From Indexing Data Structures to de Bruijn Graphs
@@ Property / cites work: From Indexing Data Structures to de Bruijn Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the all pairs suffix-prefix problem
+Normal rank
@@ Property / cites work @@
+Greedy in Approximation Algorithms
@@ Property / cites work: Greedy in Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944967
@@ Property / cites work: Q4944967 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank