{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:03:40Z","timestamp":1648911820449},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1142\/s0129054106003796","type":"journal-article","created":{"date-parts":[[2006,2,9]],"date-time":"2006-02-09T05:25:16Z","timestamp":1139462716000},"page":"247-247","source":"Crossref","is-referenced-by-count":1,"title":["ERRATUM: \"CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM\""],"prefix":"10.1142","volume":"17","author":[{"given":"U.","family":"Laube","sequence":"first","affiliation":[]},{"given":"M.","family":"Weinard","sequence":"additional","affiliation":[]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:41:39Z","timestamp":1565124099000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0129054106003796"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003796","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}