{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:27Z","timestamp":1751282847825,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_63","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"740-751","source":"Crossref","is-referenced-by-count":10,"title":["A PTAS for Distinguishing (Sub)string Selection"],"prefix":"10.1007","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zimao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi, Banishing bias from consensus sequences, Proc. 8th Ann. Combinatorial Pattern Matching Conf., pp. 247\u2013261, 1997.","key":"63_CR1","DOI":"10.1007\/3-540-63220-4_63"},{"key":"63_CR2","first-page":"123","volume":"9","author":"J. Dopazo","year":"1993","unstructured":"J. Dopazo, A. Rodr\u00edguez, J. C. S\u00e1iz, and F. Sobrino, Design of primers for PCR amplification of highly variable genomes, CABIOS, 9(1993), 123\u2013125.","journal-title":"CABIOS"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s002240000044","volume":"30","author":"M. Frances","year":"1997","unstructured":"M. Frances, A. Litman, On covering problems of codes, Theor. Comput. Syst., 30(1997), 113\u2013119.","journal-title":"Theor. Comput. Syst."},{"unstructured":"L. Gcasieniec, J. Jansson, and A. Lingas, Efficient approximation algorithms for the Hamming center problem, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. S905\u2013S906, 1999.","key":"63_CR4"},{"doi-asserted-by":"crossref","unstructured":"M. Ito, K. Shimizu, M. Nakanishi, and A. Hashimoto, Polynominal-time algorithms for computing characteristic strings, Proc. 5th Annual Symposium on Combinatorial Pattern Matching, pp. 274\u2013288, (1994).","key":"63_CR5","DOI":"10.1007\/3-540-58094-8_24"},{"key":"63_CR6","first-page":"525","volume":"7","author":"K. Lucas","year":"1991","unstructured":"K. Lucas, M. Busch, S. M\u00f6ssinger and J.A. Thompson, An improved microcomputer program for finding gene-or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes, CABIOS, 7(1991), 525\u2013529.","journal-title":"CABIOS"},{"unstructured":"K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, Distinguishing string selection problems, SODA\u201999, pp. 633\u2013642..","key":"63_CR7"},{"doi-asserted-by":"crossref","unstructured":"Ming Li, Bin Ma,and Lusheng Wang, \u201cFinding similar regions in many strings\u201d, the 31th ACM Symp. on Theory of Computing, pp. 473\u2013482, 1999.","key":"63_CR8","DOI":"10.1145\/301250.301376"},{"doi-asserted-by":"crossref","unstructured":"B. Ma, A polynomial time approximation scheme for the closest substring problem, Proc. 11th Annual Symposium on Combinatorial Pattern Matching, pp. 99\u2013107, Montreal, (2000).","key":"63_CR9","DOI":"10.1007\/3-540-45123-4_10"},{"doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995.","key":"63_CR10","DOI":"10.1017\/CBO9780511814075"},{"doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, FOCS00, pp. 86\u201392, 2000.","key":"63_CR11","DOI":"10.1109\/SFCS.2000.892068"},{"key":"63_CR12","first-page":"253","volume":"12","author":"V. Proutski","year":"1996","unstructured":"V. Proutski and E. C. Holme, Primer Master: a new program for the design and analysis of PCR primers, CABIOS, 12(1996), 253\u2013255.","journal-title":"CABIOS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:27:12Z","timestamp":1737052032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}