{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T10:10:04Z","timestamp":1746267004052,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_22","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"212-221","source":"Crossref","is-referenced-by-count":11,"title":["Searching of Gapped Repeats and Subrepetitions in a Word"],"prefix":"10.1007","author":[{"given":"Roman","family":"Kolpakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Podolskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Posypkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nickolay","family":"Khrapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","first-page":"77","volume":"1","author":"G. Brodal","year":"2000","unstructured":"Brodal, G., Lyngso, R., Pedersen, C., Stoye, J.: Finding Maximal Pairs with Bounded Gap. J. of Discrete Algorithms\u00a01(1), 77\u2013104 (2000)","journal-title":"J. of Discrete Algorithms"},{"key":"22_CR2","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, 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica\u00a013, 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-69068-9_27","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: Towards a solution to the \u201cruns\u201d conjecture. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 290\u2013302. Springer, Heidelberg (2008)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-16321-0_27","volume-title":"String Processing and Information Retrieval","author":"M. Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a string from its runs structure. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 258\u2013269. Springer, Heidelberg (2010)"},{"key":"22_CR7","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., Zulstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.: Time-space optimal string matching. J. of Computer and System Sciences\u00a026(3), 280\u2013294 (1983)","journal-title":"J. of Computer and System Sciences"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. of Computer and System Sciences\u00a069(4), 525\u2013546 (2004)","journal-title":"J. of Computer and System Sciences"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-34109-0_30","volume-title":"String Processing and Information Retrieval","author":"T. Kociumaka","year":"2012","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Efficient Data Structures for the Factor Periodicity Problem. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 284\u2013294. Springer, Heidelberg (2012)"},{"issue":"1","key":"22_CR12","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On Maximal Repetitions in Words. J. of Discrete Algorithms\u00a01(1), 159\u2013186 (2000)","journal-title":"J. of Discrete Algorithms"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding Repeats with Fixed Gap. In: 7th International Symposium on String Processing and Information Retrieval (SPIRE 2000), pp. 162\u2013168 (2000)","DOI":"10.1109\/SPIRE.2000.878192"},{"key":"22_CR14","unstructured":"Kolpakov, R., Kucherov, G.: Periodic structures in words. Chapter for the 3rd Lothaire volume Applied Combinatorics on Words. Cambridge University Press (2005)"},{"issue":"7","key":"22_CR15","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ipl.2010.01.005","volume":"110","author":"R. Kolpakov","year":"2010","unstructured":"Kolpakov, R., Kucherov, G., Ochem, P.: On maximal repetitions of arbitrary exponent. Information Processing Letters\u00a0110(7), 252\u2013256 (2010)","journal-title":"Information Processing Letters"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2011.10.024","volume":"418","author":"R. Kolpakov","year":"2012","unstructured":"Kolpakov, R.: On primary and secondary repetitions in words. Theoretical Computer Science\u00a0418, 71\u201381 (2012)","journal-title":"Theoretical Computer Science"},{"key":"22_CR17","unstructured":"Kolpakov, R., Podolskiy, M., Posypkin, M., Khrapov, N.: Searching of gapped repeats and subrepetitions in a word, http:\/\/arxiv.org\/abs\/1309.4055"},{"key":"22_CR18","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol.\u00a017. Addison-Wesley (1983)"},{"key":"22_CR19","volume-title":"Data compression: Methods and theory","author":"J. Storer","year":"1988","unstructured":"Storer, J.: Data compression: Methods and theory. Computer Science Press, Rockville (1988)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:38:49Z","timestamp":1746265129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}