{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:41Z","timestamp":1759637681352},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_27","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"265-275","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis"],"prefix":"10.1007","author":[{"given":"Anne","family":"Condon","sequence":"first","affiliation":[]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Thachuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1110\/ps.062591607","volume":"16","author":"J.C. Cox","year":"2007","unstructured":"Cox, J.C., Lape, J., Sayed, M.A., Hellinga, H.W.: Protein Fabrication Automation. Protein Sci.\u00a016(3), 379\u2013390 (2007)","journal-title":"Protein Sci."},{"key":"27_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman Press, New York (1979)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Gibson, D.G., Benders, G.A., Andrews-Pfannkoch, C., Denisova, E.A., Baden-Tillson, H., Zaveri, J., Stockwell, T.B., Brownley, A., Thomas, D.W., Algire, M.A., Merryman, C., Young, L., Noskov, V.N., Glass, J.I., Venter, J.C., Hutchison, I., Clyde, A., Smith, H.O.: Complete Chemical Synthesis, Assembly, and Cloning of a Mycoplasma Genitalium Genome. Science\u00a01151721 (2008)","DOI":"10.1126\/science.1151721"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"10","key":"27_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1093\/nar\/30.10.e43","volume":"30","author":"D.M. Hoover","year":"2002","unstructured":"Hoover, D.M., Lubkowski, J.: DNAWorks: an Automated Method for Designing Oligonucleotides for PCR-based Gene Synthesis. Nuc. Acids Res.\u00a030(10), 43 (2002)","journal-title":"Nuc. Acids Res."},{"issue":"9","key":"27_CR6","doi-asserted-by":"publisher","first-page":"3011","DOI":"10.1093\/nar\/gki614","volume":"33","author":"S. Jayaraj","year":"2005","unstructured":"Jayaraj, S., Reid, R., Santi, D.V.: GeMS: an Advanced Software Package for Designing Synthetic Genes. Nuc. Acids Res.\u00a033(9), 3011\u20133016 (2005)","journal-title":"Nuc. Acids Res."},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/990518.990520","volume":"7","author":"Y.E. Lien","year":"1975","unstructured":"Lien, Y.E.: Periodic Properties of Strings. SIGACT News\u00a07(1), 21\u201325 (1975)","journal-title":"SIGACT News"},{"key":"27_CR8","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a017. Addison-Wesley, Reading (1983)"},{"key":"27_CR9","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A Variant of a Recursively Unsolvable Problem. Bulletin of the American Mathematical Society\u00a052, 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1093\/nar\/gkh401","volume":"32","author":"J.M. Rouillard","year":"2004","unstructured":"Rouillard, J.M., Lee, W., Truan, G., Gao, X., Zhou, X., Gulari, E.: Gene2Oligo: Oligonucleotide Design for in Vitro Gene Synthesis. Nuc. Acids Res.\u00a032, 176\u2013180 (2004) (Web Server issue)","journal-title":"Nuc. Acids Res."},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0378-1119(95)00511-4","volume":"164","author":"W.P. Stemmer","year":"1995","unstructured":"Stemmer, W.P., Crameri, A., Ha, K.D., Brennan, T.M., Heyneker, H.L.: Single-Step Assembly of a Gene and Entire Plasmid from Large Numbers of Oligodeoxyribonucleotides. Gene\u00a0164(1), 49\u201353 (1995)","journal-title":"Gene"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Thachuk, C., Condon, A.: On the Design of Oligos for Gene Synthesis. In: BIBE, pp. 123\u2013130 (2007)","DOI":"10.1109\/BIBE.2007.4375554"},{"issue":"7020","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1038\/nature03151","volume":"432","author":"J. Tian","year":"2004","unstructured":"Tian, J., Gong, H., Sheng, N., Zhou, X., Gulari, E., Gao, X., Church, G.: Accurate Multiplex Gene Synthesis from Programmable DNA Microchips. Nature\u00a0432(7020), 1050\u20131054 (2004)","journal-title":"Nature"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1186\/1471-2105-7-285","volume":"7","author":"A. Villalobos","year":"2006","unstructured":"Villalobos, A., Ness, J.E., Gustafsson, C., Minshull, J., Govindarajan, S.: Gene Designer: a Synthetic Biology Tool for Constructing Artificial DNA Segments. BMC Bioinformatics\u00a07, 285 (2006)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:44:49Z","timestamp":1620002689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}