Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497): 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 @@
+Q4250188
@@ Property / cites work: Q4250188 / rank @@
+Normal rank
@@ Property / cites work @@
+A 1.75-approximation algorithm for unsigned translocation distance
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for computing translocation distance between genomes
+Normal rank
@@ Property / cites work @@
+A further improved approximation algorithm for breakpoint graph decomposition
+Normal rank
@@ Property / cites work @@
+Q4234063
@@ Property / cites work: Q4234063 / rank @@
+Normal rank
@@ Property / cites work @@
+On the tightness of the alternating-cycle lower bound for sorting by reversals
+Normal rank
@@ Property / cites work @@
+Q4886096
@@ Property / cites work: Q4886096 / rank @@
+Normal rank
@@ Property / cites work @@
+A new linear time algorithm to compute the genomic distance via the double cut and join distance
+Normal rank
@@ Property / cites work @@
+The Approximability of the Exemplar Breakpoint Distance Problem
+Normal rank
@@ Property / cites work @@
+On the complexity of unsigned translocation distance
+Normal rank