Sorting by Reversals, Generalized Transpositions, and Translocations Using Permutation Groups

In this article, we consider the problem of sorting a linear/circular, multi-chromosomal genome by reversals, block-interchanges (i.e., generalized transpositions), and translocations (including fusions and fissions) where the used operations can be weighted differently, which aims to find a sequence of reversal, block-interchange, and translocation operations such that the sum of these operation weights in the sequence is minimum. It is known that this sorting problem can be solved in polynomial time on the basis of breakpoint graphs, when block-interchanges are weighted 2 (or >or=3) and the others are weighted 1. In this study, we design a novel and easily implemented algorithm for this problem by utilizing the permutation group theory in algebra.

[1]  Andrés Moya,et al.  Genome Rearrangement Distances and Gene Order Phylogeny in γ-Proteobacteria , 2005 .

[2]  J. Rotman.  A First Course in Abstract Algebra , 1995 .

[3]  João Meidanis,et al.  Sorting by Block-Interchanges and Signed Reversals , 2007, Fourth International Conference on Information Technology (ITNG'07).

[4]  Roded Sharan,et al.  A 1.5-approximation algorithm for sorting by transpositions and transreversals , 2004, J. Comput. Syst. Sci..

[5]  P. Pevzner,et al.  Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. , 2003, Genome research.

[6]  Tzvika Hartman,et al.  A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[7]  Chin Lung Lu,et al.  Analysis of circular genome rearrangement by fusions, fissions and block-interchanges , 2006, BMC Bioinformatics.

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

[9]  Pavel A. Pevzner,et al.  Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

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

[12]  Haim Kaplan,et al.  Faster and simpler algorithm for sorting signed permutations by reversals , 1997, SODA '97.

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

[14]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[15]  D. Sankoff,et al.  Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Haim Kaplan,et al.  A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals , 1999, SIAM J. Comput..

[17]  David A. Christie,et al.  Sorting Permutations by Block-Interchanges , 1996, Inf. Process. Lett..

[18]  Chuan Yi Tang,et al.  An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species , 2005, J. Comput. Biol..

[19]  Niklas Eriksen,et al.  (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..

[20]  Z. Dias,et al.  Genome rearrangements distance by fusion, fission, and transposition is easy , 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.

[21]  Sridhar Hannenhalli,et al.  Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..

[22]  Pavel A. Pevzner,et al.  Multi-break rearrangements and chromosomal evolution , 2008, Theor. Comput. Sci..

[23]  Jens Stoye,et al.  On Sorting by Translocations , 2005, RECOMB.

[24]  K. Huang,et al.  Sorting permutations by cut-circularize-linearize-and-paste operations , 2011, BMC Genomics.

[25]  Max A. Alekseyev,et al.  Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes , 2008, J. Comput. Biol..

[26]  Ron Shamir,et al.  An O(n3/2sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations , 2006, CPM.

[27]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[28]  D. Sankoff,et al.  Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[29]  D. Sankoff,et al.  Parametric genome rearrangement. , 1996, Gene.

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

[31]  Ron Shamir,et al.  An O(n3/2sqrt(log(n))) algorithm for sorting by reciprocal translocations , 2011, J. Discrete Algorithms.

[32]  Chuan Yi Tang,et al.  SoRT2: a tool for sorting genomes and reconstructing phylogenetic trees by reversals, generalized transpositions and translocations , 2010, Nucleic Acids Res..

[33]  João Meidanis,et al.  AN ALTERNATIVE ALGEBRAIC FORMALISM FOR GENOME REARRANGEMENTS , 2000 .