Parameterized complexity and approximability of the longest compatible sequence problem (Q456697): Difference between revisions

@@ 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.disopt.2010.08.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2027343828
@@ Property / OpenAlex ID: W2027343828 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Analogs &amp; duals of the MAST problem for sequences &amp; trees
+Normal rank
@@ Property / cites work @@
+Q5471630
@@ Property / cites work: Q5471630 / rank @@
+Normal rank
@@ Property / cites work @@
+The Mathematics of Voting and Elections: A                     Hands-On Approach
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of sequence alignment and consensus
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Q3549698
@@ Property / cites work: Q3549698 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of short computation and factorization
+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 @@
+Q4544433
@@ Property / cites work: Q4544433 / rank @@
+Normal rank