Abstract
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on substring queries: Using hybridization experiments, one can determine for each string in a given set of strings, whether the string appears in the target string, and use this information to reconstruct the target string. We study the problem when the queries are performed in rounds, where the queries in each round depend on the answers to the queries in the previous rounds. We give an algorithm that can reconstruct almost all strings of length n using 2 rounds with O(n log α n/log α log α n) queries per round, and an algorithm that uses log\(^{*}_{\alpha}n - \Omega(1)\) rounds with O(n) queries per round, where α is the size of the alphabet.
We also consider a variant of the problem in which for each substring query, the answer is whether the string appears once in the target, appears at least twice in the target, or does not appear in the target. For this problem, we give an algorithm that uses 3 rounds of O(n) queries. In all our algorithms, the lengths of the query strings are Θ(log α n). Our results improve the previous results of Margaritis and Skiena [17] and Frieze and Halldórsson [10].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Location sensitive sequencing of DNA. Technical report, University of Southern California (1998)
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (1992)
Arratia, R., Martin, D., Reinert, G., Waterman, M.S.: Poisson process approximation for sequence repeats, and sequencing by hybridization. J. of Computational Biology 3(3), 425–463 (1996)
Bains, W., Smith, G.C.: A novel method for nucleic acid sequence determination. J. Theor. Biology 135, 303–307 (1988)
Ben-Dor, A., Pe’er, I., Shamir, R., Sharan, R.: On the complexity of positional sequencing by hybridization. J. Theor. Biology 8(4), 88–100 (2001)
Broude, S.D., Sano, T., Smith, C.S., Cantor, C.R.: Enhanced DNA sequencing by hybridization. Proc. Nat. Acad. Sci. USA 91, 3072–3076 (1994)
Drmanac, R., Labat, I., Brukner, I., Crkvenjakov, R.: Sequencing of megabase plus DNA by hybridization: theory of the method. Genomics 4, 114–128 (1989)
Dyer, M.E., Frieze, A.M., Suen, S.: The probability of unique solutions of sequencing by hybridization. J. of Computational Biology 1, 105–110 (1994)
Frieze, A., Preparata, F., Upfal, E.: Optimal reconstruction of a sequence from its probes. J. of Computational Biology 6, 361–368 (1999)
Frieze, M., Halldórsson, B.V.: Optimal sequencing by hybridization in rounds. J. of Computational Biology 9(2), 355–369 (2002)
Halperin, E., Halperin, S., Hartman, T., Shamir, R.: Handling long targets and errors in sequencing by hybridization. In: Proc. 6th Annual International Conference on Computational Molecular Biology (RECOMB 2002), pp. 176–185 (2002)
Hannenhalli, S., Pevzner, P.A., Lewis, H., Skiena, S.: Positional sequencing by hybridization. Computer Applications in the Biosciences 12, 19–24 (1996)
Heath, S.A., Preparata, F.P.: Enhanced sequence reconstruction with DNA microarray application. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 64–74. Springer, Heidelberg (2001)
Heath, S.A., Preparata, F.P., Young, J.: Sequencing by hybridization using direct and reverse cooperating spectra. In: Proc. 6th Annual International Conference on Computational Molecular Biology (RECOMB 2002), pp. 186–193 (2002)
Leong, H.W., Preparata, F.P., Sung, W.K., Willy, H.: On the control of hybridization noise in DNA sequencing-by-hybridization. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 392–403. Springer, Heidelberg (2002)
Lysov, Y., Floretiev, V., Khorlyn, A., Khrapko, K., Shick, V., Mirzabekov, A.: DNA sequencing by hybridization with oligonucleotides. Dokl. Acad. Sci. USSR 303, 1508–1511 (1988)
Margaritis, D., Skiena, S.: Reconstructing strings from substrings in rounds. In: Proc. 36th Symposium on Foundation of Computer Science (FOCS 1995), pp. 613–620 (1995)
Pe’er, I., Arbili, N., Shamir, R.: A computational method for resequencing long dna targets by universal oligonucleotide arrays. Proc. National Academy of Science USA 99, 15497–15500 (2002)
Pe’er, I., Shamir, R.: Spectrum alignment: Efficient resequencing by hybridization. In: Proc. 8th International Conference on Intelligent Systems in Molecular Biology (ISMB 2000), pp. 260–268 (2000)
Pevzner, P.A., Lysov, Y.P., Khrapko, K.R., Belyavsky, A.V., Florentiev, V.L., Mirzabekov, A.D.: Improved chips for sequencing by hybridization. J. Biomolecular Structure and Dynamics 9, 399–410 (1991)
Preparata, F., Upfal, E.: Sequencing by hybridization at the information theory bound: an optimal algorithm. In: Proc. 4th Annual International Conference on Computational Molecular Biology (RECOMB 2000), pp. 88–100 (2000)
Shamir, R., Tsur, D.: Large scale sequencing by hybridization. J. of Computational Biology 9(2), 413–428 (2002)
Skiena, S., Snir, S.: Restricting SBH ambiguity via restriction enzymes. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 404–417. Springer, Heidelberg (2002)
Skiena, S., Sundaram, G.: Reconstructing strings from substrings. J. of Computational Biology 2, 333–353 (1995)
Snir, S., Yeger-Lotem, E., Chor, B., Yakhini, Z.: Using restriction enzymes to improve sequencing by hybridization. Technical Report CS-2002-14, Technion, Haifa, Israel (2002)
Tsur, D.: Bounds for resequencing by hybridization. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 506–516. Springer, Heidelberg (2003) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsur, D. (2003). Sequencing by Hybridization in Few Rounds. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive