{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T20:10:29Z","timestamp":1741983029056,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_73","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"714-723","source":"Crossref","is-referenced-by-count":2,"title":["Closest Periodic Vectors in L p Spaces"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Estrella","family":"Eisenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"73_CR1","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A. Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity and its application. SIAM J. Comp.\u00a027(1), 90\u2013106 (1998)","journal-title":"SIAM J. Comp."},{"doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G., Farach, M.: Optimal parallel two dimensional pattern matching. In: Proc. of the 5th ACM Symp. on Parallel Algorithms and Architectures, pp. 79\u201385 (1993)","key":"73_CR2","DOI":"10.1145\/165231.165242"},{"issue":"1","key":"73_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2705","volume":"144","author":"A. Amir","year":"1998","unstructured":"Amir, A., Benson, G., Farach, M.: Optimal parallel two dimensional text searching on a crew pram. Information and Computation\u00a0144(1), 1\u201317 (1998)","journal-title":"Information and Computation"},{"key":"73_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-17517-6_5","volume-title":"Algorithms and Computation","author":"A. Amir","year":"2010","unstructured":"Amir, A., Eisenberg, E., Levy, A.: Approximate Periodicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 25\u201336. Springer, Heidelberg (2010)"},{"key":"73_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-14165-2_5","volume-title":"Automata, Languages and Programming","author":"A. Amir","year":"2010","unstructured":"Amir, A., Eisenberg, E., Levy, A., Porat, E., Shapira, N.: Cycle Detection and Correction. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 43\u201354. Springer, Heidelberg (2010)"},{"issue":"9","key":"73_CR6","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.dam.2006.11.017","volume":"156","author":"A. Apostolico","year":"2008","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math.\u00a0156(9), 1389\u20131398 (2008)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Cole, R., Crochemore, M., Galil, Z., Ga\u0327sieniec, L., Harihan, R., Muthukrishnan, S., Park, K., Rytter, W.: Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. In: Proc. 34th IEEE FOCS, pp. 248\u2013258 (1993)","key":"73_CR7","DOI":"10.1109\/SFCS.1993.366862"},{"issue":"5","key":"73_CR8","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"unstructured":"Crochemore, M., Galil, Z., Gasieniec, L., Hariharan, R., Muthukrishnan, S., Park, K., Ramesh, H., Rytter, W.: Parallel two-dimensional pattern matching. In: Proc. 34th Annual IEEE FOCS, pp. 248\u2013258 (1993)","key":"73_CR9"},{"doi-asserted-by":"crossref","unstructured":"Galil, Z.: Optimal parallel algorithms for string matching. In: Proc. 16th ACM Symposium on Theory of Computing, vol.\u00a067, pp. 144\u2013157 (1984)","key":"73_CR10","DOI":"10.1145\/800057.808687"},{"issue":"5","key":"73_CR11","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z. Galil","year":"1996","unstructured":"Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comp.\u00a025(5), 907\u2013935 (1996)","journal-title":"SIAM J. Comp."},{"doi-asserted-by":"crossref","unstructured":"Gfeller, B.: Finding longest approximate periodic patterns. In: WADS (2011)","key":"73_CR12","DOI":"10.1007\/978-3-642-22300-6_39"},{"issue":"1","key":"73_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. Journal of Computational Biology\u00a08(1), 1\u201318 (2001)","journal-title":"Journal of Computational Biology"},{"doi-asserted-by":"crossref","unstructured":"Lipsky, O., Porat, E.: Approximated Pattern Matching with the l 1, l 2 and l \u2009\u221e\u2009 Metrics. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 212\u2013223. Springer, Heidelberg (2008)","key":"73_CR14","DOI":"10.1007\/978-3-540-89097-3_21"},{"key":"73_CR15","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"unstructured":"Ma, S., Hellerstein, J.L.: Mining partially periodic event patterns with unknown periods. In: The 17th International Conference on Data Engineering (ICDE), pp. 205\u2013214. IEEE Computer Society (2001)","key":"73_CR16"},{"doi-asserted-by":"crossref","unstructured":"R\u00e9gnier, M., Rostami, L.: A unifying look at d-dimensional periodicities and space coverings. In: Proc. 4th Symp. on Combinatorial Pattern Matching, vol.\u00a015, pp. 215\u2013227 (1993)","key":"73_CR17","DOI":"10.1007\/BFb0029807"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T19:31:52Z","timestamp":1741980712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}