{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:44Z","timestamp":1725795944942},"publisher-location":"Cham","reference-count":24,"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_15","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"140-149","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity Analysis for the Closest String with Wildcards Problem"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hermelin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liat","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-24583-1_17","volume-title":"String Processing and Information Retrieval","author":"A. Amir","year":"2011","unstructured":"Amir, A., Paryenty, H., Roditty, L.: Approximations and partial solutions for the consensus sequence problem. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 168\u2013173. Springer, Heidelberg (2011)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"issue":"5","key":"15_CR3","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 (l, 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"},{"issue":"1","key":"15_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(1), 164\u2013178 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chimani, M., Woste, M., B\u00f6cker, S.: A closer look at the closest string and closest substring problem. In: ALENEX, pp. 13\u201324 (2011)","DOI":"10.1137\/1.9781611972917.2"},{"issue":"2","key":"15_CR6","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 ampiification of highly variable genomes. Computer Applications in the Biosciences: CABIOS\u00a09(2), 123\u2013125 (1993)","journal-title":"Computer Applications in the Biosciences: CABIOS"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"15_CR9","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":"15_CR10","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"15_CR12","unstructured":"Gramm, J., H\u00fcffner, F., Niedermeie, R.: Closest strings, primer design, and motif search. In: Currents in Computational Molecular Biology, Poster Abstracts of RECOMB, vol.\u00a02002, pp. 74\u201375 (2002)"},{"issue":"1","key":"15_CR13","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(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"15_CR15","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 633\u2013642 (1999)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Lenstra, W.: Integer programming with a fixed number of variables. Mathematics of Operations Research, 538\u2013548 (1983)","DOI":"10.1287\/moor.8.4.538"},{"issue":"2","key":"15_CR17","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. Journal of the ACM (JACM)\u00a049(2), 157\u2013171 (2002)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B. Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM Journal on Computing\u00a039(4), 1432\u20131443 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"15_CR19","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 Journal on Computing\u00a038(4), 1382\u20131410 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"15_CR21","first-page":"253","volume":"12","author":"V. Proutski","year":"1996","unstructured":"Proutski, V., Holmes, E.C.: Primer master: A new program for the design and analysis of pcr primers. Computer Applications in the Biosciences: CABIOS\u00a012, 253\u2013255 (1996)","journal-title":"Computer Applications in the Biosciences: CABIOS"},{"key":"15_CR22","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)"},{"key":"15_CR23","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":"15_CR24","unstructured":"Zhao, R., Zhang, N.: A more efficient closest string problem. In: Bioinformatics and Computational Biology, pp. 210\u2013215 (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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:30:03Z","timestamp":1558924203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}