{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:56:20Z","timestamp":1770486980288,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319674278","type":"print"},{"value":"9783319674285","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_2","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"14-26","source":"Crossref","is-referenced-by-count":7,"title":["Longest Common Factor After One Edit Operation"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Charalampopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198\u2013207. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"issue":"2","key":"2_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2), 19 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"2_CR3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1134\/S0032946011010030","volume":"47","author":"MA Babenko","year":"2011","unstructured":"Babenko, M.A., Starikovskaya, T.A.: Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47(1), 28\u201333 (2011)","journal-title":"Probl. Inf. Transm."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). doi:\n10.1007\/10719839_9"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-56024-6_19","volume-title":"Combinatorial Pattern Matching","author":"L Chi","year":"1992","unstructured":"Chi, L., Hui, K.: Color set size problem with applications to string matching. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1992. LNCS, vol. 644, pp. 230\u2013243. Springer, Heidelberg (1992). doi:\n10.1007\/3-540-56024-6_19"},{"key":"2_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137\u2013143. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"6\u20138","key":"2_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ipl.2015.03.006","volume":"115","author":"T Flouri","year":"2015","unstructured":"Flouri, T., Giaquinta, E., Kobert, K., Ukkonen, E.: Longest common substrings with \n            $$k$$\n           mismatches. Inf. Process. Lett. 115(6\u20138), 643\u2013647 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2_CR9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. ACM 31(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"issue":"6\u20138","key":"2_CR10","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.ipl.2015.03.003","volume":"115","author":"S Grabowski","year":"2015","unstructured":"Grabowski, S.: A note on the longest common substring with \n            $$k$$\n          -mismatches problem. Inf. Process. Lett. 115(6\u20138), 640\u2013642 (2015)","journal-title":"Inf. Process. Lett."},{"key":"2_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-662-44777-2_50","volume-title":"Algorithms - ESA 2014","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Starikovskaya, T., Vildh\u00f8j, H.W.: Sublinear space algorithms for the longest common substring problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 605\u2013617. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-44777-2_50"},{"issue":"14","key":"2_CR13","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","volume":"30","author":"C Leimeister","year":"2014","unstructured":"Leimeister, C., Morgenstern, B.: kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics 30(14), 2000\u20132008 (2014)","journal-title":"Bioinformatics"},{"key":"2_CR14","unstructured":"Starikovskaya, T.: Longest common substring with approximately k mismatches. In: CPM. LIPIcs, vol. 54, pp. 21:1\u201321:11. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-38905-4_22","volume-title":"Combinatorial Pattern Matching","author":"T Starikovskaya","year":"2013","unstructured":"Starikovskaya, T., Vildh\u00f8j, H.W.: Time-Space trade-offs for the longest common substring problem. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 223\u2013234. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-38905-4_22"},{"issue":"6","key":"2_CR16","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1089\/cmb.2015.0235","volume":"23","author":"SV Thankachan","year":"2016","unstructured":"Thankachan, S.V., Apostolico, A., Aluru, S.: A provably efficient algorithm for the k-mismatch average common substring problem. J. Comput. Biol. 23(6), 472\u2013482 (2016)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"2_CR17","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1089\/cmb.2015.0217","volume":"23","author":"SV Thankachan","year":"2016","unstructured":"Thankachan, S.V., Chockalingam, S.P., Liu, Y., Apostolico, A., Aluru, S.: ALFRED: a practical method for alignment-free distance computation. J. Comput. Biol. 23(6), 452\u2013460 (2016)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:50Z","timestamp":1504560170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}