{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:14Z","timestamp":1725664274121},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:58Z","timestamp":1330251118000},"page":"164-172","source":"Crossref","is-referenced-by-count":6,"title":["Shortest common superstrings for strings of random letters"],"prefix":"10.1007","author":[{"given":"Kenneth S.","family":"Alexander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Alexander, K.S. Shortest common superstrings of random strings. (1993) Preprint.","DOI":"10.1007\/3-540-58094-8_15"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1214\/aop\/1176992808","volume":"13","author":"R. Arratia","year":"1985","unstructured":"Arratia, R. and Waterman, M.S. Critical phenomena in sequence matching. Ann. Probability 13 (1985) 1236\u20131249.","journal-title":"Ann. Probability"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J. and Yannakakis, M. Linear approximation of shortest superstrings. Proc. 23rd ACM Symp. on Theory of Computing, (1991) 328\u2013336.","DOI":"10.1145\/103418.103455"},{"key":"15_CR4","first-page":"53","volume-title":"Algorithms for some string matching problems arising in molecular genetics","author":"H. Peltola","year":"1983","unstructured":"Peltola, H., S\u00f6derlund, H., Tarhio, J. and Ukkonen, E. Algorithms for some string matching problems arising in molecular genetics. In: Information Processing 83 (Proc. of the IFIP Congress 1983), R.E.A. Mason, ed. North-Holland, Amsterdam, (1983) 53\u201364."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J. Tarhio","year":"1986","unstructured":"Tarhio, J. and Ukkonen, E. A greedy approximation algorithm for constructing shortest common superstrings. Theor. Comp. Sci. 57 (1986) 131\u2013145.","journal-title":"Theor. Comp. Sci."},{"key":"15_CR6","doi-asserted-by":"crossref","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. Information and Computation 83 (1989) 1\u201320.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:54Z","timestamp":1605629814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}