A 1.75-approximation algorithm for unsigned translocation distance (Q2643729): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2007.03.009
+Normal rank
@@ Property / OpenAlex ID @@
+W3026825597
@@ Property / OpenAlex ID: W3026825597 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886096
@@ Property / cites work: Q4886096 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for computing translocation distance between genomes
+Normal rank
@@ Property / cites work @@
+On the complexity of unsigned translocation distance
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234063
@@ Property / cites work: Q4234063 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
+Normal rank
@@ Property / cites work @@
+Genome Rearrangements and Sorting by Reversals
@@ Property / cites work: Genome Rearrangements and Sorting by Reversals / rank @@
+Normal rank
@@ Property / cites work @@
+Comparative genomics. Empirical and analytical approaches to gene order dynamics, map alignment and the evolution of gene families. Papers at the DCAF workshop, Québec, Canada, September 22--25, 2000
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank