{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:44:15Z","timestamp":1746283455607},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00110-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"1-21","source":"Crossref","is-referenced-by-count":3,"title":["Parallel constructions of maximal path sets and applications to short superstrings"],"prefix":"10.1016","volume":"161","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00110-7_BIB1","series-title":"A 234-approximation algorithm for the shortest superstring problem","author":"Armen","year":"1994"},{"key":"10.1016\/0304-3975(95)00110-7_BIB2","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"328","article-title":"Linear approximation of shortest superstrings","author":"Blum","year":"1991"},{"key":"10.1016\/0304-3975(95)00110-7_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00110-7_BIB4","series-title":"Proc. 4th Scandinavian Workshop on Algorithm Theory","first-page":"95","article-title":"Parallel and sequential approximation of shortest superstrings","volume":"Vol. 824","author":"Czumaj","year":"1994"},{"key":"10.1016\/0304-3975(95)00110-7_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00110-7_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00110-7_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","article-title":"A fast and simple randomized parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00110-7_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved maximal matching parallel algorithm","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00110-7_BIB9","series-title":"Proc. 23rd IEEE Symp. on Foundations of Computer Science","first-page":"312","article-title":"An efficient approximation scheme for the one-dimensional Bin Packing Problem","author":"Karmarkar","year":"1982"},{"key":"10.1016\/0304-3975(95)00110-7_BIB10","first-page":"868","article-title":"Parallel Algorithms for Shared Memory Machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(95)00110-7_BIB11","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"125","article-title":"Towards a DNA sequencing theory (learning a string)","author":"Li","year":"1990"},{"key":"10.1016\/0304-3975(95)00110-7_BIB12","series-title":"Proc. 19th ACM Symp. on Theory of Computing","first-page":"345","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987"},{"key":"10.1016\/0304-3975(95)00110-7_BIB13","series-title":"Proc. 2nd IFIP Congress","first-page":"53","article-title":"Algorithms for some string matching problems arising in molecular genetics","author":"Peltola","year":"1983"},{"key":"10.1016\/0304-3975(95)00110-7_BIB14","series-title":"Proc. 35th IEEE Symp. on Foundations of Computer Science","first-page":"166","article-title":"Long tours and short superstrings","author":"Kosaraju","year":"1994"},{"key":"10.1016\/0304-3975(95)00110-7_BIB15","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/0304-3975(95)00110-7_BIB16","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\/0304-3975(95)00110-7_BIB17","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"158","article-title":"Approximating shortest superstrings","author":"Teng","year":"1993"},{"key":"10.1016\/0304-3975(95)00110-7_BIB18","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:57:55Z","timestamp":1556315875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595001107"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00110-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}