Skip to main content

Alignment of Optical Maps

  • Conference paper

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

Abstract

We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts and sizing errors present in optical maps are addressed by our alignment score through calculation of corresponding likelihood ratios. The Sizing error model is derived through the application of CLT and validated by residual plots collected from real data. Missing cuts and false cuts are modeled as Bernoulli and Poisson events respectively. This probabilistic framework is used to derive an alignment score through calculation of likelihood ratio. Consequently, this allows to achieve maximal descriminative power for alignment calculation. The proposed scoring method is naturally embedded within a well known DP framework for finding optimal alignments.

Supported by NIH CEGS: Implications of Haplotype Structure in the Human Genome, Grant No. P50 HG002790 and NIH, NHGRI, 2R01 HG00225-10.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bateman, H., Erdelyi, A.: Higher Transcendental Functions, vol. 82. Mc Graw-Hill Book Company, New York (1953)

    Google Scholar 

  2. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing, p. 374. Dover, New York (1972)

    Google Scholar 

  3. Waterman, M.S.: Introduction to Computational Biology, pp. 201–202. Chapman & Hall, Boca Raton (1995)

    MATH  Google Scholar 

  4. Ananthraman, T., Mishra, B., Schwartz, D.C.: Genomics via Optical Mapping II: Ordered Restriction Maps. Journal of Computational Biology 4(2), 91–118 (1997)

    Article  Google Scholar 

  5. Grimmett, G., Stirzaker, D.: Probability and Random Processes. Oxford University Press, Oxford (1982)

    MATH  Google Scholar 

  6. Myers, E.W.: Whole Genome DNA Sequencing Computing in Science and Engineering, pp. 33–43 (1999)

    Google Scholar 

  7. Huang, X., Waterman, M.S.: Dynamic Programming Algorithms for Restriction Map Comparison. CABIOS 8(5), 511–520 (1992)

    Google Scholar 

  8. Antoniotti, M., Ananthraman, T., Paxia, S., Mishra, B.: Genomics via Optical Mapping IV: Sequence Validation via Optical Map Matching. NYU-TR2000-811 (2001)

    Google Scholar 

  9. Ananthraman, T., Mishra, B.: A Probabilistic Analysis of False Positives in Optical Map Alignment and Validation. In: Algorithms in Bioinformatics, First International Workshop, WABI 2001 Proceedings (2001)

    Google Scholar 

  10. Ananthraman, T., Schwartz, D.C., Mishra, B.: Genomics via Optical Mapping III: Contiging Genomic DNA and Variations. In: Proceedings 1th Intl Cnf. on Intelligent Systems for Molecular Biology (1999)

    Google Scholar 

  11. Waterman, M.S., Smith, T.F., Katcher, H.: Algorithms for Restriction Map Comparisons. Nucleic Acids Research 12, 237–242 (1984)

    Article  Google Scholar 

  12. Lim, A., Dimalanta, E.T., Potamousis, K.D., Yen, G., Apodoca, J., Tao, C., Lin, J., Qi, R., Skiadas, J., Ramanathan, A., Perna, N.T., Plunkett III, G., Burland, V., Mau, B., Hackett, J., Blattner, F.R., Ananthraman, T.S., Mishra, B., Schwartz, D.C.: Hotgun optical maps of the whole Escherichia coli O157:H7 genome. Genome Res. 11(9), 1584–1593 (2001)

    Article  Google Scholar 

  13. Schwartz, D.C., Li, X., Hernandez, L.I., Ramnarain, S., Huff, E.J., Wang, Y.K.: Ordered restriction maps of Saccharomyces cerevisiae chromosomes constructed by optical mapping. Science 262(5130), 110–114 (1993)

    Article  Google Scholar 

  14. Myers, E.W., Huang, X.: An O (N 2 log N) restriction map comparison and search algorithm. Bull. Math. Biol. 54(4), 599–618 (1992)

    MATH  Google Scholar 

  15. Huang, X., Madan, A.: CAP3: A DNA Sequence Assembly Program 9(9), 868–877 (1999)

    Google Scholar 

  16. Huang, X., Miller, W.: A time-efficient, linear-space local similarity algorithm 12, 337–357 (1991)

    Google Scholar 

  17. Dimalanta, E.T., Lim, A., Runnheim, R., Lamers, C., Churas, C., Forrest, D.K., de Pablo, J.J., Graham, M.D., Coppersmith, S.N., Schwartz, D.C.: A microfluidic system for large DNA molecule arrays. Anal. Chem. 7, 5293–5301 (2004)

    Article  Google Scholar 

  18. Zhou, S., Kile, A., Bechner, M., Place, M., Kvikstad, E., Deng, W., Wei, J., Severin, J., Runnheim, R., Churas, C., Forrest, D., Dimalanta, E., Lamers, C., Burland, V., Blattner, F., Schwartz, D.: A single molecule approach to bacterial genomic comparisons via Optical Mapping. J. Bacteriol (2004) (in press)

    Google Scholar 

  19. Smith, T.F., Waterman, M.S.: Comparison of biosequences. Adv. Appl. Math. 2, 482–489 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valouev, A. et al. (2005). Alignment of Optical Maps. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds) Research in Computational Molecular Biology. RECOMB 2005. Lecture Notes in Computer Science(), vol 3500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415770_37

Download citation

  • DOI: https://doi.org/10.1007/11415770_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25866-7

  • Online ISBN: 978-3-540-31950-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics