Permutation-constrained common string partitions with applications (Q2146123): Difference between revisions

@@ Property / cites work @@
+Sorting by multi-cut rearrangements
@@ Property / cites work: Sorting by multi-cut rearrangements / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting by Transpositions Is Difficult
@@ Property / cites work: Sorting by Transpositions Is Difficult / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals and Eulerian Cycle Decompositions
+Normal rank
@@ Property / cites work @@
+Sorting permutations by block-interchanges
@@ Property / cites work: Sorting permutations by block-interchanges / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Strings by Reversals and by Transpositions
+Normal rank
@@ Property / cites work @@
+The greedy algorithm for the minimum common string partition problem
+Normal rank
@@ Property / cites work @@
+Q5009593
@@ Property / cites work: Q5009593 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum common string partition problem: hardness and approximations
+Normal rank
@@ Property / cites work @@
+Minimum common string partition revisited
@@ Property / cites work: Minimum common string partition revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q5874451
@@ Property / cites work: Q5874451 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Tandem Duplication Distance is NP-Hard
+Normal rank
@@ Property / cites work @@
+APPROXIMATE BLOCK SORTING
@@ Property / cites work: APPROXIMATE BLOCK SORTING / rank @@
+Normal rank