{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:02:26Z","timestamp":1737435746475,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540720300"},{"type":"electronic","value":"9783540720317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72031-7_41","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T14:16:24Z","timestamp":1186323384000},"page":"453-464","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Finding Gene-Specific Probes for DNA Microarrays"],"prefix":"10.1007","author":[{"given":"Mun-Ho","family":"Choi","sequence":"first","affiliation":[]},{"given":"In-Seon","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Seung-Ho","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Hyeong-Seok","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"41_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Navarro, G.: Faster Approximate String Matching. Algorithmica\u00a023(2), 127\u2013158 (1999)","journal-title":"Algorithmica"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, L.-L., Cheung, D., Yiu, S.-M.: Approximate String Matching in DNA Sequences. In: Proc. the 8th International Conference on Database Systems for Advanced Applications, pp. 303\u2013310 (2003)","DOI":"10.1109\/DASFAA.2003.1192395"},{"key":"41_CR3","first-page":"S463","volume":"18","author":"A. Halperin","year":"2006","unstructured":"Halperin, A., Buhot, A., Zhulina, E.B.: On the hybridization isotherms of DNA microarrays: the Langmuir model and its extentions. Journal of Physics: Condensed Matter, 18, S463\u2013S490 (2006)","journal-title":"Journal of Physics: Condensed Matter"},{"issue":"9","key":"41_CR4","doi-asserted-by":"publisher","first-page":"5154","DOI":"10.1128\/AEM.71.9.5154-5162.2005","volume":"71","author":"Z. He","year":"2005","unstructured":"He, Z., et al.: Use of Microarrays with Different Probe Size for Monitoring Gene Expression. Applied and Environmental Microbiology\u00a071(9), 5154\u20135162 (2005)","journal-title":"Applied and Environmental Microbiology"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1038\/86730","volume":"19","author":"T.R. Hughes","year":"2001","unstructured":"Hughes, T.R., Mao, M., et al.: Expression profiling using microarray fabricated by an ink-jet oligonucleotides synthesizer. Nature Biotechnology\u00a019, 342\u2013347 (2001)","journal-title":"Nature Biotechnology"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Hyrr\u00f6, H.: On using two-phase filtering in indexed approximate string matching with application to searching unique oligonucleotides. In: Proc. String Processing and Information Retrieval (SPIRE 2001), pp. 84\u201395 (2001)","DOI":"10.1109\/SPIRE.2001.989742"},{"key":"41_CR7","unstructured":"Hyrr\u00f6, H.: Practical Methods for Approximate String Matching. PhD thesis, Department of Computer Sciences, University of Tampere, Finland (December 2003)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Hyrr\u00f6, H., Fredriksson, J., Navarro, G.: Increased Bit-Parallelism for Approximate and Multiple String Matching. ACM Journal of Experimental Algorithmics\u00a010(2.06) (2005)","DOI":"10.1145\/1064546.1180617"},{"key":"41_CR9","unstructured":"Hyrr\u00f6, H., Juhola, M., Vihinen, M.: On approximate string matching of unique oligonucleotides. In: Proc. the 10th World Congress on Health and Medical Informatics (Medinfo 2001), vol. 10, part 2, pp. 960\u2013964 (2001)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Hyrr\u00f6, H., Juhola, M., Vihinen, M.: Genome-wide selection of unique and valid oligonucleotides. Nucleic Acids Research, 33(13), e115 (2005)","DOI":"10.1093\/nar\/gni110"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Hyrr\u00f6, H., Navarro, G.: A Practical Index for Genome Searching. In: Proc. String Processing and Information Retrieval (SPIRE 2003), pp. 341\u2013349 (2003)","DOI":"10.1007\/978-3-540-39984-1_26"},{"issue":"11","key":"41_CR12","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.D.: Selection of optimal DNA oligos for gene expression array. Bioinformatics\u00a017(11), 1067\u20131076 (2001)","journal-title":"Bioinformatics"},{"issue":"6","key":"41_CR13","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/BF02931546","volume":"49","author":"T. Majtan","year":"2004","unstructured":"Majtan, T., Bukovsk, G., Timko, J.: DNA Microarrays \u2013 Techiques and Applications in Microbial Systems. Folia Microbiologica\u00a049(6), 635\u2013664 (2004)","journal-title":"Folia Microbiologica"},{"issue":"4-5","key":"41_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E. Myers","year":"1994","unstructured":"Myers, E.: A sublinear algorithm for approximate keyword searching. Algorithmica\u00a012(4-5), 345\u2013374 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"41_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM"},{"issue":"1","key":"41_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"41_CR17","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.: A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms\u00a01(1), 205\u2013239 (2000)","journal-title":"Journal of Discrete Algorithms"},{"issue":"8","key":"41_CR18","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1093\/bioinformatics\/bti182","volume":"21","author":"E.K. Nordberg","year":"2005","unstructured":"Nordberg, E.K.: YODA: selecting signature oligonucleotides. Bioinformatics\u00a021(8), 1365\u20131370 (2005)","journal-title":"Bioinformatics"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Rahmann, S.: Rapid large-scale oligonucleotide selection for microarrays. In: Proc. IEEE Computer Society Bioinformatics Conference 2002, vol.\u00a01, pp. 54\u201363 (2002)","DOI":"10.1109\/CSB.2002.1039329"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Rahmann, S.: Fast and sensitive probe selection for DNA chips using jumps in matching statistics. In: Proc. IEEE Computational Systems Bioinformatics, vol.\u00a02, pp. 57\u201364 (2003)","DOI":"10.1109\/CSB.2003.1227304"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Sung, W., Lee, W.: Fast and accurate probe selection algorithm for large genomes. In: Proc. IEEE Computational Systems Bioinformatics, vol.\u00a02, pp. 65\u201374 (2003)","DOI":"10.1109\/CSB.2003.1227305"},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.biophys.32.110601.141800","volume":"33","author":"J. SantaLucia Jr.","year":"2004","unstructured":"SantaLucia Jr., J., Hicks, D.: The Thermodynamics of DNA Structural Motifs. Annual Review of Biophysics and Biomolecular Structure\u00a033, 415\u2013440 (2004)","journal-title":"Annual Review of Biophysics and Biomolecular Structure"},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Finding approximate patterns in strings. Journal of Algorithms\u00a06, 132\u2013137 (1985)","journal-title":"Journal of Algorithms"},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Information and Control\u00a064, 100\u2013118 (1985)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72031-7_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:17:15Z","timestamp":1737346635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72031-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540720300","9783540720317"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72031-7_41","relation":{},"subject":[]}}