Skip to main content
Conference Proceedings

An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4009 LNCS 258-269
DOI: 10.1007/11780441_24
21Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that sorting by reciprocal translocations can be done in O(n 3/2 √log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et, al algorithm for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron et al. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Ozery-Flato, M., & Shamir, R. (2006). An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4009 LNCS, pp. 258–269). Springer Verlag. https://doi.org/10.1007/11780441_24

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