{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T08:06:39Z","timestamp":1787731599456,"version":"build-2784847793"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642037832","type":"print"},{"value":"9783642037849","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03784-9_23","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T14:47:42Z","timestamp":1250866062000},"page":"234-242","source":"Crossref","is-referenced-by-count":10,"title":["Consensus Optimizing Both Distance Sum and Radius"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joong Chae","family":"Na","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heejin","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeong Seop","family":"Sim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/0149012","volume":"49","author":"S. Altschul","year":"1989","unstructured":"Altschul, S., Lipman, D.: Trees, stars, and multiple sequence alignment. SIAM Journal on Applied Mathematics\u00a049, 197\u2013209 (1989)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"23_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: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 247\u2013261. Springer, Heidelberg (1997)"},{"key":"23_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)"},{"issue":"2","key":"23_CR4","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":"23_CR5","unstructured":"Gasieniec, L., Jansson, J., Lingas, A.: Efficient approximation algorithms for the Hamming center problem. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 905\u2013906 (1999)"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S1570-8667(03)00079-0","volume":"2","author":"L. Gasieniec","year":"2004","unstructured":"Gasieniec, L., Jansson, J., Lingas, A.: Approximation algorithms for Hamming clustering problems. Journal of Discrete Algorithms\u00a02(2), 289\u2013301 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for closest string and related problems. In: Proceedings of the 12th International Symposium on Algorithms and Computation, pp. 441\u2013453 (2001)","DOI":"10.1007\/3-540-45678-3_38"},{"issue":"1","key":"23_CR8","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":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Tree, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Tree, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Mapping the genome: some combinatorial problems arising in molecular biology. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 278\u2013285 (1993)","DOI":"10.1145\/167088.167170"},{"key":"23_CR11","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 633\u2013642 (1999)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 473\u2013482 (1999)","DOI":"10.1145\/301250.301376"},{"issue":"2","key":"23_CR13","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\u00a049(2), 157\u2013171 (2002)","journal-title":"Journal of the ACM"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: Proceedings of the 12th Annual International Conference on Research in Computational Molecular Biology, pp. 396\u2013409 (2008)","DOI":"10.1007\/978-3-540-78839-3_33"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of the 5th International Workshop on Algorithms and Data Structures, pp. 126\u2013135 (1997)","DOI":"10.1007\/3-540-63307-3_53"},{"key":"23_CR16","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30219-3_37","volume-title":"Algorithms in Bioinformatics","author":"S.-H. Sze","year":"2004","unstructured":"Sze, S.-H., Lu, S., Chen, J.: Integrating sample-driven and pattern-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 438\u2013449. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03784-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:50:30Z","timestamp":1552139430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03784-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037832","9783642037849"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03784-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}