{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:38Z","timestamp":1746331418221,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_11","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"100-109","source":"Crossref","is-referenced-by-count":0,"title":["Randomized and Parameterized Algorithms for the Closest String Problem"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","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","reference":[{"issue":"8","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1089\/cmb.2009.0098","volume":"16","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. Journal of Computational Biology\u00a016(8), 1085\u20131099 (2009)","journal-title":"Journal of Computational Biology"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-00727-9_15","volume-title":"Bioinformatics and Computational Biology","author":"C. Boucher","year":"2009","unstructured":"Boucher, C., Brown, D.G.: Detecting motifs in a large data set: Applying probabilistic insights to motif finding. In: Rajasekaran, S. (ed.) BICoB 2009. LNCS, vol.\u00a05462, pp. 139\u2013150. Springer, Heidelberg (2009)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-63220-4_63","volume-title":"Combinatorial Pattern Matching","author":"A. Ben-Dor","year":"1997","unstructured":"Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 247\u2013261. Springer, Heidelberg (1997)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcss.2011.01.003","volume":"78","author":"Z.-Z. Chen","year":"2012","unstructured":"Chen, Z.-Z., Ma, B., Wang, L.: A three-string approach to the closest string problem. Journal of Computer and System Sciences\u00a078, 164\u2013178 (2012)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCBB.2011.21","volume":"8","author":"Z.-Z. Chen","year":"2011","unstructured":"Chen, Z.-Z., Wang, L.: Fast exact algorithms for the closest string and substring problems with application to the planted (\u2113,d)-motif model. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a08(5), 1400\u20131410 (2011)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Davila, J., Balla, S., Rajasekaran, S.: Space and time efficient algorithms for planted motif search. In: Proc. of the International Conference on Computational Science, pp. 822\u2013829 (2006)","DOI":"10.1007\/11758525_110"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X. Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM J. Comput.\u00a032(4), 1073\u20131090 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR8","first-page":"123","volume":"9","author":"J. Dopazo","year":"1993","unstructured":"Dopazo, J., Rodr\u00edguez, A., S\u00e1iz, J.C., Sobrino, F.: Design of primers for PCR amplification of highly variable genomes. CABIOS\u00a09, 123\u2013125 (1993)","journal-title":"CABIOS"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Evans, P.A., Smith, A.D.: Complexity of approximating closest substring problems. In: Proc. of the 14th International Symposium on Foundations of Complexity Theory, pp. 210\u2013221 (2003)","DOI":"10.1007\/978-3-540-45077-1_20"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00493-006-0011-4","volume":"26","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica\u00a026(2), 141\u2013167 (2006)","journal-title":"Combinatorica"},{"key":"11_CR11","first-page":"113","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theoret. Comput. Sci.\u00a030, 113\u2013119 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-45077-1_19","volume-title":"Fundamentals of Computation Theory","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 195\u2013209. Springer, Heidelberg (2003)"},{"key":"11_CR13","unstructured":"Gramm, J., H\u00fcffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. In: Florea, L., et al (eds.), Currents in Computational Molecular Biology. Poster Abstracts of RECOMB 2002, pp. 74\u201375 (2002)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica\u00a037, 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-15294-8_27","volume-title":"Algorithms in Bioinformatics","author":"F. Hufsky","year":"2010","unstructured":"Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., B\u00f6cker, S.: Swiftly computing center strings. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol.\u00a06293, pp. 325\u2013336. Springer, Heidelberg (2010)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-27801-6_10","volume-title":"Combinatorial Pattern Matching","author":"Y. Jiao","year":"2004","unstructured":"Jiao, Y., Xu, J., Li, M.: On the k-closest substring and k-consensus pattern problems. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 130\u2013144. Springer, Heidelberg (2004)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"K. Lanctot","year":"2003","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string search problems. Inform. and Comput.\u00a0185, 41\u201355 (2003)","journal-title":"Inform. and Comput."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. ACM\u00a049(2), 157\u2013171 (2002)","journal-title":"J. ACM"},{"key":"11_CR19","first-page":"525","volume":"7","author":"K. Lucas","year":"1991","unstructured":"Lucas, K., Busch, M., M\u00f6singer, S., Thompson, J.A.: An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes. CABIOS\u00a07, 525\u2013529 (1991)","journal-title":"CABIOS"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B. Ma","year":"2010","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput.\u00a039(4), 1432\u20131443 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/060673898","volume":"38","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Closest substring problems with small distances. SIAM J. Comput.\u00a038(4), 1382\u20131410 (2008)","journal-title":"SIAM J. Comput."},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-33293-7_2","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2012","unstructured":"Marx, D.: Randomized techniques for parameterized algorithms. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, p. 2. Springer, Heidelberg (2012)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proc. of the 2nd IEEE Computer Society Bioinformatics Conference (CSB), pp. 560\u2013561 (2003)","DOI":"10.1109\/CSB.2003.1227407"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal solutions for the closest-string problem via integer programming. INFORMS J. Comput. (2004)","DOI":"10.1287\/ijoc.1040.0090"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-44888-8_23","volume-title":"Combinatorial Pattern Matching","author":"F. Nicolas","year":"2003","unstructured":"Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 315\u2013327. Springer, Heidelberg (2003)"},{"key":"11_CR26","first-page":"253","volume":"12","author":"V. Proutski","year":"1996","unstructured":"Proutski, V., Holme, E.C.: Primer master: A new program for the design and analysis of PCR primers. CABIOS\u00a012, 253\u2013255 (1996)","journal-title":"CABIOS"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-63307-3_53","volume-title":"Algorithms and Data Structures","author":"N. Stojanovic","year":"1997","unstructured":"Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 126\u2013135. Springer, Heidelberg (1997)"},{"issue":"5","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0219720005001508","volume":"3","author":"L. Wang","year":"2005","unstructured":"Wang, L., Dong, L.: Randomized algorithms for motif detection. J. Bioinform. Comput. Biol.\u00a03(5), 1039\u20131052 (2005)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02270-8_27","volume-title":"Frontiers in Algorithmics","author":"L. Wang","year":"2009","unstructured":"Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 261\u2013270. Springer, Heidelberg (2009)"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Wang, Y., Chen, W., Li, X., Cheng, B.: Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA. BMC Bioinform. 7(suppl. 4), S9 (2006)","DOI":"10.1186\/1471-2105-7-S4-S9"},{"key":"11_CR31","unstructured":"Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: Proc. of the 2nd International Conference on Bioinformatics and Computational Biology (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:38:49Z","timestamp":1746265129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}