{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:15:52Z","timestamp":1743038152742,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14812-6_33","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"536-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers"],"prefix":"10.1007","author":[{"given":"Alexandru","family":"Popa","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Tanasescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"issue":"6","key":"33_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"33_CR2","unstructured":"Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4\u20136 July 2017, pp. 25:1\u201325:15 (2017)"},{"key":"33_CR3","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. In: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4\u20136 July 2017, pp. 26:1\u201326:14 (2017)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63246-8_14","volume-title":"Structures in Logic and Computer Science","author":"A Apostolico","year":"1997","unstructured":"Apostolico, A., Breslauer, D.: Of periods, quasiperiods, repetitions and covers. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 236\u2013248. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63246-8_14"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17\u201320 (1991)","journal-title":"Inf. Process. Lett."},{"key":"33_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b139028","volume-title":"Liapunov Functions and Stability in Control Theory","author":"A Bacciotti","year":"2006","unstructured":"Bacciotti, A., Rosier, L.: Liapunov Functions and Stability in Control Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/b139028"},{"issue":"5","key":"33_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"RS Bird","year":"1977","unstructured":"Bird, R.S.: Two dimensional pattern matching. Inf. Process. Lett. 6(5), 168\u2013170 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"33_CR8","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1093\/bioinformatics\/btl674","volume":"23","author":"AK Brodzik","year":"2007","unstructured":"Brodzik, A.K.: Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem. Bioinformatics 23(6), 694\u2013700 (2007)","journal-title":"Bioinformatics"},{"issue":"6023","key":"33_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1038\/316050a0","volume":"316","author":"L Bursill","year":"1985","unstructured":"Bursill, L., Lin, P.J.: Penrose tiling observed in a quasi-crystal. Nature 316(6023), 50\u201351 (1985)","journal-title":"Nature"},{"key":"33_CR10","unstructured":"Derouet-Jourdan, A., Salvati, M., Jonchier, T.: Procedural Wang tile algorithm for stochastic wall patterns. CoRR, abs\/1706.03950 (2017)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0960-0779(95)80025-C","volume":"6","author":"S Havlin","year":"1995","unstructured":"Havlin, S., et al.: Fractals in biology and medicine. Chaos Solitons Fractals 6, 171\u2013201 (1995). Complex Systems in Computational Physics","journal-title":"Chaos Solitons Fractals"},{"key":"33_CR12","unstructured":"Iliopoulos, C., Smith, W.: An on-line algorithm of computing a minimum set of k-covers of a string. In: Proceedings of Ninth Australian Workshop on Combinatorial Algorithms (AWOCA), pp. 97\u2013106 (1998)"},{"key":"33_CR13","unstructured":"Jeandel, E., Rao, M.: An aperiodic set of 11 Wang tiles. arXiv preprint arXiv:1506.06492 (2015)"},{"key":"33_CR14","volume-title":"Introduction to the Modern Theory of Dynamical Systems","author":"A Katok","year":"1997","unstructured":"Katok, A., Hasselblatt, B.: Introduction to the Modern Theory of Dynamical Systems, vol. 54. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/1141911.1141916","volume":"25","author":"J Kopf","year":"2006","unstructured":"Kopf, J., Cohen-Or, D., Deussen, O., Lischinski, D.: Recursive wang tiles for real-time blue noise. ACM Trans. Graph. 25(3), 509\u2013518 (2006)","journal-title":"ACM Trans. Graph."},{"key":"33_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9781119011866","volume-title":"Digital Communications with Emphasis on Data Modems: Theory, Analysis, Design, Simulation, Testing, and Applications","author":"R Middlestead","year":"2017","unstructured":"Middlestead, R.: Digital Communications with Emphasis on Data Modems: Theory, Analysis, Design, Simulation, Testing, and Applications. Wiley, Hoboken (2017)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Ming, L., Vit\u00e1nyi, P.M.: Kolmogorov complexity and its applications. In: Algorithms and Complexity, pp. 187\u2013254. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50009-6"},{"issue":"1\u20133","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00847-2","volume":"304","author":"A Muchnik","year":"2003","unstructured":"Muchnik, A., Semenov, A., Ushakov, M.: Almost periodic sequences. Theor. Comput. Sci. 304(1\u20133), 1\u201333 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"33_CR20","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1145\/566654.566636","volume":"21","author":"K Perlin","year":"2002","unstructured":"Perlin, K.: Improving noise. ACM Trans. Graph. 21(3), 681\u2013682 (2002)","journal-title":"ACM Trans. Graph."},{"key":"33_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-8964-1","volume-title":"Speech Act Theory and Pragmatics","author":"JR Searle","year":"1980","unstructured":"Searle, J.R., Kiefer, F., Bierwisch, M., et al.: Speech Act Theory and Pragmatics, vol. 10. Springer, Dordrecht (1980). https:\/\/doi.org\/10.1007\/978-94-009-8964-1"},{"issue":"11","key":"33_CR22","doi-asserted-by":"publisher","first-page":"2953","DOI":"10.1109\/78.796431","volume":"47","author":"WA Sethares","year":"1999","unstructured":"Sethares, W.A., Staley, T.W.: Periodicity transforms. IEEE Trans. Sig. Process. 47(11), 2953\u20132964 (1999)","journal-title":"IEEE Trans. Sig. Process."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Timmermans, M., Heijmans, R., Daniels, H.: Cyclical patterns in risk indicators based on financial market infrastructure transaction data (2017)","DOI":"10.2139\/ssrn.2985414"},{"issue":"2","key":"33_CR24","first-page":"199","volume":"42","author":"A Tychonoff","year":"1935","unstructured":"Tychonoff, A.: Th\u00e9or\u00e8mes d\u2019unicit\u00e9 pour l\u2019\u00e9quation de la chaleur. Matematiceskij sbornik 42(2), 199\u2013216 (1935)","journal-title":"Matematiceskij sbornik"},{"issue":"22","key":"33_CR25","doi-asserted-by":"publisher","first-page":"5705","DOI":"10.1111\/febs.12495","volume":"280","author":"A Wlodawer","year":"2013","unstructured":"Wlodawer, A., Minor, W., Dauter, Z., Jaskolski, M.: Protein crystallography for aspiring crystallographers or how to avoid pitfalls and traps in macromolecular structure determination. FEBS J. 280(22), 5705\u20135736 (2013)","journal-title":"FEBS J."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14812-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:10:53Z","timestamp":1709824253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}