Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms in Bioinformatics

WABI 2003: Algorithms in Bioinformatics pp 95–110Cite as

New Algorithm for the Simplified Partial Digest Problem

  • Conference paper

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

Abstract

In the paper, the problem of genome mapping is considered. In particular, the restriction site approach is used for this purpose. A new, efficient algorithm for solving the Simplified Partial Digest Problem is presented. The ideal data as well as data with measurement errors can be handled by this algorithm. An extensive computational experiment proved a clear superiority of the presented algorithm over other existing approaches. In addition, a thorough analysis of the Simplified Partial Digest Problem and a discussion of common experimental errors are given.

The research has been partially supported by a KBN grant.

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

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. Alizadeh, F., Karp, R.M., Weisser, D.K., Zweig, G.: Physical mapping of chromosomes using unique end-probes. Journal of Computational Biology 2, 159–184 (1995)

    Article  Google Scholar 

  2. Bellon, B.: Construction of restriction maps. Comput. Appl. Biol. Sci. 4, 111–115 (1988)

    Google Scholar 

  3. Błażewicz, J., Formanowicz, P., Jaroszewski, M., Kasprzak, M., Markiewicz, W.T.: Construction of DNA restriction maps based on a simplified experiment. Bioinformatics 5, 398–404 (2001)

    Google Scholar 

  4. Chang, W.I., Marr, T.: Personal communication to S. Skiena (1992)

    Google Scholar 

  5. Cieliebak, M., Eidenbenz, S., Penna, P.: Noisy Data Make the Partial Digest Problem NP-hard. Technical Report 381, ETH Zurich, Department of Computer Science (2002)

    Google Scholar 

  6. Dix, T.I., Kieronska, D.H.: Errors between sites in restriction site mapping. Comput. Appl. Biol. Sci. 4, 117–123 (1988)

    Google Scholar 

  7. http://www.ncbi.nlm.nih.gov/GenBank/

  8. Goldstein, L., Waterman, M.S.: Mapping DNA by stochastic relaxation. Adv. Appl. Math. 8, 194–207 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Grigorjev, A.V., Mironov, A.A.: Mapping DNA by stochastic relaxation: a new approach to fragment sizes. Comput. Appl. Biol. Sci. 6, 107–111 (1990)

    Google Scholar 

  10. Pevzner, P.A.: Physical mapping and alternating eulerian cycles in colored graphs. Algorithmica 13, 77–105 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Rosenblatt, J., Seymour, P.: The structure of homeometric sets. SIAM J. Alg. Disc. Math. 3, 343–350 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. Schmitt, W., Waterman, M.S.: Multiple solutions of DNA restriction mapping problem. Adv. Appl. Math. 12, 412–427 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  13. Setubal, J., Meidanis, J.: Introduction to Computational Biology. PWS Publishing Company, Boston (1997)

    Google Scholar 

  14. Skiena, S.S., Smith, W.D., Lemke, P.: Reconstructing sets from interpoint distances. In: Proc. Sixth ACM Symp. Computational Geometry, pp. 332–339 (1990)

    Google Scholar 

  15. Skiena, S.S., Sundaram, G.: A partial digest approach to restriction site mapping. Bulletin of Mathematical Biology 56(2), 275–294 (1994)

    MATH  Google Scholar 

  16. Waterman, M.S.: Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman & Hall, London (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Insitute of Computing Science, Poznań University of Technology, Piotrowo 3a, 60-965, Poznań, Poland

    J. Błażewicz & M. Jaroszewski

  2. Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12, 61-704, Poznań, Poland

    J. Błażewicz & M. Jaroszewski

Authors
  1. J. Błażewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Jaroszewski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Biomathematical Sciences, The Mount Sinai School of Medicine, 10029-6574, New York, NY

    Gary Benson

  2. Institute of Biomedical and Life Sciences, Division of Environmental and Evolutionary Biology, University of Glasgow, G12 8QQ, Glasgow, Scotland

    Roderic D. M. Page

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Błażewicz, J., Jaroszewski, M. (2003). New Algorithm for the Simplified Partial Digest Problem. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39763-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20076-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation