{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T10:59:21Z","timestamp":1780743561576,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0190(92)90176-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"181-185","source":"Crossref","is-referenced-by-count":59,"title":["An efficient algorithm for the All Pairs Suffix-Prefix Problem"],"prefix":"10.1016","volume":"41","author":[{"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gad","family":"M. Landau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90176-V_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","article-title":"Parallel construction of a suffix tree with applications","volume":"3","author":"Apostolico","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(92)90176-V_BIB2","first-page":"328","article-title":"Linear approximation of shortest superstrings","author":"Blum","year":"1991","journal-title":"Proc. 23rd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90176-V_BIB3","series-title":"Tech. Rept. TR 89-5","article-title":"A procedural interface for a fragment assembly tool","author":"Kececioglu","year":"1989"},{"key":"10.1016\/0020-0190(92)90176-V_BIB4","author":"Kececioglu","year":"1991","journal-title":"A robust and automatic fragment assembly system"},{"key":"10.1016\/0020-0190(92)90176-V_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90176-V_BIB6","series-title":"Computational Molecular Biology, Sources and Methods for Sequence Analysis","year":"1988"},{"key":"10.1016\/0020-0190(92)90176-V_BIB7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90176-V_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","article-title":"A greedy approximation algorithm for constructing shortest common superstrings","volume":"57","author":"Tarhio","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90176-V_BIB9","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"issue":"1","key":"10.1016\/0020-0190(92)90176-V_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","article-title":"Approximation algorithms for the shortest common superstring problem","volume":"83","author":"Turner","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90176-V_BIB11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01840391","article-title":"A linear time algorithm for finding approximate shortest common superstrings","volume":"5","author":"Ukkonen","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(92)90176-V_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/SWAT.1973.13","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973","journal-title":"Proc. 14th IEEE Symp. on Switching and Automata Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290176V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290176V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:34Z","timestamp":1555129594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290176V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["002001909290176V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90176-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}