skip to main content
10.1145/369133.369187acmconferencesArticle/Chapter ViewAbstractPublication PagesrecombConference Proceedingsconference-collections
Article

Optimal sequencing by hybridization in rounds

Published:22 April 2001Publication History

ABSTRACT

Sequencing by hybridization (SBH) is a method for reconstructing a sequence over a small finite alphabet from a collection of probes (substrings). Substring queries can be arranged on an array (SBH chip) and then a combinatorial method is used to construct the sequence from its collection of probes. Technological constraints limit the number of substring queries that can be placed on a single SBH chip. We develop an idea of Margaritis and Skiena and propose an algorithm that uses a series of small SBH chips to sequence long strings while the number of probes used matches the information theoretical lower bound up to a constant factor.

References

  1. 1.N. Alon and J. Spencer. The probabilistic method. John Wiley and Sons, 1992.Google ScholarGoogle Scholar
  2. 2.R. Arratia, D. Martin, G. Reinert, and M.S. Waterman. Poisson process approximation for sequence repeats, and sequencing by hybridization. Journal of Computational Biology, 3:425-463, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3.W. Bains and G. C. Smith. A novel method for nucleic acid sequence determination. J. Theor. Biol., 135:303-307, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4.A. Chetverin and F. Cramer. Oligonucleotide arrays: New concepts and possibilities. Bio/Technology, 12:1093-1099, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.R. Drmanac, I. Labat, I. Bruckner, and R. Crkvenjakov. Sequencing of megabase plus DNA by hybridization. Genomics, 4:114-128, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  6. 6.M. Dyer, A. M. Frieze, and S. Suen. The probability of unique solutions of sequencing by hybridization. Journal of Computational Biology, 1:105-110, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.D.E. Knuth. The Art of Computer Programming: Fundamental Algorithms. Addison-Wesley, 1968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Yu.P. Lysov, V.L. Florentiev, A.A. Khorlin, K.R. Khrapko, V.V. Shih, and A.D. Mirzabekov. Sequencing by hybridization via oligonucleotides, a novel method. Dokl. Acad. Sci. USSR, 303:1508-1511, 1998.Google ScholarGoogle Scholar
  9. 9.D. Margaritis and S. S. Skiena. Reconstructing strings from substrings in rounds. In 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 613-620, Los Alamitos, October 1995. IEEE Computer Society Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.P.A.Pevzner. 1-tuple DNA sequencing: Computer analysis. Jour. Biomolecul. Struct. Dynamics, 7,1:63-73, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11.P.A. Pevzner and R.J. Lipshutz. Towards DNA-sequencing by hybridization. In 19th Symp. on Mathem. Found. of Comp. Sci., volume 841 of Lecture Notes in Computer Science, pages 143-158, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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. Journal of Biomolecular Structure and Dynamics, 9(2):399-410, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  13. 13.F. Preparata, A. Frieze, and E. Upfal. Optimal reconstruction of a sequence from its probes. J. Comput'l Biology, 6(3-4):361-368, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.F. P. Preparata and E. Upfal. Sequencing-by-hybridization at the information-theory bound: An optimal algorithm. In Ron Shamir, Satoru Miyano, Sorin Istrail, Pavel Pevzner, and Michael Waterman, editors, Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), pages 245-253, N.Y., April 8-11 2000. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimal sequencing by hybridization in rounds

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              RECOMB '01: Proceedings of the fifth annual international conference on Computational biology
              April 2001
              316 pages
              ISBN:1581133537
              DOI:10.1145/369133
              • Chairman:
              • Thomas Lengauer

              Copyright © 2001 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 22 April 2001

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              RECOMB '01 Paper Acceptance Rate35of128submissions,27%Overall Acceptance Rate148of538submissions,28%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader