{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:26Z","timestamp":1725455426854},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016287","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:39:17Z","timestamp":1131842357000},"page":"602-610","source":"Crossref","is-referenced-by-count":3,"title":["A greedy algorithm for constructing shortest common superstrings"],"prefix":"10.1007","author":[{"given":"Jorma","family":"Tarhio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/1780.1802","volume":"6","author":"P. Dencker","year":"1984","unstructured":"P. Dencker, K. D\u00fcrre and J. Henft: Optimization of parser tables for portable compilers. ACM TOPLAS\n6 (Oct. 1984), 546\u2013572.","journal-title":"ACM TOPLAS"},{"key":"58_CR2","unstructured":"J. K. Gallant: String compression algorithms. Ph.D. Thesis, Princeton University, 1982."},{"key":"58_CR3","unstructured":"M. R. Garey and D. S. Johnson: Computers and Intractability. W. H. Freeman, 1979."},{"key":"58_CR4","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/net.3230090406","volume":"9","author":"T. A. Jenkyns","year":"1979","unstructured":"T. A. Jenkyns: The greedy travelling salesman's problem. Networks\n9 (1979), 363\u2013373.","journal-title":"Networks"},{"key":"58_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"D. Knuth, J. Morris and V. Pratt: Fast pattern matching in strings. SIAM J. Comput.\n6 (1977), 323\u2013350.","journal-title":"SIAM J. Comput."},{"key":"58_CR6","unstructured":"D. Maier and J. A. Storer: A note on complexity of the superstring problem. TR-233, Princeton University, Dept. EECS, 1977."},{"key":"58_CR7","unstructured":"H. Peltola, H. S\u00f6derlund, J. Tarhio and E. Ukkonen: Algorithms for some string matching problems arising in molecular genetics. Information Processing 83 (Proceedings of the IFIP Congress 83), pp. 53\u201364. North-Holland, 1983."},{"key":"58_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R. E. Tarjan","year":"1979","unstructured":"R. E. Tarjan and A. C. Yao: Storing a sparse table. Comm. ACM\n22 (Nov. 1979), 606\u2013611.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016287.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:36:03Z","timestamp":1607531763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0016287","relation":{},"subject":[]}}