Skip to main content
Conference Proceedings

An easy case of sorting by reversals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1264 83-89
DOI: 10.1007/3-540-63220-4_52
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that sorting by reversals can be performed in polynomial time when the number of breakpoints is twice the distance. This result answers an open question in [KS95J].

Cite

CITATION STYLE

APA

Tran, N. (1997). An easy case of sorting by reversals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1264, pp. 83–89). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free