Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566): Difference between revisions

@@ Property / author @@
+Alexander S. Kulikov
@@ Property / author: Alexander S. Kulikov / rank @@
+Normal rank
@@ 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.1007/978-3-642-38905-4_13
+Normal rank
@@ Property / OpenAlex ID @@
+W194848955
@@ Property / OpenAlex ID: W194848955 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved length bounds for the shortest superstring problem
+Normal rank
@@ Property / cites work @@
+Rotations of Periodic Strings and Short Superstrings
+Normal rank
@@ Property / cites work @@
+An algorithm for the Rural Postman problem on a directed graph
+Normal rank
@@ Property / cites work @@
+Algorithms for Three Versions of the Shortest Common Superstring Problem
+Normal rank
@@ Property / cites work @@
+Parallel and sequential approximation of shortest superstrings
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part II: The Rural Postman Problem
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+The greedy algorithm for shortest superstrings
@@ Property / cites work: The greedy algorithm for shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Lyndon Words and Short Superstrings
@@ Property / cites work: Lyndon Words and Short Superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944967
@@ Property / cites work: Q4944967 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2904788
@@ Property / cites work: Q2904788 / rank @@
+Normal rank
@@ Property / cites work @@
+An Eulerian path approach to DNA fragment assembly
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+Q4296972
@@ Property / cites work: Q4296972 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank