On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and algorithms for plan merging
@@ Property / cites work: Theory and algorithms for plan merging / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of learning strings and sequences
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+The shortest common nonsubsequence problem is NP-complete
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+String Noninclusion Optimization Problems
@@ Property / cites work: String Noninclusion Optimization Problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:673078