{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:05:07Z","timestamp":1773270307957,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031047480","type":"print"},{"value":"9783031047497","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-04749-7_15","type":"book-chapter","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:13:24Z","timestamp":1652285604000},"page":"246-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Co-linear Chaining with\u00a0Overlaps and\u00a0Gap Costs"],"prefix":"10.1007","author":[{"given":"Chirag","family":"Jain","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Gibney","sequence":"additional","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"issue":"2\u20134","key":"15_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jda.2004.08.011","volume":"3","author":"M Abouelhoda","year":"2005","unstructured":"Abouelhoda, M., Ohlebusch, E.: Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3(2\u20134), 321\u2013341 (2005)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1186\/1471-2105-9-476","volume":"9","author":"MI Abouelhoda","year":"2008","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinf. 9(1), 476 (2008). https:\/\/doi.org\/10.1186\/1471-2105-9-476","journal-title":"BMC Bioinf."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pp. 51\u201358 (2015)","DOI":"10.1145\/2746539.2746612"},{"key":"15_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1101\/gr.789803","volume":"13","author":"N Bray","year":"2003","unstructured":"Bray, N., Dubchak, I., Pachter, L.: AVID: a global alignment program. Genome Res. 13(1), 97\u2013102 (2003)","journal-title":"Genome Res."},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1186\/1471-2105-13-238","volume":"13","author":"MJ Chaisson","year":"2012","unstructured":"Chaisson, M.J., Tesler, G.: Mapping single molecule sequencing reads using basic local alignment with successive refinement ((BLASR): application and theory. BMC Bioinf. 13(1), 238 (2012). https:\/\/doi.org\/10.1186\/1471-2105-13-238","journal-title":"BMC Bioinf."},{"issue":"11","key":"15_CR7","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"AL Delcher","year":"1999","unstructured":"Delcher, A.L., Kasif, S., et al.: Alignment of whole genomes. Nucleic Acids Res. 27(11), 2369\u20132376 (1999)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/146637.146650","volume":"39","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming i: linear cost functions. J. ACM (JACM) 39(3), 519\u2013545 (1992)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/146637.146656","volume":"39","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D., Galil, Z., et al.: Sparse dynamic programming ii: convex and concave cost functions. J.. ACM (JACM) 39(3), 546\u2013567 (1992)","journal-title":"J.. ACM (JACM)"},{"key":"15_CR10","unstructured":"Hoppenworth, G., Bentley, J.W., Gibney, D., Thankachan, S.V.: The fine-grained complexity of median and center string problems under edit distance. In: 28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy, vol. 173, pp. 61:1\u201361:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Jain, C., Gibney, D., Thankachan, S.V.: Co-linear chaining with overlaps and gap costs. bioRxiv (2021). https:\/\/doi.org\/10.1101\/2021.02.03.429492","DOI":"10.1101\/2021.02.03.429492"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Jain, C., Rhie, A., Hansen, N., Koren, S., Phillippy, A.M.: A long read mapping method for highly repetitive reference sequences. bioRxiv (2020)","DOI":"10.1101\/2020.11.01.363887"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kalikar, S., Jain, C., Md, V., Misra, S.: Accelerating long-read analysis on modern CPUs. bioRxiv (2021)","DOI":"10.1101\/2021.07.21.453294"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S Kurtz","year":"2004","unstructured":"Kurtz, S., et al.: Versatile and open software for comparing large genomes. Genome Biol. 5(2), R12 (2004)","journal-title":"Genome Biol."},{"issue":"18","key":"15_CR15","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"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"265","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), 265 (2020). https:\/\/doi.org\/10.1186\/s13059-020-02168-z","journal-title":"Genome Biol."},{"key":"15_CR17","unstructured":"M\u00e4kinen, V., Sahlin, K.: Chaining with overlaps revisited. In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, 17\u201319 June 2020, Copenhagen, Denmark, vol. 161, pp. 25:1\u201325:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/3301312","volume":"15","author":"V M\u00e4kinen","year":"2019","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-29:21 (2019). https:\/\/doi.org\/10.1145\/3301312","journal-title":"ACM Trans. Algorithms"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Mar\u00e7ais, G., Delcher, A.L., et al.: MUMmer4: a fast and versatile genome alignment system. PLoS Comput. Biol. 14(1), e1005944 (2018)","DOI":"10.1371\/journal.pcbi.1005944"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Morgenstern, B.: A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Appl. Math. Lett. 15(1), 11\u201316 (2002)","DOI":"10.1016\/S0893-9659(01)00085-4"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM (JACM) 46(3), 395\u2013415 (1999)","DOI":"10.1145\/316542.316550"},{"key":"15_CR22","unstructured":"Myers, G., Miller, W.: Chaining multiple-alignment fragments in sub-quadratic time. In: SODA. vol. 95, pp. 38\u201347 (1995)"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Otto, C., Hoffmann, S., Gorodkin, J., Stadler, P.F.: Fast local fragment chaining using sum-of-pair gap costs. Algorithms Mol. Biol. 6(1), 4 (2011). https:\/\/doi.org\/10.1186\/1748-7188-6-4","DOI":"10.1186\/1748-7188-6-4"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Ren, J., Chaisson, M.J.: lra: a long read aligner for sequences and contigs. PLOS Comput. Biol. 17(6), e1009078 (2021)","DOI":"10.1371\/journal.pcbi.1009078"},{"issue":"24","key":"15_CR25","doi-asserted-by":"publisher","first-page":"4643","DOI":"10.1093\/bioinformatics\/btab540","volume":"37","author":"K Sahlin","year":"2021","unstructured":"Sahlin, K., M\u00e4kinen, V.: Accurate spliced alignment of long RNA sequencing reads. Bioinformatics 37(24), 4643\u20134651 (2021)","journal-title":"Bioinformatics"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Schleimer, S., Wilkerson, D.S., Aiken, A.: Winnowing: local algorithms for document fingerprinting. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 76\u201385 (2003)","DOI":"10.1145\/872757.872770"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Sedlazeck, F.J., et al.: Accurate detection of complex structural variations using single-molecule sequencing. Nat. Methods 15(6), 461\u2013468 (2018)","DOI":"10.1038\/s41592-018-0001-7"},{"key":"15_CR28","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-540-39763-2_33"},{"issue":"9","key":"15_CR29","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1093\/bioinformatics\/btw753","volume":"33","author":"M \u0160o\u0161i\u0107","year":"2017","unstructured":"\u0160o\u0161i\u0107, M., \u0160iki\u0107, M.: Edlib: a C\/C++ library for fast, exact sequence alignment using edit distance. Bioinformatics 33(9), 1394\u20131395 (2017)","journal-title":"Bioinformatics"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Inf. Control 64(1\u20133), 100\u2013118 (1985)","DOI":"10.1016\/S0019-9958(85)80046-2"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Uricaru, R., et al.: Novel definition and algorithm for chaining fragments with proportional overlaps. J. Comput. Biol. 18(9), 1141\u20131154 (2011)","DOI":"10.1089\/cmb.2011.0126"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Vyverman, M., De Baets, B., et al.: essaMEM: finding maximal exact matches using enhanced sparse suffix arrays. Bioinformatics 29(6), 802\u2013804 (2013)","DOI":"10.1093\/bioinformatics\/btt042"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Wilbur, W.J., Lipman, D.J.: Rapid similarity searches of nucleic acid and protein data banks. Proc. Natl. Acad. Sci. 80(3), 726\u2013730 (1983)","DOI":"10.1073\/pnas.80.3.726"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04749-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T23:06:16Z","timestamp":1652310376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04749-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031047480","9783031047497"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04749-7_15","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":"29 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Diego, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"22 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2022.net\/","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":"188","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":"17","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":"23","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":"9% - 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.2","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":"6.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)"}}]}}