Skip to main content

Paths and Cycles in Breakpoint Graphs of Random Multichromosomal Genomes

  • Conference paper
Comparative Genomics (RCG 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4205))

Included in the following conference series:

Abstract

We study the probability distribution of genomic distance d under the hypothesis of random gene order. We interpret the random order assumption in terms of a stochastic method for constructing the alternating colour cycles in the decomposition of the bicoloured breakpoint graph. For two random genomes of length n and χ chromosomes, we show that the expectation of n + χd is \(O(\frac{1}{2}\log\frac{n+\chi}{2\chi}+\frac{3}{2}\chi)\). We then discuss how to extend these analyses to the case where intra- and interchromosomal operations have different probabilities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Eriksen, N., Hultman, A.: Estimating the expected reversal distance after a fixed number of reversals. Advances of Applied Mathematics 32, 439–453 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kim, J.H., Wormald, N.C.: Random matchings which induce Hamilton cycles, and Hamiltonian decompositions of random regular graphs. Journal of Combinatorial Theory, Series B 81, 20–44 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Mazowita, M., Haque, L., Sankoff, D.: Stability of rearrangement measures in the comparison of genome sequences. Journal of Computational Biology 13, 554–566 (2006)

    Article  MathSciNet  Google Scholar 

  4. Sankoff, D.: The signal in the genomes. PLoS Computational Biology 2, 35 (2006)

    Article  Google Scholar 

  5. Sankoff, D., Haque, L.: The distribution of genomic distance between random genomes. Journal of Computational Biology 13, 1005–1012 (2006)

    Article  MathSciNet  Google Scholar 

  6. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65, 587–609 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340–3346 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, W., Zheng, C., Sankoff, D. (2006). Paths and Cycles in Breakpoint Graphs of Random Multichromosomal Genomes. In: Bourque, G., El-Mabrouk, N. (eds) Comparative Genomics. RCG 2006. Lecture Notes in Computer Science(), vol 4205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864127_5

Download citation

  • DOI: https://doi.org/10.1007/11864127_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44529-6

  • Online ISBN: 978-3-540-44530-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics