{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:59:28Z","timestamp":1742925568678,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031368042"},{"type":"electronic","value":"9783031368059"}],"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-36805-9_11","type":"book-chapter","created":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:03:04Z","timestamp":1688079784000},"page":"152-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for\u00a0the\u00a0de Bruijn Graph Sequence Mapping Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9606-2569","authenticated-orcid":false,"given":"Lucas B.","family":"Rocha","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-7441","authenticated-orcid":false,"given":"Said Sadique","family":"Adi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8015-6237","authenticated-orcid":false,"given":"Eloi","family":"Araujo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/jagm.1999.1063","volume":"35","author":"A Amir","year":"1997","unstructured":"Amir, A., et al.: Pattern matching in hypertext. J. Algor. 35, 82\u201399 (1997)","journal-title":"J. Algor."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-1103-9","volume":"17","author":"A Limasset","year":"2016","unstructured":"Limasset, A., et al.: Read mapping on de bruijn graphs. BMC Bioinf. 17(1), 1\u201312 (2016)","journal-title":"BMC Bioinf."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1089\/cmb.2019.0066","volume":"27","author":"C Jain","year":"2019","unstructured":"Jain, C., et al.: On the complexity of sequence-to-graph alignment. J. Comput. Biol. 27, 640\u2013654 (2019)","journal-title":"J. Comput. Biol."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1089\/cmb.2022.0411","volume":"29","author":"D Gibney","year":"2022","unstructured":"Gibney, D., Thankachan, S., Aluru, S.: On the hardness of sequence alignment on De Bruijn graphs. J. Comput. Biol. 29, 1377\u20131396 (2022)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1038\/nbt.4227","volume":"36","author":"E Garrison","year":"2018","unstructured":"Garrison, E., et al.: Variation graph toolkit improves read mapping by representing genetic variation in the reference. Nat. Biotechnol. 36, 875\u2013879 (2018)","journal-title":"Nat. Biotechnol."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: The fragment assembly string graph. Bioinformatics (2005)","DOI":"10.1093\/bioinformatics\/bti1114"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/S0304-3975(99)00333-3","volume":"237","author":"G Navarro","year":"1998","unstructured":"Navarro, G.: Improved approximate pattern matching on hypertext. Theor. Comput. Sci. 237, 455\u2013463 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-020-02135-8","volume":"21","author":"G Holley","year":"2020","unstructured":"Holley, G., Melsted, P.: Bifrost: highly parallel construction and indexing of colored and compacted de bruijn graphs. Genome Biol. 21, 1\u201320 (2020)","journal-title":"Genome Biol."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1093\/bib\/bbq015","volume":"11","author":"H Li","year":"2010","unstructured":"Li, H., Homer, N.: A survey of sequence alignment algorithms for next-generation sequencing. Brief Bioinf. 11, 473\u2013483 (2010)","journal-title":"Brief Bioinf."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-60044-2_51","volume-title":"Combinatorial Pattern Matching","author":"K Park","year":"1995","unstructured":"Park, K., Kim, D.K.: String matching in hypertext. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 318\u2013329. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60044-2_51"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Rautiainen, M., Marschall, T.: Aligning sequences to general graphs in o $$(v + me)$$ time. In: bioRxiv, pp. 216\u2013127 (2017)","DOI":"10.1101\/216127"},{"key":"11_CR13","unstructured":"De Bruijn, N.G.: A combinatorial problem. In: Proceedings of Koninklijke Nederlandse Academie van Wetenschappen, vol. 49, pp. 758\u2013764 (1946)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., et al.: An eulerian path approach to dna fragment assembly. Proc. Natl. Acad. Sci. 98, 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Akutsu, T.: A linear time pattern matching algorithm between a string and a tree. In: Annual Symposium on Combinatorial Pattern Matching, pp. 1\u201310 (1993)","DOI":"10.1007\/BFb0029792"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Manber, U., Wu, S.: Approximate string matching with arbitrary costs for text and hypertext. In: Advances in Structural and Syntactic Pattern Recognition, pp. 22\u201333. World Scientific (1992)","DOI":"10.1142\/9789812797919_0002"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36805-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:04:15Z","timestamp":1688079855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36805-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368042","9783031368059"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36805-9_11","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":"30 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","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":"67","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":"13","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":"24% - 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":"2.5","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":"8,5","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)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}