Listing Center Strings Under the Edit Distance Metric (Q5743548): Difference between revisions

@@ Property / cites work @@
+On the parameterized complexity of the repetition free longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
+Normal rank
@@ Property / cites work @@
+Topology of strings: median string is NP-complete
@@ Property / cites work: Topology of strings: median string is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+On the Closest String via Rank Distance
@@ Property / cites work: On the Closest String via Rank Distance / rank @@
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Distinguishing string selection problems.
@@ Property / cites work: Distinguishing string selection problems. / rank @@
+Normal rank
@@ Property / cites work @@
+On the closest string and substring problems
@@ Property / cites work: On the closest string and substring problems / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Algorithms for Closest String and Substring Problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Closest Substring Problems with Small Distances
@@ Property / cites work: Closest Substring Problems with Small Distances / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results for the center and median string problems under the weighted and unweighted edit distances
+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 @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank