| dc.contributor |
Wichita State University. Department of Computer Science |
en_US |
| dc.contributor.author |
Tran, N. |
en_US |
| dc.date.accessioned |
2012-03-01T21:04:39Z |
|
| dc.date.available |
2012-03-01T21:04:39Z |
|
| dc.date.issued |
1998 |
en_US |
| dc.identifier |
10072088 |
en_US |
| dc.identifier |
9433358 |
en_US |
| dc.identifier.citation |
Journal of computational biology : a journal of computational molecular cell biology. 1998 Winter; 5(4): 741-6. |
en_US |
| dc.identifier.issn |
1066-5277 |
en_US |
| dc.identifier.uri |
http://dx.doi.org/10.1089/cmb.1998.5.741 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/10057/4710 |
|
| dc.description |
Click on the DOI link below to access the article (may not be free). |
en_US |
| dc.description.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. |
en_US |
| dc.format.extent |
741-6 |
en_US |
| dc.language.iso |
eng |
en_US |
| dc.publisher |
Mary Ann Liebert |
en_US |
| dc.relation.ispartofseries |
Journal of computational biology : a journal of computational molecular cell biology |
en_US |
| dc.relation.ispartofseries |
J. Comput. Biol. |
en_US |
| dc.source |
NLM |
en_US |
| dc.subject.mesh |
Gene Rearrangement |
en_US |
| dc.subject.mesh |
Genome |
en_US |
| dc.subject.mesh |
Models, Genetic |
en_US |
| dc.title |
An easy case of sorting by reversals |
en_US |
| dc.type |
Article |
en_US |
| dc.coverage.spacial |
United States |
en_US |
| dc.description.version |
peer reviewed |
en_US |
| dc.rights.holder |
Copyright © Mary Ann Liebert |
en_US |