{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:47:17Z","timestamp":1725806837138},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119175"},{"type":"electronic","value":"9783319119182"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11918-2_24","type":"book-chapter","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T05:09:45Z","timestamp":1412917785000},"page":"244-255","source":"Crossref","is-referenced-by-count":1,"title":["On the String Consensus Problem and the Manhattan Sequence Consensus Problem"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Jakub W.","family":"Pachocki","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-34109-0_6","volume-title":"String Processing and Information Retrieval","author":"A. Amir","year":"2012","unstructured":"Amir, A., Paryenty, H., Roditty, L.: Configurations and minority in the string consensus problem. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 42\u201353. Springer, Heidelberg (2012)"},{"issue":"10-11","key":"24_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ipl.2013.02.016","volume":"113","author":"A. Amir","year":"2013","unstructured":"Amir, A., Paryenty, H., Roditty, L.: On the hardness of the consensus string problem. Inf. Process. Lett.\u00a0113(10-11), 371\u2013374 (2013)","journal-title":"Inf. Process. Lett."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Patrascu, M.: On the optimality of the dimensionality reduction method. In: FOCS, pp. 449\u2013458. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.56"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Reif, J.H. (ed.) STOC, pp. 250\u2013257. ACM (2002)","DOI":"10.1145\/509943.509947"},{"key":"24_CR5","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":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/18.623161","volume":"43","author":"G.D. Cohen","year":"1997","unstructured":"Cohen, G.D., Honkala, I.S., Litsyn, S., Sol\u00e9, P.: Long packing and covering codes. IEEE Transactions on Information Theory\u00a043(5), 1617\u20131619 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-39658-1_57","volume-title":"Algorithms - ESA 2003","author":"K. Fischer","year":"2003","unstructured":"Fischer, K., G\u00e4rtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 630\u2013641. Springer, Heidelberg (2003)"},{"issue":"2","key":"24_CR8","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 Comput. Syst.\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B., Sch\u00f6nherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Symposium on Computational Geometry, pp. 110\u2013118 (2000)","DOI":"10.1145\/336154.336191"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. IEEE Transactions on Information Theory\u00a031(3), 385\u2013401 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"24_CR12","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":"24_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Reasearch\u00a012, 415\u2013440 (1987)","journal-title":"Mathematics of Operations Reasearch"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Pachocki, J.W., Radoszewski, J., Rytter, W., Wale\u0144, T.: On the string consensus problem and the Manhattan sequence consensus problem (full version). CoRR, abs\/1407.6144 (2014)","DOI":"10.1007\/978-3-319-11918-2_24"},{"key":"24_CR15","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions. In: 5th Workshop on Algorithm Engineering and Experiments (2003)"},{"key":"24_CR16","unstructured":"Lanct\u00f4t, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Tarjan, R.E., Warnow, T. (eds.) SODA, pp. 633\u2013642. ACM\/SIAM (1999)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"24_CR18","unstructured":"Lokshtanov, D.: New Methods in Parameterized Algorithms and Complexity. PhD thesis, University of Bergen (2009)"},{"issue":"4","key":"24_CR19","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_CR20","doi-asserted-by":"crossref","unstructured":"Mazumdar, A., Polyanskiy, Y., Saha, B.: On Chebyshev radius of a set in Hamming space and the closest string problem. In: ISIT, pp. 1401\u20131405. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620457"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Ritter, J.: An efficient bounding sphere. In: Glassner, A.S. (ed.) Gems. Academic Press, Boston (1990)","DOI":"10.1016\/B978-0-08-050753-8.50063-2"},{"key":"24_CR22","first-page":"79","volume":"1","author":"J.J. Sylvester","year":"1857","unstructured":"Sylvester, J.J.: A question in the geometry of situation. Quarterly Journal of Pure and Applied Mathematics\u00a01, 79 (1857)","journal-title":"Quarterly Journal of Pure and Applied Mathematics"}],"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-319-11918-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:40:30Z","timestamp":1559000430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11918-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119175","9783319119182"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11918-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}