The constrained shortest common supersequence problem (Q396654): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W32
@@ Property / Mathematics Subject Classification ID: 68W32 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6329900
@@ Property / zbMATH DE Number: 6329900 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+shortest common supersequence
@@ Property / zbMATH Keywords: shortest common supersequence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fixed-parameter algorithms
@@ Property / zbMATH Keywords: fixed-parameter algorithms / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2013.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2092175862
@@ Property / OpenAlex ID: W2092175862 / rank @@
+Normal rank
@@ Property / cites work @@
+Repetition-free longest common subsequence
@@ Property / cites work: Repetition-free longest common subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Variants of constrained longest common subsequence
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Restricted Common Superstring and Restricted Common Supersequence
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut approach to the repetition-free longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+New efficient algorithms for the LCS and constrained LCS problems
+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 @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+Q4166250
@@ Property / cites work: Q4166250 / rank @@
+Normal rank
@@ Property / cites work @@
+The constrained longest common subsequence problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:396654