{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:08Z","timestamp":1760202668733},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"DOI":"10.1515\/gcc-2012-0016","type":"journal-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T18:49:52Z","timestamp":1370458192000},"source":"Crossref","is-referenced-by-count":83,"title":["Algorithmics on SLP-compressed strings: A survey"],"prefix":"10.1515","volume":"4","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"374","container-title":["Groups - Complexity - Cryptology"],"original-title":[],"link":[{"URL":"https:\/\/www.degruyter.com\/view\/j\/gcc.2012.4.issue-2\/gcc-2012-0016\/gcc-2012-0016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T03:07:59Z","timestamp":1614395279000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/gcc-2012-0016\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":0,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1515\/gcc-2012-0016","relation":{},"ISSN":["1867-1144","1869-6104"],"issn-type":[{"value":"1867-1144","type":"print"},{"value":"1869-6104","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}