{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:42:54Z","timestamp":1769838174568,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031078019","type":"print"},{"value":"9783031078026","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07802-6_37","type":"book-chapter","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T11:04:18Z","timestamp":1654599858000},"page":"436-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["KFinger: Capturing Overlaps Between Long Reads by\u00a0Using Lyndon Fingerprints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7289-4988","authenticated-orcid":false,"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9000-3664","authenticated-orcid":false,"given":"Alessia","family":"Petescia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8479-7592","authenticated-orcid":false,"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9730-7516","authenticated-orcid":false,"given":"Raffaella","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9089-5957","authenticated-orcid":false,"given":"Rocco","family":"Zaccagnino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9144-3074","authenticated-orcid":false,"given":"Rosalba","family":"Zizza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,8]]},"reference":[{"issue":"2","key":"37_CR1","first-page":"202","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside\u2019s problem. Trans. Am. Math. Soc. 77(2), 202\u2013215 (1954)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.ejc.2005.07.019","volume":"28","author":"J Berstel","year":"2007","unstructured":"Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Comb. 28(3), 996\u20131022 (2007)","journal-title":"Eur. J. Comb."},{"issue":"16","key":"37_CR3","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20","author":"O Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: Star: an algorithm to search for tandem approximate repeats. Bioinformatics 20(16), 2812\u20132820 (2004)","journal-title":"Bioinformatics"},{"issue":"3","key":"37_CR4","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. Theoret. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-40608-0_27","volume-title":"Language and Automata Theory and Applications","author":"P Bonizzoni","year":"2020","unstructured":"Bonizzoni, P., De Felice, C., Zaccagnino, R., Zizza, R.: Lyndon words versus inverse lyndon words: queries on suffixes and bordered words. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 385\u2013396. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_27"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV. the quotient groups of the lower central series. Ann. Math. 68(1), 81\u201395 (1958)","DOI":"10.2307\/1970044"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. In: Proceedings of the National Academy of Sciences, vol. 98, no. 17, pp. 9748\u20139753. National Academy of Sciences (2001)","DOI":"10.1073\/pnas.171285098"},{"issue":"6","key":"37_CR8","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1038\/nbt.3238","volume":"33","author":"K Berlin","year":"2015","unstructured":"Berlin, K., Koren, S., Chin, C.-S., Drake, J.P., Landolin, J.M., Phillippy, A.M.: Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nat. Biotechnol. 33(6), 623\u2013630 (2015)","journal-title":"Nat. Biotechnol."},{"issue":"8","key":"37_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1038\/nmeth.3444","volume":"12","author":"NJ Loman","year":"2015","unstructured":"Loman, N.J., Quick, J., Simpson, J.T.: A complete bacterial genome assembled de novo using only nanopore sequencing data. Nat. Methods 12(8), 733\u2013735 (2015)","journal-title":"Nat. Methods"},{"issue":"7","key":"37_CR10","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1089\/cmb.2018.0036","volume":"25","author":"C Jain","year":"2018","unstructured":"Jain, C., Dilthey, A., Koren, S., Aluru, S., Phillippy, A.M.: A fast approximate algorithm for mapping long reads to large reference databases. J. Comput. Biol. 25(7), 766\u2013779 (2018)","journal-title":"J. Comput. Biol."},{"key":"37_CR11","unstructured":"Broder, A.: On the resemblance and containment of documents. In: Proceedings. Compression and Complexity of SEQUENCES, pp. 21\u201329. IEEE Computer Society (1997)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Pierce, N.T., Irber, L., Reiter, T., Brooks, P., Brown, C.T.: Large-scale sequence comparisons with sourmash. F1000Research 8, 1006 (2019)","DOI":"10.12688\/f1000research.19675.1"},{"issue":"5","key":"37_CR13","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1101\/gr.215087.116","volume":"27","author":"S Koren","year":"2017","unstructured":"Koren, S., Walenz, B.P., Berlin, K., Miller, J.R., Bergman, N.H., Phillippy, A.M.: Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation. Genome Res. 27(5), 722\u2013736 (2017)","journal-title":"Genome Res."},{"issue":"18","key":"37_CR14","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","volume":"34","author":"H Li","year":"2018","unstructured":"Li, H.: MiniMap2: pairwise alignment for nucleotide sequences. Bioinformatics 34(18), 3094\u20133100 (2018)","journal-title":"Bioinformatics"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-030-74432-8_2","volume-title":"Algorithms for Computational Biology","author":"P Bonizzoni","year":"2021","unstructured":"Bonizzoni, P., et al.: Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning. In: Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A., Wheeler, T. (eds.) AlCoB 2021. LNCS, vol. 12715, pp. 16\u201328. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-74432-8_2"},{"issue":"17","key":"37_CR16","doi-asserted-by":"publisher","first-page":"i567","DOI":"10.1093\/bioinformatics\/btw466","volume":"32","author":"S Girotto","year":"2016","unstructured":"Girotto, S., Pizzi, C., Comin, M.: MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures. Bioinformatics 32(17), i567\u2013i575 (2016)","journal-title":"Bioinformatics"},{"issue":"17","key":"37_CR17","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1093\/bioinformatics\/bty223","volume":"34","author":"Y Li","year":"2018","unstructured":"Li, Y., Han, R., Bi, C., Li, M., Wang, S., Gao, X.: DeepSimulator: a deep simulator for Nanopore sequencing. Bioinformatics 34(17), 2899\u20132908 (2018)","journal-title":"Bioinformatics"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.aam.2018.08.005","volume":"101","author":"P Bonizzoni","year":"2018","unstructured":"Bonizzoni, P., De Felice, C., Zaccagnino, R., Zizza, R.: Inverse Lyndon words and inverse Lyndon factorizations of words. Adv. Appl. Math. 101, 281\u2013319 (2018)","journal-title":"Adv. Appl. Math."},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2020.10.034","volume":"862","author":"P Bonizzoni","year":"2021","unstructured":"Bonizzoni, P., De Felice, C., Zaccagnino, R., Zizza, R.: On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties. Theoret. Comput. Sci. 862, 24\u201341 (2021)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics and Biomedical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07802-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T23:11:24Z","timestamp":1655680284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07802-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031078019","9783031078026"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07802-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWBBIO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Work-Conference on Bioinformatics and Biomedical Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gran Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwbbio2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwbbio.ugr.es\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - 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 (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}