{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:27:24Z","timestamp":1725467244304},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389047"},{"type":"electronic","value":"9783642389054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38905-4_4","type":"book-chapter","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T03:28:54Z","timestamp":1368674934000},"page":"13-27","source":"Crossref","is-referenced-by-count":4,"title":["Locating All Maximal Approximate Runs in a String"],"prefix":"10.1007","author":[{"given":"Mika","family":"Amit","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","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. Inf. Process. Lett.\u00a012, 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theor. Comput. Sci.\u00a022, 297\u2013315 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR3","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(n log n) algorithm for finding all repetitions in a string. J. Algorithms\u00a05, 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-58094-8_13","volume-title":"Combinatorial Pattern Matching","author":"S.R. Kosaraju","year":"1994","unstructured":"Kosaraju, S.R.: Computation of squares in a string (preliminary version). In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 146\u2013150. Springer, Heidelberg (1994)"},{"key":"4_CR5","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. Comput. Syst. Sci.\u00a069, 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C.S. Iliopoulos","year":"1997","unstructured":"Iliopoulos, C.S., Moore, D., Smyth, W.F.: A characterization of the squares in a fibonacci string. Theor. Comput. Sci.\u00a0172, 281\u2013291 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Foundations of Computer Science, pp. 596\u2013604 (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 pages. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M.G. Main","year":"1989","unstructured":"Main, M.G.: Detecting leftmost maximal periodicities. Discrete Applied Mathematics\u00a025, 145\u2013153 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR10","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M.: Recherche lin\u00e9aire d\u2019un carr\u00e9 dans un mot. C. R. Acad. Sc. Paris S\u00e9r. I Math.\u00a0296, 781\u2013784 (1983)","journal-title":"C. R. Acad. Sc. Paris S\u00e9r. I Math."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing longest previous factors in linear time and applications. Information Processing Letters\u00a0106, 75\u201380 (2008), doi:10.1016\/j.ipl.2007.10.006","journal-title":"Information Processing Letters"},{"key":"4_CR12","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\u201318 (2001)","journal-title":"Journal of Computational Biology"},{"key":"4_CR13","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., Iliopoulos, C.S., Park, K., 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":"4_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"1","author":"R.M. Kolpakov","year":"2003","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci.\u00a01, 135\u2013156 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","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, Part I. LNCS, vol.\u00a06506, pp. 25\u201336. Springer, Heidelberg (2010)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. Journal of the ACM\u00a013, 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of Algorithms\u00a010, 157\u2013169 (1989)","journal-title":"Journal of Algorithms"},{"key":"4_CR18","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, 52\u201354 (1986)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38905-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:57:55Z","timestamp":1557712675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38905-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389047","9783642389054"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38905-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}