{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:21Z","timestamp":1725570441679},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_5","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"25-36","source":"Crossref","is-referenced-by-count":9,"title":["Approximate Periodicity"],"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"}]}],"member":"297","reference":[{"issue":"1","key":"5_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."},{"issue":"1","key":"5_CR2","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"},{"issue":"9","key":"5_CR3","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., G\u0105sieniec, 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":"5_CR4","DOI":"10.1109\/SFCS.1993.366862"},{"issue":"5","key":"5_CR5","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":"Fischer, M.J., Paterson, M.S.: String matching and other products, Complexity of Computation. In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol.\u00a07, pp. 113\u2013125 (1974)","key":"5_CR6"},{"key":"5_CR7","first-page":"144","volume":"67","author":"Z. Galil","year":"1984","unstructured":"Galil, Z.: Optimal parallel algorithms for string matching. In: Proc. 16th ACM Symposium on Theory of Computing, vol.\u00a067, pp. 144\u2013157 (1984)","journal-title":"Proc. 16th ACM Symposium on Theory of Computing"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z. Galil","year":"1986","unstructured":"Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News\u00a017(4), 52\u201354 (1986)","journal-title":"SIGACT News"},{"key":"5_CR9","first-page":"338","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestor. Computer and System Science\u00a013, 338\u2013355 (1984)","journal-title":"Computer and System Science"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(93)90177-B","volume":"48","author":"H. Karloff","year":"1993","unstructured":"Karloff, H.: Fast algorithms for approximately counting mismatches. Information Processing Letters\u00a048(2), 53\u201360 (1993)","journal-title":"Information Processing Letters"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44676-1_14","volume-title":"Algorithms - ESA 2001","author":"R.M. Kolpakov","year":"2001","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding Approximate Repetitions under Hamming Distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 170\u2013181. Springer, Heidelberg (2001)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"G.M. Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science\u00a043, 239\u2013249 (1986)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. Journal of Computational Biology\u00a08(1), 1\u201318 (2001)","key":"5_CR15","DOI":"10.1089\/106652701300099038"},{"key":"5_CR16","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An o(nlogn) algorithm for finding all repetitions in a string. Journal of Algorithms\u00a05, 422\u2013432 (1984)","journal-title":"Journal of Algorithms"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48452-3_10","volume-title":"Combinatorial Pattern Matching","author":"J.S. Sim","year":"1999","unstructured":"Sim, J.S., Park, K., Iliopoulos, C.S., Smyth, W.F.: Approximate periods of strings. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 123\u2013133. Springer, Heidelberg (1999)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical systems Theory"},{"doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14 IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","key":"5_CR20","DOI":"10.1109\/SWAT.1973.13"}],"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-17517-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:06:19Z","timestamp":1553274379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}