{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:25Z","timestamp":1780743685217,"version":"3.54.1"},"publisher-location":"Cham","reference-count":37,"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_13","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"153-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Colored Longest Common Prefix Array Computed via Sequential Scans"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Garofalo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Davide","family":"Verzotto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"13_CR1","unstructured":"https:\/\/github.com\/giovannarosone\/cLCP-mACS"},{"key":"13_CR2","unstructured":"https:\/\/github.com\/BEETL\/BEETL"},{"key":"13_CR3","unstructured":"https:\/\/github.com\/giovannarosone\/BCR_LCP_GSA"},{"key":"13_CR4","unstructured":"https:\/\/github.com\/felipelouza\/egsa"},{"key":"13_CR5","unstructured":"https:\/\/github.com\/felipelouza\/egap"},{"key":"13_CR6","unstructured":"http:\/\/kmacs.gobics.de\/"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with bounded hamming distance. In: Data Compression Conference, DCC 2014, pp. 183\u2013192. IEEE (2014)","DOI":"10.1109\/DCC.2014.57"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"M Bauer","year":"2013","unstructured":"Bauer, M., Cox, A., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comput. Sci. 483, 134\u2013148 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","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"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-67428-5_14","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2017","unstructured":"Belazzougui, D., Cunial, F.: Fast label extraction in the CDAWG. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 161\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_14"},{"key":"13_CR11","unstructured":"Burrows, M., Wheeler, D.: A block sorting data compression algorithm. Technical report, DEC Systems Research Center (1994)"},{"issue":"4","key":"13_CR12","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"},{"issue":"8","key":"13_CR13","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1089\/cmb.2012.0122","volume":"19","author":"E Cohen","year":"2012","unstructured":"Cohen, E., Chor, B.: Detecting phylogenetic signals in eukaryotic whole genome sequences. J. Comput. Biol. 19(8), 945\u2013956 (2012)","journal-title":"J. Comput. Biol."},{"issue":"12","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1089\/cmb.2010.0171","volume":"18","author":"M Comin","year":"2011","unstructured":"Comin, M., Verzotto, D.: The irredundant class method for remote homology detection of protein sequences. J. Comput. Biol. 18(12), 1819\u20131829 (2011)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1186\/1748-7188-7-34","volume":"7","author":"M Comin","year":"2012","unstructured":"Comin, M., Verzotto, D.: Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms Mol. Biol. 7(1), 34 (2012)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Comin, M., Verzotto, D.: Whole-genome phylogeny by virtue of unic subwords. In: DEXA, pp. 190\u2013194. IEEE (2012)","DOI":"10.1109\/DEXA.2012.10"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Comin, M., Verzotto, D.: Comparing, ranking and filtering motifs with character classes: application to biological sequences analysis. In: Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data, chap. 13. Wiley (2013)","DOI":"10.1002\/9781118617151.ch13"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"352","DOI":"10.3390\/a6020352","volume":"6","author":"M Comin","year":"2013","unstructured":"Comin, M., Verzotto, D.: Filtering degenerate patterns with application to protein sequence analysis. Algorithms 6(2), 352\u2013370 (2013)","journal-title":"Algorithms"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/TCBB.2014.2306830","volume":"11","author":"M Comin","year":"2014","unstructured":"Comin, M., Verzotto, D.: Beyond fixed-resolution alignment-free measures for mammalian enhancers sequence comparison. IEEE\/ACM Trans. Comput. Biol. Bioinform. 11(4), 628\u2013637 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jda.2016.03.003","volume":"37","author":"AJ Cox","year":"2016","unstructured":"Cox, A.J., Garofalo, F., Rosone, G., Sciortino, M.: Lightweight LCP construction for very large collections of strings. J. Discret. Algorithms 37, 17\u201333 (2016)","journal-title":"J. Discret. Algorithms"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-33122-0_17","volume-title":"Algorithms in Bioinformatics","author":"AJ Cox","year":"2012","unstructured":"Cox, A.J., Jakobi, T., Rosone, G., Schulz-Trieglaff, O.B.: Comparing DNA sequence collections by direct comparison of compressed text indexes. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 214\u2013224. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_17"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Egidi, L., Louza, F.A., Manzini, G., Telles, G.P.: External memory BWT and LCP computation for sequence collections with applications. ArXiv e-prints (2018)","DOI":"10.1186\/s13015-019-0140-0"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2017.06.017","volume":"698","author":"U Ferraro Petrillo","year":"2017","unstructured":"Ferraro Petrillo, U., Guerra, C., Pizzi, C.: A new distributed alignment-free approach to compare whole proteomes. Theor. Comput. Sci. 698, 100\u2013112 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR24","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)"},{"issue":"14","key":"13_CR25","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","volume":"30","author":"CA Leimeister","year":"2014","unstructured":"Leimeister, C.A., Morgenstern, B.: Kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics 30(14), 2000\u20132008 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1186\/s13015-017-0117-9","volume":"12","author":"F Louza","year":"2017","unstructured":"Louza, F., Telles, G., Hoffmann, S., Ciferri, C.: Generalized enhanced suffix array construction in external memory. Algorithms Mol. Biol. 12(1), 26 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR27","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 319\u2013327. Society for Industrial and Applied Mathematics (1990)"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler transform. Theor. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"13_CR29","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-9078-6","volume":"42","author":"S Mantaci","year":"2008","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new combinatorial approach to sequence comparison. Theory Comput. Syst. 42(3), 411\u2013429 (2008)","journal-title":"Theory Comput. Syst."},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-16321-0_36","volume-title":"String Processing and Information Retrieval","author":"E Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Gog, S., K\u00fcgel, A.: Computing matching statistics and maximal exact matches on compressed full-text indexes. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 347\u2013358. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_36"},{"key":"13_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, 6 (2016)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-92182-0_14","volume-title":"Algorithms and Computation","author":"SJ Puglisi","year":"2008","unstructured":"Puglisi, S.J., Turpin, A.: Space-time tradeoffs for longest-common-prefix array computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 124\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_14"},{"issue":"21","key":"13_CR33","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1093\/bioinformatics\/btt462","volume":"29","author":"J Ren","year":"2013","unstructured":"Ren, J., Song, K., Sun, F., Deng, M., Reinert, G.: Multiple alignment-free sequence comparison. Bioinformatics 29(21), 2690\u20132698 (2013)","journal-title":"Bioinformatics"},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589\u2013607 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"13_CR35","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1089\/cmb.2015.0217","volume":"23","author":"S Thankachan","year":"2016","unstructured":"Thankachan, S., Chockalingam, S., 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":"13_CR36","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."},{"issue":"1","key":"13_CR37","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1186\/s13059-017-1319-7","volume":"18","author":"A Zielezinski","year":"2017","unstructured":"Zielezinski, A., Vinga, S., Almeida, J., Karlowski, W.: Alignment-free sequence comparison: benefits, applications, and tools. Genome Biol. 18(1), 186 (2017)","journal-title":"Genome 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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T01:17:09Z","timestamp":1571879829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_13","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"}}]}}