Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem (Q3196388): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21398-9_20
+Normal rank
@@ Property / OpenAlex ID @@
+W1158677828
@@ Property / OpenAlex ID: W1158677828 / 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 @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Non-breaking Similarity of Genomes with Gene Repetitions
+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 @@
+Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
+Normal rank
@@ Property / cites work @@
+The Algorithm for the Two-Sided Scaffold Filling Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank