On sorting unsigned permutations by double-cut-and-joins (Q2377380): Difference between revisions

@@ Property / cites work @@
+Genome Rearrangements and Sorting by Reversals
@@ Property / cites work: Genome Rearrangements and Sorting by Reversals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128896
@@ Property / cites work: Q3128896 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for breakpoint graph decomposition and sorting by reversals
+Normal rank
@@ Property / cites work @@
+Q4250188
@@ Property / cites work: Q4250188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875199
@@ Property / cites work: Q4875199 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
+Normal rank
@@ Property / cites work @@
+A further improved approximation algorithm for breakpoint graph decomposition
+Normal rank
@@ Property / cites work @@
+Vector-valued wavelets with triangular support for method of moments applications
+Normal rank