Abstract
In 1989, in one of the very first papers on genome rearrangements, Sankoff and Goldstein studied a shuffling distance between circular permutations. An embedding is a representation of two n-element permutations π and σ as labeled points on two concentric circles with n edges connecting element i in π with element i in σ (1 ≤ i ≤ n). We are interested in embeddings with a minimum number of crossing edges (shuffling distance between π and σ). Below we describe the relationship between shuffling distance and sorting circular permutations by transpositions
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
Sankoff, D. and Goldstein, M. 1989. Probabilistic models of genome shuffing. Bulletin of Mathematical Biology 51:117–124.
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
Bafna, V., Beaver, D., Fürer, M., Pevzner, P.A. (2000). Circular Permutations and Genome Shuffling. 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_18
Download citation
DOI: https://doi.org/10.1007/978-94-011-4309-7_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-6584-6
Online ISBN: 978-94-011-4309-7
eBook Packages: Springer Book Archive