Article ID Journal Published Year Pages File Type
431032 Journal of Discrete Algorithms 2011 14 Pages PDF
Abstract

We prove that sorting by reciprocal translocations can be done in O(n3/2log(n)) for an n  -gene genome. Our algorithm is an adaptation of the algorithm of Tannier, Bergeron and Sagot for sorting by reversals. This improves over the O(n3)O(n3) algorithm for sorting by reciprocal translocations given by Bergeron, Mixtacki and Stoye (2006) [4].

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Authors
, ,