{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:49:06Z","timestamp":1743151746163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_32","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"313-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Equality-Free String Factorisations"],"prefix":"10.1007","author":[{"given":"Markus L.","family":"Schmid","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"32_CR1","first-page":"31","volume":"114","author":"L Bulteau","year":"2014","unstructured":"Bulteau, L., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R.: Multivariate algorithmics for NP-hard string problems. EATCS Bull. 114, 31\u201373 (2014)","journal-title":"EATCS Bull."},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-69733-6_27","volume-title":"Computing and Combinatorics","author":"A Condon","year":"2008","unstructured":"Condon, A., Ma\u0148uch, J., Thachuk, C.: Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 265\u2013275. Springer, Heidelberg (2008)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-31265-6_13","volume-title":"Combinatorial Pattern Matching","author":"A Condon","year":"2012","unstructured":"Condon, A., Ma\u0148uch, J., Thachuk, C.: The complexity of string partitioning. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 159\u2013172. Springer, Heidelberg (2012)"},{"key":"32_CR4","unstructured":"Fernau, H., Manea, F., Merca\u015f, R., Schmid, M.L.: Pattern matching with variables: fast algorithms and new hardness results. In: Leibniz International Proceedings in Informatics (LIPIcs), Proceedings 32nd Symposium on Theoretical Aspects of Computer Science, STACS 2015, vol. 30, pp. 302\u2013315 (2015)"},{"key":"32_CR5","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)"},{"key":"32_CR6","unstructured":"Gagie, T., Inenaga, S., Karkkainen, J., Kempa, D., Piatkowski, M., Puglisi, S.J., Sugimoto, S.: Diverse palindromic factorization is NP-complete. Technical report 1503.04045 (2015). http:\/\/arxiv.org\/abs\/1503.04045"},{"key":"32_CR7","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, San Francisco (1979)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-07956-1_2","volume-title":"Algorithmic Aspects in Information and Management","author":"H Jiang","year":"2014","unstructured":"Jiang, H., Su, B., Xiao, M., Xu, Y., Zhong, F., Zhu, B.: On the exact block cover problem. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 13\u201322. Springer, Heidelberg (2014)"},{"issue":"2","key":"32_CR9","first-page":"323","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. Commun. ACM 6(2), 323\u2013350 (1977)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:36:27Z","timestamp":1676943387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}