Abstract
Here we relate the recent theory of genome rearrangements to the theory of permutation groups in a new way and hope to set the ground for further advances in the area. This work was motivated by the fact that many arguments in genome rearrangements are of the form “look at the figure”, and lack more formal algebraic derivation. We intend to give the area a strong algebraic formalism, much as analytic geometry provided an alternative geometric arguments based on pictures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V. and Pevzner, P. 1995. Sorting by transpositions. In Z. Galil and E. Ukkonen (eds.), Proc. 6th Annual ACM-SIAM Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pp. 614–623. Springer Verlag, New York.
Caprara, A. 1996. Sorting by reversals is difficult. Technical report, DEIS, University of Bologna.
Christie, D. A. 1997. Sorting permutations by block-interchange. Information Processing Letters 60:165–169.
Christie, D. A. 1999. Genome Rearrangement Problems. PhD thesis, Univeristy of Glasgow.
Hannenhalli, S. and Pevzner, P. A. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing, pp. 178–189.
Jacobson, N. 1985. Basic Algebra. W. H. Freeman and Company, New York.
Maclane, S. and Birkhoff, G. 1971. Algebra. The Macmillan Company, London, sixth printing edition.
Meidanis, J. and Setubal, J. C. 1997. Introduction to Computational Molecular Biology. PWS Publishing Co.
Meidanis, J., Walter, M. E., and Dias, Z. 1997a. Distancia de reversao de cromossomos circulares. In Proc. XXIV Seminario Integrado de Software e Hardware — SEMISH’97, pp. 70–79.
Meidanis, J., Walter, M. E., and Dias, Z. 1997b. Transposition distance between a permutation and its reverse. In Proc. 4th South American Workshop on String Processing — WSP’97, pp. 70–79.
Vergara, J. P. 1997. Sorting by Bounded Permutations. PhD thesis, Virginia Polytechnic Institute and State University.
Walter, M. E. 1999. Algoritmos para Problemas em Rearranjo de Genomas. PhD thesis, University of Campinas. In Portuguese.
Walter, M. E., Dias, Z., and Meidanis, J. 1998. Reversal and transposition distance of linear chromosomes. In String Processing and Information Retrieval: A South American Symposium—SPIRE’98. Submitted to Journal of Computational Biology.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Meidanis, J., Dias, Z. (2000). An Alternative Algebraic Formalism for Genome Rearrangements. In: Sankoff, D., Nadeau, J.H. (eds) Comparative Genomics. Computational Biology, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4309-7_20
Download citation
DOI: https://doi.org/10.1007/978-94-011-4309-7_20
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-6584-6
Online ISBN: 978-94-011-4309-7
eBook Packages: Springer Book Archive