Variants of constrained longest common subsequence (Q407588): Difference between revisions

@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
+Normal rank
@@ Property / cites work @@
+The longest common subsequence problem revisited
@@ Property / cites work: The longest common subsequence problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Fast linear-space computations of longest common subsequences
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+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 @@
+Repetition-free longest common subsequence
@@ Property / cites work: Repetition-free longest common subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
+Normal rank
@@ Property / cites work @@
+The constrained longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE
@@ Property / cites work: DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE / rank @@
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Constrained LCS: Hardness and Approximation
@@ Property / cites work: Constrained LCS: Hardness and Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank