{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T08:33:45Z","timestamp":1770712425501,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030004781","type":"print"},{"value":"9783030004798","type":"electronic"}],"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_3","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T14:58:18Z","timestamp":1536850698000},"page":"27-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Longest Common Prefixes with k-Errors and Applications"],"prefix":"10.1007","author":[{"given":"Lorraine A. K.","family":"Ayad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Barton","sequence":"additional","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"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, R., Yu, H.: More applications of the polynomial method to algorithm design. In: SODA, SODA 2015, pp. 218\u2013230. Society for Industrial and Applied Mathematics (2015)","DOI":"10.1137\/1.9781611973730.17"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discret. Algorithms 2(1), 53\u201386 (2004)","journal-title":"J. Discret. Algorithms"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-319-73117-9_45","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"H Alamro","year":"2018","unstructured":"Alamro, H., Ayad, L.A.K., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P.: Longest common prefixes with k-mismatches and applications. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 636\u2013649. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_45"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Alzamel, M., et al.: Efficient computation of sequence mappability. In: Gagie, T., et al. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 12\u201326. Springer, Cham (2018)","DOI":"10.1007\/978-3-030-00479-8_2"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-71147-8_8","volume-title":"Combinatorial Optimization and Applications","author":"M Alzamel","year":"2017","unstructured":"Alzamel, M., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P., Radoszewski, J., Sung, W.-K.: Faster algorithms for 1-mappability of a sequence. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 109\u2013121. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_8"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2016.01.023","volume":"638","author":"A Apostolico","year":"2016","unstructured":"Apostolico, A., Guerra, C., Landau, G.M., Pizzi, C.: Sequence similarity measures based on bounded hamming distance. Theor. Comput. Sci. 638, 76\u201390 (2016). Pattern Matching, Text Data Structures and Compression","journal-title":"Theor. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with bounded hamming distance. In: DCC, pp. 183\u2013192. IEEE (2014)","DOI":"10.1109\/DCC.2014.57"},{"key":"3_CR8","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). https:\/\/doi.org\/10.1007\/10719839_9"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.ejc.2017.07.019","volume":"68","author":"B Bollob\u00e1s","year":"2018","unstructured":"Bollob\u00e1s, B., Letzter, S.: Longest common extension. Eur. J. Comb. 68, 242\u2013248 (2018)","journal-title":"Eur. J. Comb."},{"key":"3_CR10","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":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: STOC, STOC 2004, pp. 91\u2013100. ACM (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"3_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"e30377","DOI":"10.1371\/journal.pone.0030377","volume":"7","author":"T Derrien","year":"2012","unstructured":"Derrien, T., et al.: Fast computation and applications of genome mappability. PLoS ONE 7(1), e30377 (2012)","journal-title":"PLoS ONE"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P Eades","year":"1984","unstructured":"Eades, P., McKay, B.D.: An algorithm for generating subsets of fixed size with a strong minimal change property. Inf. Process. Lett. 19(3), 131\u2013133 (1984)","journal-title":"Inf. Process. Lett."},{"key":"3_CR15","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137\u2013143. IEEE Computer Society (1997)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S Faro","year":"2013","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv 45(2), 13:1\u201313:42 (2013)","journal-title":"ACM Comput. Surv"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the LCP-array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374\u2013385. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22300-6_32"},{"issue":"6\u20138","key":"3_CR18","doi-asserted-by":"publisher","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 $$k$$ mismatches. Inf. Process. Lett. 115(6\u20138), 643\u2013647 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"6\u20138","key":"3_CR19","doi-asserted-by":"publisher","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 $$k$$-mismatches problem. Inf. Process. Lett. 115(6\u20138), 640\u2013642 (2015)","journal-title":"Inf. Process. Lett."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Horwege, S., et al.: Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Res. 42(Webserver-Issue), 7\u201311 (2014)","DOI":"10.1093\/nar\/gku398"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"5660","DOI":"10.1073\/pnas.80.18.5660","volume":"80","author":"S Karlin","year":"1983","unstructured":"Karlin, S., Ghandour, G., Ost, F., T, S., Korn, L.J.: New approaches for computer analysis of nucleic acid sequences. Proc. Natl. Acad. Sci. USA 80, 5660\u20135664 (1983)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"3_CR22","unstructured":"Kociumaka, T., Radoszewski, J., Starikovskaya, T.A.: Longest common substring with approximately $$k$$ mismatches. CoRR, abs\/1712.08573 (2017)"},{"issue":"13","key":"3_CR23","doi-asserted-by":"publisher","first-page":"3672","DOI":"10.1093\/nar\/gkg617","volume":"31","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov, R., Bana, G., Kucherov, G.: MREPS: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res. 31(13), 3672\u20133678 (2003)","journal-title":"Nucleic Acids Res."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-11918-2_14","volume-title":"String Processing and Information Retrieval","author":"G Kucherov","year":"2014","unstructured":"Kucherov, G., Tsur, D.: Improved filters for the approximate suffix-prefix overlap problem. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 139\u2013148. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11918-2_14"},{"issue":"14","key":"3_CR25","doi-asserted-by":"publisher","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":"3_CR26","doi-asserted-by":"crossref","unstructured":"Liang, K.-H.: Bioinformatics for Biomedical Science and Clinical Applications. Woodhead Publishing Series in Biomedicine. Woodhead Publishing (2013)","DOI":"10.1533\/9781908818232"},{"issue":"5","key":"3_CR27","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-23826-5_29","volume-title":"String Processing and Information Retrieval","author":"G Manzini","year":"2015","unstructured":"Manzini, G.: Longest common prefix with mismatches. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 299\u2013310. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_29"},{"issue":"1","key":"3_CR29","first-page":"21","volume":"1","author":"G Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.A.: A hybrid indexing method for approximate string matching. J. Discret. Algorithms 1(1), 21\u201349 (2000)","journal-title":"J. Discret. Algorithms"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: DCC, pp. 193\u2013202. IEEE (2009)","DOI":"10.1109\/DCC.2009.42"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s13015-016-0072-x","volume":"11","author":"C Pizzi","year":"2016","unstructured":"Pizzi, C.: Missmax: alignment-free sequence comparison with mismatches through filtering and heuristics. Algorithms Mol. Biol. 11(1), 6 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"2","key":"3_CR32","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"KR Rasmussen","year":"2006","unstructured":"Rasmussen, K.R., Stoye, J., Myers, E.W.: Efficient $$q$$-gram filters for finding all epsilon-matches over a given length. J. Comput. Biol. 13(2), 296\u2013308 (2006)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"3_CR33","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/S0959-437X(99)00031-3","volume":"9","author":"AF Smit","year":"1999","unstructured":"Smit, A.F.: Interspersed repeats and other mementos of transposable elements in mammalian genomes. Curr. Opin. Genet. Dev. 9(6), 657\u2013663 (1999)","journal-title":"Curr. Opin. Genet. Dev."},{"key":"3_CR34","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":"3_CR35","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."},{"issue":"6","key":"3_CR36","doi-asserted-by":"publisher","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.,"},{"issue":"2","key":"3_CR37","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","volume":"13","author":"I Ulitsky","year":"2006","unstructured":"Ulitsky, I., Burstein, D., Tuller, T., Chor, B.: The average common substring approach to phylogenomic reconstruction. J. Comput. Biol. 13(2), 336\u2013350 (2006)","journal-title":"J. Comput. Biol."},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ic.2012.02.002","volume":"213","author":"N V\u00e4lim\u00e4ki","year":"2012","unstructured":"V\u00e4lim\u00e4ki, N., Ladra, S., M\u00e4kinen, V.: Approximate all-pairs suffix\/prefix overlaps. Inf. Comput. 213, 49\u201358 (2012)","journal-title":"Inf. Comput."},{"issue":"2","key":"3_CR39","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"DE Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space theta(n). Inf. Process. Lett. 17(2), 81\u201384 (1983)","journal-title":"Inf. Process. Lett."}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T08:17:34Z","timestamp":1662020254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}