log(n)) algorithm for sorting by reciprocal translocations

An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations

We prove that sorting by reciprocal translocations can be done in O(n p 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(n) algorithm for sorting by reciprocal translocations given by Bergeron et al.

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

Article history: Available online xxxx

Sorting by Reciprocal Translocations via Reversals Theory

The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that transforms, or sorts, one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied pr...

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations

An In-Place Sorting Algorithm Performing O(n log n) Comparisons and O(n) Data Moves

In this paper we give a positive answer to the long-standing problem of finding an in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves in the worst case. So far, the better in-place sorting algorithm with O(n) moves was proposed by Munro and V. Raman. Their algorithm requires O(n) comparisons in the worst case, for any ǫ > 0. Later, Katajainen and Pasanen discovered...