On the Readability of Overlap Digraphs (Q2942251): Difference between revisions

@@ Property / arXiv ID @@
+.04616
@@ Property / arXiv ID: 1504.04616 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414481
@@ Property / cites work: Q4414481 / rank @@
+Normal rank
@@ Property / cites work @@
+On the recognition of de Bruijn graphs and their induced subgraphs
+Normal rank
@@ Property / cites work @@
+On some properties of DNA graphs
@@ Property / cites work: On some properties of DNA graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044315
@@ Property / cites work: Q3044315 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of overlap graphs
@@ Property / cites work: Recognition of overlap graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations for some types of DNA graphs
@@ Property / cites work: Characterizations for some types of DNA graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding on alphabet overlap digraphs
@@ Property / cites work: Embedding on alphabet overlap digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing DNA graphs is difficult.
@@ Property / cites work: Recognizing DNA graphs is difficult. / 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