{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:08Z","timestamp":1725512108983},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_36","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"410-422","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Border Length for DNA Microarray Synthesis"],"prefix":"10.1007","author":[{"given":"Cindy Y.","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fencol C. C.","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proc. 37th FOCS, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"issue":"1\u20132","key":"36_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(99)00324-2","volume":"259","author":"P. Bonizzoni","year":"2001","unstructured":"Bonizzoni, P., Vedova, G.D.: The complexity of multiple sequence alignment with SP-score that is a metric. Theoretical Computer Science\u00a0259(1\u20132), 63\u201379 (2001)","journal-title":"Theoretical Computer Science"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Carvalho Jr., S.A., Rahmann, S.: Improving the layout of oligonucleotide. microarrays: Pivot partitioning. In: Proc. 6th WABI, pp. 321\u2013332 (2006)","DOI":"10.1007\/11851561_30"},{"key":"36_CR4","unstructured":"Carvalho Jr., S.A., Rahmann, S.: Microarray layout as quadratic assignment problem. In: Proc. GCB, pp. 11\u201320 (2006)"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Carvalho Jr., S.A., Rahmann, S.: Improving the design of genechip arrays by combining placement and embedding. In: Proc. 6th CSB, pp. 54\u201363 (2007)","DOI":"10.1142\/9781860948732_0042"},{"key":"36_CR6","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (ND33) (1976)"},{"issue":"1","key":"36_CR7","first-page":"233","volume":"182","author":"D.F. Feng","year":"1987","unstructured":"Feng, D.F., Doolittle, R.F.: Approximation algorithms for multiple sequence alignment. Theoretical Computer Science\u00a0182(1), 233\u2013244 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"4995","key":"36_CR8","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1126\/science.1990438","volume":"251","author":"S. Fodor","year":"1991","unstructured":"Fodor, S., Read, J.L., Pirrung, M.C., Stryer, L., Lu, A.T., Solas, D.: Light-directed, spatially addressable parallel chemical synthesis. Science\u00a0251(4995), 767\u2013773 (1991)","journal-title":"Science"},{"issue":"5","key":"36_CR9","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S0968-0004(99)01382-1","volume":"24","author":"D. Gerhold","year":"1999","unstructured":"Gerhold, D., Rushmore, T., Caskey, C.T.: DNA chips: promising toys have become powerful tools. Trends in Biochemical Sciences\u00a024(5), 168\u2013173 (1999)","journal-title":"Trends in Biochemical Sciences"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.jtbi.2007.05.036","volume":"248","author":"L. G\u0105sieniec","year":"2007","unstructured":"G\u0105sieniec, L., Li, C.Y., Sant, P., Wong, P.W.H.: Randomized probe selection algorithm for microarray design. Journal of Theoretical Biology\u00a0248(3), 512\u2013521 (2007)","journal-title":"Journal of Theoretical Biology"},{"issue":"1","key":"36_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","volume":"55","author":"D. Gusfield","year":"1993","unstructured":"Gusfield, D.: Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology\u00a055(1), 141\u2013154 (1993)","journal-title":"Bulletin of Mathematical Biology"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45713-5_1","volume":"77","author":"S. Hannenhalli","year":"2002","unstructured":"Hannenhalli, S., Hubell, E., Lipshutz, R., Pevzner, P.A.: Combinatorial algorithms for design of DNA arrays. Advances in Biochemical Engineering\/Biotechnology\u00a077, 1\u201319 (2002)","journal-title":"Advances in Biochemical Engineering\/Biotechnology"},{"issue":"6","key":"36_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Communications of the ACM"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1093\/bioinformatics\/18.10.1340","volume":"18","author":"L. Kaderali","year":"2002","unstructured":"Kaderali, L., Schliep, A.: Selecting signature oligonucleotides to identify organisms using DNA arrays. Bioinformatics\u00a018, 1340\u20131349 (2002)","journal-title":"Bioinformatics"},{"issue":"2\/3","key":"36_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1089\/1066527041410391","volume":"11","author":"A.B. Kahng","year":"2004","unstructured":"Kahng, A.B., Mandoiu, I.I., Pevzner, P.A., Reda, S., Zelikovsky, A.: Scalable heuristics for design of DNA probe arrays. Journal of Computational Biology\u00a011(2\/3), 429\u2013447 (2004)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCAD.2005.855940","volume":"25","author":"A.B. Kahng","year":"2006","unstructured":"Kahng, A.B., Mandoiu, I.I., Reda, S., Xu, X., Zelikovsky, A.: Computer-aided optimization of DNA array design and manufacturing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a025(2), 305\u2013320 (2006)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Kasif, S., Weng, Z., Detri, A., Beigel, R., DeLisi, C.: A computational framework for optimal masking in the synthesis of oligonucleotide microarrays. Nucleic Acids Research\u00a030(20), e106 (2002)","DOI":"10.1093\/nar\/gnf105"},{"issue":"11","key":"36_CR18","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1093\/bioinformatics\/17.11.1067","volume":"17","author":"F. Li","year":"2001","unstructured":"Li, F., Stormo, G.: Selection of optimal DNA oligos for gene expression arrays. Bioinformatics\u00a017(11), 1067\u20131076 (2001)","journal-title":"Bioinformatics"},{"issue":"2","key":"36_CR19","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1093\/bioinformatics\/btg1073","volume":"19","author":"S. Rahmann","year":"2003","unstructured":"Rahmann, S.: The shortest common supersequence problem in a microarray production setting. Bioinformatics\u00a019(suppl. 2), 156\u2013161 (2003)","journal-title":"Bioinformatics"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Reinert, K., Lenhof, H.P., Mutzel, P., Mehlhorn, K., Kececioglu, J.D.: A branch-and-cut algorithm for multiple sequence alignment. In: Proc. 1st RECOMB, pp. 241\u2013250 (1997)","DOI":"10.1145\/267521.267845"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Slonim, D.K., Tamayo, P., Mesirov, J.P., Golub, T.R., Lander, E.S.: Class prediction and discovery using gene expression data. In: Proc. 4th RECOMB, pp. 263\u2013272 (2000)","DOI":"10.1145\/332306.332564"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Sung, W.K., Lee, W.H.: Fast and accurate probe selection algorithm for large genomes. In: Proc. 2nd CSB, pp. 65\u201374 (2003)","DOI":"10.1109\/CSB.2003.1227305"},{"issue":"3","key":"36_CR23","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R., Tang, C.Y.: A polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM Journal on Computing\u00a029(3), 761\u2013778 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:20Z","timestamp":1619507660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_36","relation":{},"subject":[]}}