Parallel Algorithm for Sorting a Signed Permutation by Reversals on MOT Interconnection Network

The problem of sorting a signed permutation by reversals is inspired and motivated by comparative genomics. Following the first polynomial time solution of this problem, several improvements have been published on the subject. The currently fastest algorithms is defined by the sequence augmentation sorting algorithm using balanced binary tree with running time O(n√log n). We give a parallel implementation of the sequence augmentation sorting algorithm on the Mesh of trees architecture.

[1]  Anne Bergeron,et al.  Advances on sorting by reversals , 2007, Discret. Appl. Math..

[2]  Haim Kaplan,et al.  Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals , 2003, CPM.

[3]  David A. Bader,et al.  A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, WADS.

[4]  Kaizhong Zhang,et al.  Algorithmic approaches for genome rearrangement: a review , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[5]  M. Sagot,et al.  Evolution under Reversals: Parsimony and Conservation of Common Intervals , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[6]  Swapnoneel Roy,et al.  Sorting Primitives and Genome Rearrangementin Bioinformatics: A Unified Perspective , 2008 .

[7]  Abdullah N. Arslan.  An algorithm for string edit distance allowing substring reversals , 2006, Sixth IEEE Symposium on BioInformatics and BioEngineering (BIBE'06).

[8]  Enno Ohlebusch,et al.  BMC Bioinformatics BioMed Central Methodology article , 2008 .

[9]  D. Frank Hsu,et al.  Combinatorial properties of mesh of trees , 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

[10]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.