{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:47:49Z","timestamp":1743014869531,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245824"},{"type":"electronic","value":"9783642245831"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24583-1_17","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T13:08:23Z","timestamp":1317388103000},"page":"168-173","source":"Crossref","is-referenced-by-count":6,"title":["Approximations and Partial Solutions for the Consensus Sequence Problem"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Paryenty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching, pp. 247\u2013261 (1997)","key":"17_CR1","DOI":"10.1007\/3-540-63220-4_63"},{"key":"17_CR2","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)"},{"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)","key":"17_CR3"},{"unstructured":"Gasieniec, L., Jansson, J., Lingas, A.: Approximation algorithms for Hamming clustering problems 2, 289\u2013301 (2004)","key":"17_CR4"},{"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)","key":"17_CR5","DOI":"10.1007\/3-540-45678-3_38"},{"issue":"1","key":"17_CR6","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":"17_CR7","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":"17_CR8","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)"},{"unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selec- tion problems. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 633\u2013642 (1999)","key":"17_CR9"},{"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)","key":"17_CR10","DOI":"10.1145\/301250.301376"},{"issue":"2","key":"17_CR11","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":"17_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-78839-3_33","volume-title":"Research in Computational Molecular Biology","author":"B. Ma","year":"2008","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 396\u2013409. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Chimani, M., Woste, M., Bocker, S.: A Closer Look at the Closest String and Closest Substring Problem, pp. 13\u201324. ALENEX (2011)","key":"17_CR13","DOI":"10.1137\/1.9781611972917.2"},{"key":"17_CR14","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":"17_CR15","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. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"}],"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-24583-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T04:11:33Z","timestamp":1548475893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24583-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245824","9783642245831"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24583-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}