An Easy Case of Sorting by Reversals
Technical Reports (CIS)
We show that sorting by reversals can be performed in polynomial time when the number of breakpoints is twice the distance.
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-96-25.