{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:56Z","timestamp":1725492476939},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442110"},{"type":"electronic","value":"9783540457848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_30","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:33:38Z","timestamp":1192545218000},"page":"404-417","source":"Crossref","is-referenced-by-count":3,"title":["Restricting SBH Ambiguity via Restriction Enzymes"],"prefix":"10.1007","author":[{"given":"Steven","family":"Skiena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagi","family":"Snir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"30_CR1","volume-title":"The Theory of Partitions","author":"G. Andrews","year":"1976","unstructured":"G. Andrews. The Theory of Partitions. Addison-Wesley, Reading, Mass., 1976."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1089\/cmb.1996.3.425","volume":"3","author":"R. Arratia","year":"1996","unstructured":"R. Arratia, D. Martin, G. Reinert, and M. Waterman. Poisson process approximation for sequence repeats, and sequencing by hybridization. J. Computational Biology, 3:425\u2013463, 1996.","journal-title":"J. Computational Biology"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0022-5193(88)80246-7","volume":"135","author":"W. Bains","year":"1988","unstructured":"W. Bains and G. Smith. A novel method for nucleic acid sequence determination. J. Theor. Biol., 135:303\u2013307, 1988.","journal-title":"J. Theor. Biol."},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-48452-3_7","volume-title":"On the complexity of positional sequencing by hybridization","author":"A. Ben-Dor","year":"1999","unstructured":"A. Ben-Dor, I. Pe\u2019er, R. Shamir, and R. Sharan. On the complexity of positional sequencing by hybridization. Lecture Notes in Computer Science, 1645:88\u201398, 1999."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1038\/nbt1194-1093","volume":"12","author":"A. Chetverin","year":"1994","unstructured":"A. Chetverin and F. Kramer. Oligonucleotide arrays: New concepts and possibilities. Bio\/Technology, 12:1093\u20131099, 1994.","journal-title":"Bio\/Technology"},{"key":"30_CR6","first-page":"758","volume":"49","author":"N.G. Bruijn","year":"1946","unstructured":"N.G. de Bruijn. A combinatorial problem. Proc. Kon. Ned. Akad. Wetensch, 49:758\u2013764, 1946.","journal-title":"Proc. Kon. Ned. Akad. Wetensch"},{"key":"30_CR7","unstructured":"R. Dramanac and R. Crkvenjakov. DNA sequencing by hybridization. Yugoslav Patent Application 570, 1987."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1126\/science.1990438","volume":"251","author":"S. Fodor","year":"1991","unstructured":"S. Fodor, J. Read, M. Pirrung, L. Stryer, A. Lu, and D. Solas. Light-directed, spatially addressable parallel chemical synthesis. Science, 251:767\u2013773, 1991.","journal-title":"Science"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"A. Frieze and B. Halldorsson. Optimal sequencing by hybridization in rounds. In Proc. Fifth Conf. on Computational Molecular Biology (RECOMB-01), pages 141\u2013148, 2001.","DOI":"10.1145\/369133.369187"},{"key":"30_CR10","volume-title":"Computers and Intractability: A Guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"key":"30_CR11","first-page":"1508","volume":"303","author":"Y. Lysov","year":"1988","unstructured":"Y. Lysov, V. Florentiev, A. Khorlin, K. Khrapko, V. Shik, and A. Mirzabekov. Determination of the nucleotide sequence of dna using hybridization to oligonucleotides. Dokl. Acad. Sci. USSR, 303:1508\u20131511, 1988.","journal-title":"Dokl. Acad. Sci. USSR"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/07391102.1991.10507920","volume":"9","author":"P. Pevzner","year":"1991","unstructured":"P. Pevzner, Y. Lysov, K. Khrapko, A. Belyavski, V. Florentiev, and A. Mizabelkov. Improved chips for sequencing by hybridization. J. Biomolecular Structure & Dynamics, 9:399\u2013410, 1991.","journal-title":"J. Biomolecular Structure & Dynamics"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"P. A. Pevzner and R. J. Lipshutz. Towards DNA sequencing chips. 19th Int. Conf. Mathematical Foundations of Computer Science, 841:143\u2013158, 1994.","DOI":"10.1007\/3-540-58338-6_64"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P.A. Pevzner","year":"1989","unstructured":"P.A. Pevzner. l-tuple DNA sequencing: Computer analysis.J. Biomolecular Structure and Dynamics, 7:63\u201373, 1989.","journal-title":"J. Biomolecular Structure and Dynamics"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1093\/bioinformatics\/17.10.862","volume":"17","author":"V. Phan","year":"2001","unstructured":"V. Phan and S. Skiena. Dealing with errors in interactive sequencing by hybridization. Bioinformatics, 17:862\u2013870, 2001.","journal-title":"Bioinformatics"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and E. Upfal. Sequencing-by-hybridization at the informationtheory bound: An optimal algorithm. In Proc. Fourth Conf. Computational Molecular Biology (RECOMB-00), pages 245\u2013253, 2000.","DOI":"10.1145\/332306.332562"},{"key":"30_CR17","unstructured":"R. Roberts. Rebase: the restriction enzyme database. http:\/\/rebase.neb.com , 2001."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"R. Shamir and D. Tsur. Large scale sequencing by hybridization. In Proc. Fifth International Conf. on Computational Molecular Biology (RECOMB-01), pages 269\u2013277, 2001.","DOI":"10.1145\/369133.369233"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1089\/cmb.1995.2.333","volume":"2","author":"S. Skiena","year":"1995","unstructured":"S. Skiena and G. Sundaram. Reconstructing strings from substrings. J. Computational Biology, 2:333\u2013353, 1995.","journal-title":"J. Computational Biology"},{"key":"30_CR20","unstructured":"S. Snir, E. Yeger-Lotem, B. Chor, and Z. Yakhini. Using restriction enzymes to improve sequencing by hybridization. Technical Report CS-2002-14, Department of Computer Science,The Technion, Haifa, Israel, 2002."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:24:10Z","timestamp":1556915050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}