The consensus string problem for a metric is NP-complete (Q876700): Difference between revisions

@@ Property / cites work @@
+Trees, Stars, and Multiple Biological Sequence Alignment
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252402
@@ Property / cites work: Q4252402 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723944
@@ Property / cites work: Q2723944 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient methods for multiple sequence alignment with guaranteed error bounds
+Normal rank
@@ Property / cites work @@
+Mapping the genome
@@ Property / cites work: Mapping the genome / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252342
@@ Property / cites work: Q4252342 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding similar regions in many strings
@@ Property / cites work: Finding similar regions in many strings / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+More on the complexity of common superstring and supersequence problems
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for tree alignment with a given phylogeny
+Normal rank