On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of sequence alignment and consensus
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank