{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:10:10Z","timestamp":1751868610438,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030004781"},{"type":"electronic","value":"9783030004798"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00479-8_4","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T14:58:18Z","timestamp":1536850698000},"page":"42-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Longest Property-Preserved Common Factor"],"prefix":"10.1007","author":[{"given":"Lorraine A. K.","family":"Ayad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Bernardini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ayad, L.A.K., Barton, C., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P.: Longest common prefixes with $$k$$-errors and applications. In: Gagie, T., et al. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 27\u201341. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-030-00479-8_3"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2017.02.018","volume":"710","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Lee, I.: On finding a longest common palindromic subsequence. Theor Comput Sci 710, 29\u201334 (2018). Advances in Algorithms and Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S, Iliopoulos)","journal-title":"Theor Comput Sci"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"H Bannai","year":"2017","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"key":"4_CR4","unstructured":"Barton, C., Kociumaka, T., Liu, C., Pissis, S.P., Radoszewski, J.: Indexing weighted sequences: neat and efficient. CoRR, arXiv:abs\/1704.07625 (2017)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-11918-2_18","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2014","unstructured":"Belazzougui, D., Cunial, F.: Indexed matching statistics and shortest unique substrings. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 179\u2013190. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11918-2_18"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"WI Chang","year":"1994","unstructured":"Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica 12(4), 327\u2013344 (1994)","journal-title":"Algorithmica"},{"key":"4_CR7","unstructured":"Charalampopoulos, P., et al.: Linear-time algorithm for long LCF with K mismatches. In: CPM. LIPIcs, vol. 105, pp. 23:1\u201323:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"4_CR8","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). https:\/\/doi.org\/10.1007\/3-540-56024-6_19"},{"issue":"4","key":"4_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.3233\/FI-2014-974","volume":"129","author":"SR Chowdhury","year":"2014","unstructured":"Chowdhury, S.R., Hasan, M.M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fundam. Inf. 129(4), 329\u2013340 (2014)","journal-title":"Fundam. Inf."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-23826-5_6","volume-title":"String Processing and Information Retrieval","author":"M Dumitran","year":"2015","unstructured":"Dumitran, M., Manea, F., Nowotka, D.: On prefix\/suffix-square free words. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 54\u201366. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_6"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2004.06.024","volume":"326","author":"J-P Duval","year":"2004","unstructured":"Duval, J.-P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. Theor. Comput. Sci. 326(1), 229\u2013240 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-61258-0_11","volume-title":"Combinatorial Pattern Matching","author":"M Farach","year":"1996","unstructured":"Farach, M., Muthukrishnan, S.: Perfect hashing for strings: formalization and algorithms. In: Hirschberg, D., Myers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 130\u2013140. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61258-0_11"},{"issue":"43","key":"4_CR14","doi-asserted-by":"publisher","first-page":"4391","DOI":"10.1016\/j.tcs.2009.07.020","volume":"410","author":"M Federico","year":"2009","unstructured":"Federico, M., Pisanti, N.: Suffix tree characterization of maximal motifs in biological sequences. Theor. Comput. Sci. 410(43), 4391\u20134401 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"publisher","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, Cambridge (1997)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2017.08.006","volume":"129","author":"S Inenaga","year":"2018","unstructured":"Inenaga, S., Hyyr\u00f6, H.: A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129, 11\u201315 (2018)","journal-title":"Inf. Process. Lett."},{"key":"4_CR17","unstructured":"Inoue, T., Inenaga, S., Hyyr\u00f6, H., Bannai, H., Takeda, M.: Computing longest common square subsequences. In: 29th Symposium on Combinatorial Pattern Matching (CPM), LIPIcs, vol. 105, pp. 15:1\u201315:13 (2018)"},{"key":"4_CR18","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). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_50"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Symposium on Foundations of Comp Science, pp. 596\u2013604 (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"4_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.jda.2007.03.003","volume":"6","author":"P Peterlongo","year":"2008","unstructured":"Peterlongo, P., Pisanti, N., Boyer, F., do Lago, A.P., Sagot, M.: Lossless filter for multiple repetitions with hamming distance. J. Discr. Alg. 6(3), 497\u2013509 (2008)","journal-title":"J. Discr. Alg."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11575832_20","volume-title":"String Processing and Information Retrieval","author":"P Peterlongo","year":"2005","unstructured":"Peterlongo, P., Pisanti, N., Boyer, F., Sagot, M.-F.: Lossless filter for finding long multiple approximate repetitions using a new data structure, the Bi-factor array. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 179\u2013190. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575832_20"},{"key":"4_CR23","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). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_22"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-89929-9_14","volume-title":"Research in Computational Molecular Biology","author":"SV Thankachan","year":"2018","unstructured":"Thankachan, S.V., Aluru, C., Chockalingam, S.P., Aluru, S.: Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis. In: Raphael, B.J. (ed.) RECOMB 2018. LNCS, vol. 10812, pp. 211\u2013224. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89929-9_14"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","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."}],"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-030-00479-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T05:40:39Z","timestamp":1751866839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eventos.spc.org.pe\/spire2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}