An easy case of sorting by reversals
MetadataShow full item record
Journal of computational biology : a journal of computational molecular cell biology. 1998 Winter; 5(4): 741-6.
We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.
Click on the DOI link below to access the article (may not be free).