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

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6094032
@@ Property / DOI @@
-.1016/j.disopt.2010.08.003
@@ Property / DOI: 10.1016/j.disopt.2010.08.003 / rank @@
-Normal rank
@@ Property / author @@
+Sylvain Guillemot
@@ Property / author: Sylvain Guillemot / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / 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 NP-completeness for problems of bounded width: hardness for the W hierarchy (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
@@ Property / DOI @@
+.1016/J.DISOPT.2010.08.003
@@ Property / DOI: 10.1016/J.DISOPT.2010.08.003 / rank @@
+Normal rank
@@ Property / Recommended article @@
+On the parameterized complexity of the repetition free longest common subsequence problem
+Normal rank
+Similarity Score: 0.91765326Amount 0.91765326
Unit 1
-Amount
+.91765326
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q4918894
@@ Property / Recommended article: Q4918894 / rank @@
+Normal rank
@@ Property / Recommended article: Q4918894 / qualifier @@
+Similarity Score: 0.9019977Amount 0.9019977
Unit 1
-Amount
+.9019977
 Unit
@@ Property / Recommended article: Q4918894 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
+Similarity Score: 0.89602304Amount 0.89602304
Unit 1
-Amount
+.89602304
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the longest common parameterized subsequence
+Normal rank
+Similarity Score: 0.8931859Amount 0.8931859
Unit 1
-Amount
+.8931859
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+On the Longest Common Parameterized Subsequence
+Normal rank
+Similarity Score: 0.8931859Amount 0.8931859
Unit 1
-Amount
+.8931859
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Lower Bounds and Parameterized Approach for Longest Common Subsequence
+Normal rank
+Similarity Score: 0.8931233Amount 0.8931233
Unit 1
-Amount
+.8931233
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Algorithms for Computing the Longest Parameterized Common Subsequence
+Normal rank
+Similarity Score: 0.889865Amount 0.889865
Unit 1
-Amount
+.889865
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q6098785
@@ Property / Recommended article: Q6098785 / rank @@
+Normal rank
@@ Property / Recommended article: Q6098785 / qualifier @@
+Similarity Score: 0.88536876Amount 0.88536876
Unit 1
-Amount
+.88536876
 Unit
@@ Property / Recommended article: Q6098785 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Exact algorithms for the repetition-bounded longest common subsequence problem
+Normal rank
+Similarity Score: 0.88474417Amount 0.88474417
Unit 1
-Amount
+.88474417
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The parameterized complexity of sequence alignment and consensus
+Normal rank
+Similarity Score: 0.8785345Amount 0.8785345
Unit 1
-Amount
+.8785345
 Unit
+Recommender Run: Recommender Run 3