Skip to main content

Segmentation with an Isochore Distribution

  • Conference paper
Algorithms in Bioinformatics (WABI 2006)

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

Included in the following conference series:

  • 863 Accesses

Abstract

We introduce a novel generative probabilistic model for segmentation problems in molecular sequence analysis. All segmentations that satisfy given minimum segment length requirements are equally likely in the model. We show how segmentation-related problems can be solved with similar efficacy as in hidden Markov models. In particular, we show how the best segmentation, as well as posterior segment class probabilities in individual sequence positions can be computed in O(nC) time in case of C segment classes and a sequence of length n.

Work supported by a grant from the Natural Sciences and Engineering Research Council of Canada.

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. Karlin, S.: Statistical signals in bioinformatics. Proc. Nat’l Acad. Sci. USA 102, 13355–13362 (2005)

    Article  Google Scholar 

  2. Li, W., Bernaola-Galván, P., Haghighi, F., Grosse, I.: Applications of recursive segmentation to the analysis of DNA sequences. Comput. Chem. 26, 491–510 (2002)

    Article  Google Scholar 

  3. Mathé, C., Sagot, M.F., Schiex, T., Rouzé, P.: Current methods of gene prediction, their strengths and weaknesses. Nucleic Acids Res. 30, 4103–4117 (2002)

    Article  Google Scholar 

  4. Rabiner, L.R.: A tutorial on Hidden Markov Models and selected applications in speech recognition. Proc. IEEE 77, 257–286 (1989)

    Article  Google Scholar 

  5. Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge University Press, UK (1998)

    Book  MATH  Google Scholar 

  6. Fu, Y.X., Curnow, R.N.: Maximum likelihood estimation of multiple change points. Biometrika 77, 563–573 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Csűrös, M.: Maximum-scoring segment sets. IEEE/ACM Trans. Comput. Biol. Bioinf. 1, 139–150 (2004)

    Article  Google Scholar 

  8. Bernardi, G., Olofsson, B., Filipski, J., Zerial, M., Salinas, J., Cuny, G., Meunier-Rotival, M., Rodier, F.: The mosaic genome of warmblooded vertebrates. Science 228, 953–958 (1985)

    Article  Google Scholar 

  9. Bernardi, G.: Misunderstandings about isochores: Part I. Gene. 276, 3–13 (2001)

    Article  Google Scholar 

  10. IHGSC: Initial sequencing and analysis of the human genome. Nature 409, 860–921 (2001)

    Google Scholar 

  11. Cohen, N., Dagan, T., Stone, L., Graur, D.: GC composition of the human genome: in search of isochores. Mol. Biol. Evol. 22, 1260–1272 (2005)

    Article  Google Scholar 

  12. Clay, O., Bernardi, G.: How not to look for isochores: A reply to Cohen et al. Mol. Biol. Evol. 22, 2315–2317 (2005)

    Article  Google Scholar 

  13. Constantini, M., Clay, O., Auletta, F., Bernardi, G.: An isochore map of the human genome. Genome Res. 16, 536–541 (2006)

    Article  Google Scholar 

  14. Eyre-Walker, A., Hurst, L.D.: The evolution of isochores. Nat. Rev. Genet. 2, 549–555 (2001)

    Article  Google Scholar 

  15. Szpankowski, W., Ren, W., Szpankowski, L.: An optimal DNA segmentation based on the MDL principle. Int. J. Bioinformatics Research and Applications 1, 3–17 (2005)

    Article  Google Scholar 

  16. Barry, D., Hartigan, J.A.: Product partition models for change point problems. Ann. Statist. 20, 260–279 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Auger, I.E., Lawrence, C.E.: Algorithms for the optimal identification of segment neighborhoods. Bull. Math. Biol. 51, 39–54 (1989)

    MATH  MathSciNet  Google Scholar 

  18. Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Statist. 11, 416–431 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  19. Tarnas, C., Hughey, R.: Reduced space hidden markov model training. Bioinformatics 14, 401–406 (1998)

    Article  Google Scholar 

  20. Grimwood, J., et al.: The DNA sequence and biology of human chromosome 19. Nature 428, 529–535 (2004)

    Article  Google Scholar 

  21. Karolchik, D., Baertsch, R., Diekhans, M., Furey, T.S., Hinrichs, A., Lu, Y.T., Roskin, K.M., Schwartz, M., Sugnet, C.W., Thomas, D.J., Weber, R.J., Haussler, D., Kent, W.J.: The UCSC genome browser database. Nucleic Acids Res. 31, 51–54 (2003)

    Article  Google Scholar 

  22. Klein, R.J., Misulovin, Z., Eddy, S.R.: Noncoding RNA genes identified in AT-rich hyperthermophiles. Proc. Nat’l Acad. Sci. USA 99, 7542–7547 (2002)

    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

Csűrös, M., Cheng, MT., Grimm, A., Halawani, A., Landreau, P. (2006). Segmentation with an Isochore Distribution. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_36

Download citation

  • DOI: https://doi.org/10.1007/11851561_36

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39584-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics