Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes

Algebraic rearrangement theory, as introduced by Meidanis and Dias, focuses on representing the order in which genes appear in chromosomes, and applies to circular chromosomes only. By shifting our attention to genome adjacencies, we introduce the adjacency algebraic theory, extending the original algebraic theory to linear chromosomes in a very natural way, also allowing the original algebraic distance formula to be used to the general multichromosomal case, with both linear and circular chromosomes. The resulting distance, which we call algebraic distance here, is very similar to, but not quite the same as, double-cut-and-join distance. We present linear time algorithms to compute it and to sort genomes. We show how to compute the rearrangement distance from the adjacency graph, for an easier comparison with other rearrangement distances. A thorough discussion on the relationship between the chromosomal and adjacency representation is also given, and we show how all classic rearrangement operations can be modeled using the algebraic theory.

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

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

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

[4]  Chin Lung Lu,et al.  Sorting by Reversals, Generalized Transpositions, and Translocations Using Permutation Groups , 2010, J. Comput. Biol..

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

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

[7]  Jens Stoye,et al.  The Solution Space of Sorting by DCJ , 2010, J. Comput. Biol..

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

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

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

[11]  João Meidanis,et al.  SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.