A more efficient algorithm for perfect sorting by reversals (Q963340): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2007.10.012
@@ Property / DOI: 10.1016/j.ipl.2007.10.012 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.10.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2088853706
@@ Property / OpenAlex ID: W2088853706 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting Permutations by Reversals and Eulerian Cycle Decompositions
+Normal rank
@@ Property / cites work @@
+Average-Case Analysis of Perfect Sorting by Reversals
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4679085
@@ Property / cites work: Q4679085 / rank @@
+Normal rank
@@ Property / cites work @@
+Advances on sorting by reversals
@@ Property / cites work: Advances on sorting by reversals / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2007.10.012
@@ Property / DOI: 10.1016/J.IPL.2007.10.012 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:963340