{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:40Z","timestamp":1759638160755},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_24","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"252-263","source":"Crossref","is-referenced-by-count":2,"title":["Enumerating Neighbour and Closest Strings"],"prefix":"10.1007","author":[{"given":"Naomi","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narges","family":"Simjour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"449","volume-title":"Proc. 47th Annu. IEEE Symp. Foundations of Computer Science","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: Proc. 47th Annu. IEEE Symp. Foundations of Computer Science, pp. 449\u2013458. IEEE Computer Society, Washington (2006)"},{"key":"24_CR2","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: Apostolico, A., Hein, J. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 247\u2013261. Springer, Heidelberg (1997)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-89097-3_26","volume-title":"String Processing and Information Retrieval","author":"C. Boucher","year":"2008","unstructured":"Boucher, C., Brown, D.G., Durocher, S.: On the Structure of Small Motif Recognition Instances. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 269\u2013281. Springer, Heidelberg (2008)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-16321-0_12","volume-title":"String Processing and Information Retrieval","author":"C. Boucher","year":"2010","unstructured":"Boucher, C., Omar, M.: On the Hardness of Counting and Sampling Center Strings. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 127\u2013134. Springer, Heidelberg (2010)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCBB.2011.21","volume":"8","author":"Z. Chen","year":"2011","unstructured":"Chen, Z., Wang, L.: Fast exact algorithms for the closest string and substring problems with application to the planted (l,d)-motif model. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a08, 1400\u20131410 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"1","key":"24_CR6","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. J. Comput. Syst. Sci. Int.\u00a078(1), 164\u2013178 (2012)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"24_CR7","doi-asserted-by":"crossref","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 Comput. Syst.\u00a030, 113\u2013119 (1997)","journal-title":"Theory Comput. Syst."},{"key":"24_CR8","first-page":"905","volume-title":"Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"L. G\u0105sieniec","year":"1999","unstructured":"G\u0105sieniec, L., Jansson, J., Lingas, A.: Efficient approximation algorithms for the hamming center problem. In: Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 905\u2013906. SIAM, Philadelphia (1999)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45678-3_38","volume-title":"Algorithms and Computation","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact Solutions for CLOSEST STRING and Related Problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 441\u2013453. Springer, Heidelberg (2001)"},{"issue":"1","key":"24_CR10","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"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inform. and Comput.\u00a0185(1), 41\u201355 (2003)","journal-title":"Inform. and Comput."},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"24_CR13","first-page":"473","volume-title":"Proc. 31st Annu. ACM Symp. Theory of Computing","author":"M. Li","year":"1999","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. In: Proc. 31st Annu. ACM Symp. Theory of Computing, pp. 473\u2013482. ACM, New York (1999)"},{"key":"24_CR14","first-page":"760","volume-title":"Proc. 22nd Annu. ACM-SIAM Symp. Discrete Algorithms","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: Proc. 22nd Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 760\u2013776. SIAM, San Francisco (2011)"},{"issue":"4","key":"24_CR15","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 J. Comput.\u00a039(4), 1432\u20131443 (2009)","journal-title":"SIAM J. Comput."},{"key":"24_CR16","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: Dehne, F., Rau-Chaplin, A., Sack, J., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 126\u2013135. Springer, Heidelberg (1997)"},{"key":"24_CR17","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":"24_CR18","unstructured":"Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: Proc. 2nd Int. Conf. Bioinformatics and Computational Biology, pp. 210\u2013215 (2010)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:28Z","timestamp":1620129808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}