Longest common subsequence problem for unoriented and cyclic strings (Q868937): Difference between revisions

@@ Property / cites work @@
+Q4509227
@@ Property / cites work: Q4509227 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+An \(O(ND)\) difference algorithm and its variations
+Normal rank
@@ Property / cites work @@
+A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
+Normal rank
@@ Property / cites work @@
+On a cyclic string-to-string correction problem
@@ Property / cites work: On a cyclic string-to-string correction problem / rank @@
+Normal rank
@@ Property / cites work @@
+All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
+Normal rank
@@ Property / cites work @@
+Incremental String Comparison
@@ Property / cites work: Incremental String Comparison / rank @@
+Normal rank
@@ Property / cites work @@
+The string merging problem
@@ Property / cites work: The string merging problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of sequence alignment and consensus
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+More on the complexity of common superstring and supersequence problems
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Towards optimal lower bounds for clique and chromatic number.
+Normal rank
@@ Property / cites work @@
+Q4341774
@@ Property / cites work: Q4341774 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate coloring of uniform hypergraphs
@@ Property / cites work: Approximate coloring of uniform hypergraphs / rank @@
+Normal rank