{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:28:56Z","timestamp":1660271336582},"reference-count":15,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1080\/00207160701389168","type":"journal-article","created":{"date-parts":[[2008,2,4]],"date-time":"2008-02-04T13:36:59Z","timestamp":1202132219000},"page":"155-168","source":"Crossref","is-referenced-by-count":1,"title":["Generalized approximate regularities in strings"],"prefix":"10.1080","volume":"85","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qing","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90056-N"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90111-8"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00235-Q"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0062-2"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00047-3"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01955677"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1162"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.020"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Guo, Q., Zhang, H. and Iliopoulos, C. S. Computing the \u03bb-seeds of a string. Proceedings of the 2nd International Conferences on Algorithmic Aspects in Information and Management (AAIM \u201906). Berlin. Vol. 4041, pp.303\u2013313. Springer Verlag. Lecture Notes in Computer Science","DOI":"10.1007\/11775096_28"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00365-0"},{"key":"CIT0011","first-page":"16","volume":"29","author":"Sim J. S.","year":"2002","journal-title":"Journal of Korea Information Science Society"},{"key":"CIT0012","unstructured":"Christodoulakis, M., Iliopoulos, C. S., Park, K. and Sim, J. S. Approximate seeds of strings. Proceedings of the 2003 Prague Stringology Conference PSC\u201903. Prague: pp.25\u201336. CTU."},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Kim, S. and Park, K. A dynamic edit distance table. Proceedings of the 11th Symposium on Combinatorial Pattern Matching. Berlin: Vol. 1848, pp.60\u201368. Springer-Verlag. Lecture Notes in Computer Science","DOI":"10.1007\/3-540-45123-4_7"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90024-7"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90109-3"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160701389168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T17:32:56Z","timestamp":1557250376000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160701389168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1080\/00207160701389168"],"URL":"https:\/\/doi.org\/10.1080\/00207160701389168","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}