Skip to main content

On the Complexity of Positional Sequencing by Hybridization

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1645))

Included in the following conference series:

Abstract

In sequencing by hybridization (SBH), one has to reconstruct a sequence from its k-long substrings. SBH was proposed as a promising alternative to gel-based DNA sequencing approaches, but in its original form the method is not competitive. Positional SBH is a recently proposed enhancement of SBH in which one has additional information about the possible positions of each substring along the target sequence. We give a linear time algorithm for solving the positional SBH problem when each substring has at most two possible positions. On the other hand, we prove that the problem is NP-complete if each substring has at most three possible positions.

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. L.M. Adleman. Location sensitive sequencing of DNA. Technical report, University of Southern California, 1998.

    Google Scholar 

  2. R. Drmanac amd R. Crkvenjakov, 1987. Yugoslav Patent Application 570.

    Google Scholar 

  3. B. Apsvall, M.F. Plass, and R.E. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8(3):121–123, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  4. W. Bains and G.C. Smith. A novel method for nucleic acid sequence determination. J. Theor. Biology, 135:303–307, 1988.

    Article  Google Scholar 

  5. S.D. Broude, T. Sano, C.S. Smith, and C.R. Cantor. Enhanced DNA sequencing by hybridization. Proc. Nat. Acad. Sci. USA, 91:3072–3076, 1994.

    Google Scholar 

  6. S. Hannenhalli, P. Pevzner, H. Lewis, and S. Skiena. Positional sequencing by hybridization. Computer Applications in the Biosciences, 12:19–24, 1996.

    Google Scholar 

  7. K.R. Khrapko, Yu. P. Lysov, A.A. Khorlyn, V.V. Shick, V.L. Florentiev, and A.D. Mirzabekov. An oligonucleotide hybridization approach to DNA sequencing. FEBS letters, 256:118–122, 1989.

    Article  Google Scholar 

  8. Y. Lysov, V. Floretiev, A. Khorlyn, K. Khrapko, V. Shick, and A. Mirzabekov. DNA sequencing by hybridization with oligonucleotides. Dokl. Acad. Sci. USSR, 303:1508–1511, 1988.

    Google Scholar 

  9. S.C. Macevics, 1989. International Patent Application PS US89 0474 1.

    Google Scholar 

  10. P.A. Pevzner. l-tuple DNA sequencing: computer analysis. J. Biomol. Struct. Dyn., 7: 63–73, 1989.

    Google Scholar 

  11. P.A. Pevzner and R.J. Lipshutz. Towards DNA sequencing chips. In Symposium on Mathematical Foundations of Computer Science, pages 143–158. Springer, 1994. LNCS vol. 841.

    Google Scholar 

  12. P.A. Pevzner, Yu.P. Lysov, K.R. Khrapko, A.V. Belyavsky, V.L. Florentiev, and A.D. Mirzabekov. Improved chips for sequencing by hybridization. J. Biomol. Struct. Dyn., 9:399–410, 1991.

    Article  Google Scholar 

  13. F. Preparata, A. Frieze, and Upfal E. On the power of universal bases in sequencing by hybridization. In Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB’ 99), pages 295–301, 1999.

    Google Scholar 

  14. S.S. Skiena and G. Sundaram. Reconstructing strings from substrings. J.Comput. Biol., 2:333–353, 1995.

    Article  Google Scholar 

  15. E. Southern, 1988. UK Patent Application GB8810400.

    Google Scholar 

  16. E.M. Southern. DNA chips: analysing sequence by hybridization to oligonucleotides on a large scale. Trends in Genetics, 12:110–115, 1996.

    Article  Google Scholar 

  17. E.M. Southern, U. Maskos, and J.K. Elder. Analyzing and comparing nucleic acid sequences by hybridization to arrays of oligonucleotides: evaluation using experimental models. Genomics, 13:1008–1017, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ben-Dor, A., Pe’er, I., Shamir, R., Sharan, R. (1999). On the Complexity of Positional Sequencing by Hybridization. In: Crochemore, M., Paterson, M. (eds) Combinatorial Pattern Matching. CPM 1999. Lecture Notes in Computer Science, vol 1645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48452-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48452-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics