Abstract
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 are able to extend this theory to linear chromosomes in a very natural way, and extend the distance formula to the general multichromosomal case, with both linear and circular chromosomes. The resulting distance, which we call algebraic distance here, is very similiar to, but not quite the same as, DCJ distance. We present linear time algorithms to compute it and to sort genomes. We also show how to compute the algebraic distance from the adjacency graph. Some results on more general k-break distances are given, with algebraic distance being 2-break distance under our interpretation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340–3346 (2005)
Lu, C.L., Huang, Y.L., Wang, T.C., Chiu, H.T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics 7, 295 (2006)
Mira, C., Meidanis, J.: Sorting by block-interchanges and signed reversals. In: ITNG 2007, pp. 670–676 (2007)
Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: Proc. SPIRE 2001, pp. 250–253 (2001)
Meidanis, J., Dias, Z.: An Alternative Algebraic Formalism for Genome Rearrangements. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213–223. Kluwer Academic Publishers (2000)
Huang, Y.L., Lu, C.L.: Sorting by reversals, generalized transpositions, and translocations using permutation groups. Journal of Computational Biology 17(5), 685–705 (2010)
Bergeron, A., Mixtacki, J., Stoye, J.: A Unifying View of Genome Rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163–173. Springer, Heidelberg (2006)
Feijão, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, 1318–1329 (2011)
Alekseyev, M., Pevzner, P.: Multi-break rearrangements and chromosomal evolution. Theoretical Computer Science 395(2-3), 193–202 (2008)
Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. Journal of Computational Biology 17(9), 1145–1165 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feijao, P., Meidanis, J. (2012). Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes. In: de Souto, M.C., Kann, M.G. (eds) Advances in Bioinformatics and Computational Biology. BSB 2012. Lecture Notes in Computer Science(), vol 7409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31927-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31927-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31926-6
Online ISBN: 978-3-642-31927-3
eBook Packages: Computer ScienceComputer Science (R0)