text
An easy case of sorting by reversals
SOAR Repository
Login
SOAR Communities
Search the Collection
Information for Authors
WSU Home
SOAR Home
→
Engineering
→
Computer Science
→
CS Faculty Publications
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
.
An easy case of sorting by reversals
Tran, N.
URI:
http://dx.doi.org/10.1089/cmb.1998.5.741
http://hdl.handle.net/10057/4710
Date:
1998
Abstract:
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.
Description:
Click on the DOI link below to access the article (may not be free).
Show full item record
Files in this item
Files
Size
Format
View
There are no files associated with this item.
This item appears in the following Collection(s)
CS Faculty Publications
[10]
Search SOAR
Search SOAR
This Collection
Advanced Search
Browse
All of SOAR
Communities & Collections
By Issue Date
Authors
Titles
Subjects
Type
This Collection
By Issue Date
Authors
Titles
Subjects
Type
My Account
Login
Register
Statistics
View Statistics