{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:34Z","timestamp":1759063714855,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540395836"},{"type":"electronic","value":"9783540395843"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11851561_30","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T08:49:41Z","timestamp":1158914981000},"page":"321-332","source":"Crossref","is-referenced-by-count":5,"title":["Improving the Layout of Oligonucleotide Microarrays: Pivot Partitioning"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"S\u00e9rgio A.","family":"de Carvalho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1529\/biophysj.104.055343","volume":"89","author":"H. Binder","year":"2005","unstructured":"Binder, H., Preibisch, S.: Specific and nonspecific hybridization of oligonucleotide probes on microarrays. Biophysical Journal\u00a089, 337\u2013352 (2005)","journal-title":"Biophysical Journal"},{"key":"30_CR2","unstructured":"de Carvalho Jr., S., Rahmann, S.: Microarray Layout as a Quadratic Assignment Problem (submitted, 2006)"},{"key":"30_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht (1998)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(76)90140-0","volume":"16","author":"P. Chase","year":"1976","unstructured":"Chase, P.: Subsequence numbers and logarithmic concavity. Discrete Mathematics\u00a016, 123\u2013140 (1976)","journal-title":"Discrete Mathematics"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1126\/science.1990438","volume":"251","author":"S. Fodor","year":"1991","unstructured":"Fodor, S., Read, J., Pirrung, M., Stryer, L., Lu, A., Solas, D.: Light-directed, spatially addressable parallel chemical synthesis. Science\u00a0251, 767\u2013773 (1991)","journal-title":"Science"},{"key":"30_CR6","first-page":"1","volume":"77","author":"S. Hannenhalli","year":"2002","unstructured":"Hannenhalli, S., Hubell, E., Lipshutz, R., Pevzner, P.: Combinatorial algorithms for design of DNA arrays. Advances in Biochemical Engineering \/ Biotechnology\u00a077, 1\u201319 (2002)","journal-title":"Advances in Biochemical Engineering \/ Biotechnology"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-45784-4_34","volume-title":"Algorithms in Bioinformatics","author":"A. Kahng","year":"2002","unstructured":"Kahng, A., Mandoiu, I., Pevzner, P., Reda, S., Zelikovsky, A.: Border Length Minimization in DNA Array Design. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, p. 435. Springer, Heidelberg (2002)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Kahng, A., Mandoiu, I., Pevzner, P., Reda, S., Zelikovsky, A.: Engineering a scalable placement heuristic for DNA probe arrays. In: Proc. 7th Int\u2019l Conf. on Computational Molecular Biology RECOMB 2003, pp. 148\u2013156 (2003)","DOI":"10.1145\/640075.640095"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Kahng, A., Mandoiu, I., Reda, S., Xu, X., Zelikovsky, A.: Evaluation of placement techniques for DNA probe array layout. In: Proc. the IEEE\/ACM Conf. on Computer-Aided Design, pp. 262\u2013269 (2003)","DOI":"10.1109\/ICCAD.2003.159699"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Rahmann, S.: The shortest common supersequence problem in a microarray production setting. In: Proc. 2nd European Conf. on Computational Biology ECCB 2003. Bioinformatics, 19(suppl. 2), ii156\u2013ii161 (2003)","DOI":"10.1093\/bioinformatics\/btg1073"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11851561_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:31:42Z","timestamp":1580297502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11851561_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540395836","9783540395843"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11851561_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}