Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling (Q4632180): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-39817-4_15
+Normal rank
@@ Property / OpenAlex ID @@
+W2476177376
@@ Property / OpenAlex ID: W2476177376 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Comparing Genomes with Duplicates
+Normal rank
@@ Property / cites work @@
+The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
+Normal rank
@@ Property / cites work @@
+Q4828999
@@ Property / cites work: Q4828999 / rank @@
+Normal rank
@@ Property / cites work @@
+On the inapproximability of the exemplar conserved interval distance problem of genomes
+Normal rank
@@ Property / cites work @@
+The Approximability of the Exemplar Breakpoint Distance Problem
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy path-merging algorithm for contig scaffolding
+Normal rank
@@ Property / cites work @@
+Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
+Normal rank
@@ Property / cites work @@
+The Algorithm for the Two-Sided Scaffold Filling Problem
+Normal rank
@@ Property / cites work @@
+Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
+Normal rank
@@ Property / cites work @@
+On the complexity of unsigned translocation distance
+Normal rank