{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:15:02Z","timestamp":1742980502122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_29","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"353-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Chaining of\u00a0Maximal Exact Matches in\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2035-6309","authenticated-orcid":false,"given":"Nicola","family":"Rizzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0235-6951","authenticated-orcid":false,"given":"Manuel","family":"C\u00e1ceres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4454-1493","authenticated-orcid":false,"given":"Veli","family":"M\u00e4kinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October 2015, pp. 59\u201378. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.14","DOI":"10.1109\/FOCS.2015.14"},{"key":"29_CR2","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Linear-time string indexing and analysis in small space. ACM Trans. Algorithms 16(2), 17:1\u201317:54 (2020). https:\/\/doi.org\/10.1145\/3381417","DOI":"10.1145\/3381417"},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer Science & Business Media, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Bringmann, K., K\u00fcnnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October 2015, pp. 79\u201397. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.15","DOI":"10.1109\/FOCS.2015.15"},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"C\u00e1ceres, M.: Parameterized algorithms for string matching to dags: funnels and beyond. In: Bulteau, L., Lipt\u00e1k, Z. (eds.) 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26\u201328, 2023, Marne-la-Vall\u00e9e, France, France. LIPIcs, vol. 259, pp. 7:1\u20137:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2023.7","DOI":"10.4230\/LIPIcs.CPM.2023.7"},{"key":"29_CR6","unstructured":"Caceres, M., Cairo, M., Mumey, B., Rizzi, R., Tomescu, A.I.: Minimum path cover in parameterized linear time. arXiv preprint arXiv:2211.09659 (2022)"},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"C\u00e1ceres, M., Cairo, M., Mumey, B., Rizzi, R., Tomescu, A.I.: Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time. In: Naor, J.S., Buchbinder, N. (eds.) Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference\/Alexandria, VA, USA, 9\u201312 January 2022, pp. 359\u2013376. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.18","DOI":"10.1137\/1.9781611977073.18"},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Chandra, G., Jain, C.: Sequence to graph alignment using gap-sensitive co-linear chaining. In: Tang, H. (eds.) Research in Computational Molecular Biology. RECOMB 2023. LNCS, vol. 13976, pp. 58\u201373. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-29119-7_4","DOI":"10.1007\/978-3-031-29119-7_4"},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Consortium, T.C.P.G.: Computational pan-genomics: status, promises and challenges. Brief. Bioinform. 19(1), 118\u2013135 (2016). https:\/\/doi.org\/10.1093\/bib\/bbw089","DOI":"10.1093\/bib\/bbw089"},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N.: Graphs can be succinctly indexed for pattern matching in $${O}(\\vert E \\vert ^ 2 + \\vert V \\vert ^{5\/2})$$ time. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) Data Compression Conference, DCC 2022, Snowbird, UT, USA, 22\u201325 March 2022, pp. 272\u2013281. IEEE (2022). https:\/\/doi.org\/10.1109\/DCC52660.2022.00035","DOI":"10.1109\/DCC52660.2022.00035"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2585\u20132599. SIAM (2021)","DOI":"10.1137\/1.9781611976465.153"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-67731-2_44","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"M Equi","year":"2021","unstructured":"Equi, M., M\u00e4kinen, V., Tomescu, A.I.: Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 608\u2013622. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_44"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588334","volume":"19","author":"M Equi","year":"2023","unstructured":"Equi, M., M\u00e4kinen, V., Tomescu, A.I., Grossi, R.: On the complexity of string matching for graphs. ACM Trans. Algorithms 19(3), 1\u201325 (2023)","journal-title":"ACM Trans. Algorithms"},{"key":"29_CR14","doi-asserted-by":"publisher","unstructured":"Kritikakis, G., Tollis, I.G.: Fast reachability using DAG decomposition. In: Georgiadis, L. (ed.) 21st International Symposium on Experimental Algorithms, SEA 2023, July 24\u201326 2023, Barcelona, Spain. LIPIcs, vol. 265, pp. 2:1\u20132:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2023.2","DOI":"10.4230\/LIPIcs.SEA.2023.2"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-020-02168-z","volume":"21","author":"H Li","year":"2020","unstructured":"Li, H., Feng, X., Chu, C.: The design and construction of reference pangenome graphs with minigraph. Genome Biol. 21, 1\u201319 (2020)","journal-title":"Genome Biol."},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Ma, J., C\u00e1ceres, M., Salmela, L., M\u00e4kinen, V., Tomescu, A.I.: Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. bioRxiv (2022). https:\/\/doi.org\/10.1101\/2022.01.07.475257, https:\/\/www.biorxiv.org\/content\/early\/2022\/05\/19\/2022.01.07.475257, to appear in Bioinformatics","DOI":"10.1101\/2022.01.07.475257"},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"M\u00e4kinen, V., Sahlin, K.: Chaining with overlaps revisited. In: G\u00f8rtz, I.L., Weimann, O. (eds.) 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, 17\u201319 June 2020, Copenhagen, Denmark. LIPIcs, vol. 161, pp. 25:1\u201325:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2020.25","DOI":"10.4230\/LIPIcs.CPM.2020.25"},{"key":"29_CR18","doi-asserted-by":"publisher","unstructured":"M\u00e4kinen, V., Tomescu, A.I., Kuosmanen, A., Paavilainen, T., Gagie, T., Chikhi, R.: Sparse dynamic programming on DAGs with small width. ACM Trans. Algorithms 15(2), 29:1\u201329:21 (2019). https:\/\/doi.org\/10.1145\/3301312","DOI":"10.1145\/3301312"},{"key":"29_CR19","doi-asserted-by":"publisher","unstructured":"Rizzo, N., C\u00e1ceres, M., M\u00e4kinen, V.: Chaining of maximal exact matches in graphs. https:\/\/doi.org\/10.48550\/arXiv.2302.01748, preprint of an extended version of SPIRE 2023 paper","DOI":"10.48550\/arXiv.2302.01748"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Rizzo, N., C\u00e1ceres, M., M\u00e4kinen, V.: Finding maximal exact matches in graphs. In: Belazzougui, D., Ouangraoua, A. (eds.) 23rd International Workshop on Algorithms in Bioinformatics, WABI 2023, September 4\u20136 2023, Houston, TX, USA. LIPIcs, vol. 273, pp. 10:1\u201310:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2023.10","DOI":"10.4230\/LIPIcs.WABI.2023.10"},{"issue":"10","key":"29_CR21","doi-asserted-by":"publisher","first-page":"3008","DOI":"10.1007\/s00453-022-00989-x","volume":"84","author":"N Rizzo","year":"2022","unstructured":"Rizzo, N., Tomescu, A.I., Policriti, A.: Solving string problems on graphs using the labeled direct product. Algorithmica 84(10), 3008\u20133033 (2022)","journal-title":"Algorithmica"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-39763-2_33","volume-title":"Algorithms in Bioinformatics","author":"T Shibuya","year":"2003","unstructured":"Shibuya, T., Kurochkin, I.: Match chaining algorithms for cDNA mapping. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS, vol. 2812, pp. 462\u2013475. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39763-2_33"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:04:42Z","timestamp":1695125082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"66% - 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","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":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}