{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:27:58Z","timestamp":1725492478407},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_32","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:33:38Z","timestamp":1192530818000},"page":"419-433","source":"Crossref","is-referenced-by-count":1,"title":["Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Bertone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaskar","family":"DasGupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Gerstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yang","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Snyder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1126\/science.287.5461.2185","volume":"287","author":"M. D. Adams","year":"2000","unstructured":"M. D. Adams et al. The genome sequence of Drosophila melanogaster. Science, 287:2185\u20132195, 2000.","journal-title":"Science"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. F. Altschul","year":"1990","unstructured":"S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. A basic local alignment search tool. Journal of Molecular Biology, 215:403\u2013410, 1990.","journal-title":"Journal of Molecular Biology"},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0895480101384347","volume":"15","author":"P. Berman","year":"2002","unstructured":"P. Berman, B. DasGupta, and S. Muthukrishnan. On the exact size of the binary space partitioning of sets of isothetic rectangles with applications. SIAM Journal of Discrete Mathematics, 15 (2): 252\u2013267, 2002.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"32_CR4","unstructured":"P. Berman, B. DasGupta, and S. Muthukrishnan. Slice and dice: A simple, improved approximate tiling recipe. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 455\u2013464, January 2002."},{"key":"32_CR5","unstructured":"P. Berman, B. DasGupta, S. Muthukrishnan, and S. Ramaswami. Improved approximation algorithms for tiling and packing with rectangles. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 427\u2013436, January 2001."},{"key":"32_CR6","unstructured":"P. Bertone, M. Y. Kao, M. Snyder, and M. Gerstein. The maximum sequence tiling problem with applications to DNA microarray design, submitted for journal publication."},{"key":"32_CR7","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. L. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 635\u2013644, January 2002.","DOI":"10.1137\/S0097539701398363"},{"key":"32_CR9","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D. S. Hochbaum","year":"1997","unstructured":"D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA, 1997."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"C. E. Horak, M. C. Mahajan, N. M. Luscombe, M. Gerstein, S. M. Weissman, and M. Snyder. GATA-1 binding sites mapped in the beta-globin locus by using mammalian chip-chip analysis. Proceedings of the National Academy of Sciences of the U.S.A., 995:2924\u20132929, 2002.","DOI":"10.1073\/pnas.052706999"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","volume":"15","author":"International Human Genome Sequencing Consortium","year":"2001","unstructured":"International Human Genome Sequencing Consortium. Initial sequencing and analysis of the human genome. Nature, 15:860\u2013921, 2001.","journal-title":"Nature"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1038\/35054095","volume":"409","author":"V. R. Iyer","year":"2001","unstructured":"V. R. Iyer, C. E. Horak, C. S. Scafe, D. Botstein, M. Snyder, and P. O. Brown. Genomic binding sites of the yeast cell-cycle transcription factors SBF and MBF. Nature, 409:33\u2013538, 2001.","journal-title":"Nature"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/S0168-9525(00)02093-X","volume":"9","author":"J. Jurka","year":"2000","unstructured":"J. Jurka. Repbase Update: a database and an electronic journal of repetitive elements. Trends in Genetics, 9:418\u2013420, 2000.","journal-title":"Trends in Genetics"},{"key":"32_CR14","unstructured":"S. Khanna, S. Muthukrishnan, and M. Paterson. On approximating rectangle tiling and packing. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 384\u2013393, 1998."},{"key":"32_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1007\/3-540-63165-8_216","volume-title":"Efficient array partitioning","author":"S. Khanna","year":"1997","unstructured":"S. Khanna, S. Muthukrishnan, and S. Skiena. Efficient array partitioning. In G. Goos, J. Hartmanis, and J. van Leeuwen, editors, Lecture Notes in Computer Science 1256: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming, 616\u2013626. Springer-Verlag, New York, NY, 1997."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1038\/nbt1296-1675","volume":"14","author":"D. J. Lockhart","year":"1996","unstructured":"D. J. Lockhart, H. Dong, M. C. Byrne, M. T. Follettie, M. V. Gallo, M. S. Chee, M. Mittmann, C. Wang, M. Kobayashi, and H. Horton et al. Expression monitoring by hybridization to high-density oligonucleotide arrays. Nature Biotechnology, 14:1675\u20131680, 1996.","journal-title":"Nature Biotechnology"},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1101\/SQB.1986.051.01.032","volume":"51","author":"K. Mullis","year":"1986","unstructured":"K. Mullis, F. Faloona, S. Scharf, R. Saiki, G. Horn, and H. Erlich. Specific enzymatic amplification of DNA in vitro: the polymerase chain reaction. Cold Spring Harbor Symposium in Quantitative Biology, 51:263\u2013273, 1986.","journal-title":"Cold Spring Harbor Symposium in Quantitative Biology"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan, V. Poosala, and T. Suel. On rectangular partitions in two dimensions: Algorithms, complexity and applications. In Proceedings of the 7th International Conference on Database Theory, 236\u2013256, 1999.","DOI":"10.1007\/3-540-49257-7_16"},{"key":"32_CR19","unstructured":"National Center for Biotechnology Information (NCBI). http:\/\/www.ncbi.nlm.nih.gov , 2002."},{"key":"32_CR20","unstructured":"W. L. Ruzzo and M. Tompa. Linear time algorithm for finding all maximal scoring subsequences. In Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, 234\u2013241, 1999."},{"issue":"7","key":"32_CR21","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1101\/gr.6.7.639","volume":"6","author":"D. D. Shalon","year":"1996","unstructured":"D. D. Shalon and P. O. B. S. J. Smith. A DNA microarray system for analyzing complex DNA samples using two-color fluorescent probe hybridization. Genome Research, 6(7):639\u2013645, July 1996.","journal-title":"Genome Research"},{"key":"32_CR22","unstructured":"A. F. A. Smit and P. Green. RepeatMasker, repeatmasker.genome.washington.edu, 2002."},{"key":"32_CR23","unstructured":"A. Smith and S. Suri. Rectangular tiling in multi-dimensional arrays. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 786\u2013794, 1999."},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. F. Smith","year":"1981","unstructured":"T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195\u2013197, 1981.","journal-title":"Journal of Molecular Biology"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1038\/35048692","volume":"408","author":"The Arabidipsis Genome Initiative","year":"2000","unstructured":"The Arabidipsis Genome Initiative. Analysis of the genome sequence of the flowering plant arabidopsis thaliana. Nature, 408:796\u2013815, 2000.","journal-title":"Nature"},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1126\/science.282.5396.2012","volume":"282","author":"The C. elegans Sequencing Consortium","year":"1998","unstructured":"The C. elegans Sequencing Consortium. Genome sequence of the nematode c. elegans: a platform for investigating biology. Science, 282:2012\u20132018, 1998.","journal-title":"Science"},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"J. C. Venter","year":"2001","unstructured":"J. C. Venter et al. The sequence of the human genome. Science, 291:1304\u20131351, 2001.","journal-title":"Science"},{"issue":"2","key":"32_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1089\/cmb.1998.5.197","volume":"5","author":"Z. Zhang","year":"1998","unstructured":"Z. Zhang, P. Berman, and W. Miller. Alignments without low-scoring regions. Journal of Computational Biology, 5(2):197\u2013210, 1998.","journal-title":"Journal of Computational Biology"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:24:12Z","timestamp":1556900652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}