{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:00:49Z","timestamp":1649109649350},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0304-3975(97)00132-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"89-98","source":"Crossref","is-referenced-by-count":0,"title":["Fast RNC and NC algorithms for maximal path sets"],"prefix":"10.1016","volume":"215","author":[{"given":"Ryuhei","family":"Uehara","sequence":"first","affiliation":[]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00132-1_BIB1","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\/S0304-3975(97)00132-1_BIB2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(95)00106-M","article-title":"A fast and efficient NC algorithm for maximal matching","volume":"55","author":"Chen","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00132-1_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(95)00110-7","article-title":"Parallel constructions of maximal path sets and applications to short superstrings","volume":"161","author":"Chen","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00132-1_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\/S0304-3975(97)00132-1_BIB5","series-title":"Proc. 5th IEEE Internat. Parallel Processing Symposium","first-page":"84","article-title":"Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs","author":"Gazit","year":"1991"},{"key":"10.1016\/S0304-3975(97)00132-1_BIB6","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\/S0304-3975(97)00132-1_BIB7","series-title":"The Design and Analysis of Algorithms","author":"Kozen","year":"1992"},{"key":"10.1016\/S0304-3975(97)00132-1_BIB8","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(97)00132-1_BIB9","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\/S0304-3975(97)00132-1_BIB10","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"158","article-title":"Approximating shortest superstrings","author":"Teng","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:09Z","timestamp":1555390269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397597001321"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00132-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}