{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:22:34Z","timestamp":1725823354490},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_26","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"307-315","source":"Crossref","is-referenced-by-count":3,"title":["Greedy Conjecture for Strings of Length 4"],"prefix":"10.1007","author":[{"given":"Alexander S.","family":"Kulikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Savinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgeniy","family":"Sluzhaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (J.ACM) 9(1), 61\u201363 (1962)","journal-title":"J. ACM (J.ACM)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J.: On finding minimal length superstrings. J. Comput. Syst. Sci. 20(1), 50\u201358 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-1-4939-0808-0_10","volume-title":"Optimization in Science and Engineering\u2013 In Honor of the 60th Birthday of Panos M. Pardalos","author":"T Gevezes","year":"2014","unstructured":"Gevezes, T., Pitsoulis, L.: The shortest superstring problem. In: Rassias, T.M., Floudas, C.A., Butenko, S. (eds.) Optimization in Science and Engineering\u2013 In Honor of the 60th Birthday of Panos M. Pardalos, pp. 189\u2013227. Springer, New York (2014)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-38905-4_13","volume-title":"Combinatorial Pattern Matching","author":"A Golovnev","year":"2013","unstructured":"Golovnev, A., Kulikov, A.S., Mihajlin, I.: Approximating shortest superstring problem using de bruijn graphs. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 120\u2013129. Springer, Heidelberg (2013)"},{"issue":"8","key":"26_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.ipl.2014.03.004","volume":"114","author":"A Golovnev","year":"2014","unstructured":"Golovnev, A., Kulikov, A.S., Mihajlin, I.: Solving SCS for bounded length strings in fewer than $$2^n$$ 2 n steps. Inf. Process. Lett. 114(8), 421\u2013425 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"RM Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49\u201351 (1982)","journal-title":"Oper. Res. Lett."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the 1977 annual conference. pp. 294\u2013300. ACM (1977)","DOI":"10.1145\/800179.810218"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054106003796","volume":"17","author":"U Laube","year":"2006","unstructured":"Laube, U., Weinard, M.: Conditional inequalities and the shortest common superstring problem. Int. J. Found. Comput. Sci. 17(1), 247\u2013247 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR10","unstructured":"Maier, D., Storer, J.A.: A note on the complexity of the superstring problem. Princeton University Technical report 233 (1977)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Mucha, M.: Lyndon words and short superstrings. In: Proceedings of the TwentyFourth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2013, Society for Industrial and Applied Mathematics (2013)","DOI":"10.1137\/1.9781611973105.69"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-46784-X_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Ott","year":"1999","unstructured":"Ott, S.: Lower bounds for approximating shortest superstrings over an alphabet of size 2. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 55\u201364. Springer, Heidelberg (1999)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/BFb0016287","volume-title":"Mathematical Foundations of Computer Science","author":"J Tarhio","year":"1986","unstructured":"Tarhio, J., Ukkonen, E.: A greedy algorithm for constructing shortest common superstrings. In: Gruska, J., Rovan, B., Wiedermann, J. (eds.) MFCS 1986. LNCS, pp. 602\u2013610. Springer, Heidelberg (1986)"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","volume":"83","author":"J Turner","year":"1989","unstructured":"Turner, J.: Approximation algorithms for the shortest common superstring problem. Inf. Comput. 83(1), 1\u201320 (1989)","journal-title":"Inf. Comput."},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-540-24597-1_33","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M Weinard","year":"2003","unstructured":"Weinard, M., Schnitger, G.: On the greedy superstring conjecture. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 387\u2013398. Springer, Heidelberg (2003)"}],"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-19929-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T12:49:13Z","timestamp":1691758153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}