{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:08:25Z","timestamp":1743145705784,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23826-5_12","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"116-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Julien","family":"Allali","sequence":"first","affiliation":[]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[]},{"given":"Laetitia","family":"Bourgeade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jda.2004.08.011","volume":"3","author":"MI Abouelhoda","year":"2005","unstructured":"Abouelhoda, M.I., Ohlebusch, E.: Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3, 321\u2013341 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Allali, J., Bourgeade, L., Chauve, C.: Chaining fragments in sequences: to sweep or not. CoRR abs\/1506.07458 (2015)","DOI":"10.1007\/978-3-319-23826-5_12"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-40104-6_4","volume-title":"Algorithms and Data Structures","author":"L Arge","year":"2013","unstructured":"Arge, L., Fischer, J., Sanders, P., Sitchinava, N.: On (Dynamic) Range Minimum Queries in External Memory. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 37\u201348. Springer, Heidelberg (2013)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming. I: linear cost functions; II: convex and concave cost functions. J. Assoc. Comput. Mach. 39, 519\u2013567 (1992)","DOI":"10.1145\/146637.146656"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(96)00013-3","volume":"74","author":"S Felsner","year":"1997","unstructured":"Felsner, S., M\u00fcller, R., Wernisch, L.: Trapezoid graphs and generalizations, geometry and algorithms. Discrete Appl. Math. 74, 13\u201332 (1997)","journal-title":"Discrete Appl. Math."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"S312","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312","volume":"18","author":"M H\u00f6hl","year":"2002","unstructured":"H\u00f6hl, M., Kurtz, S., Ohlebusch, E.: Efficient multiple genome alignment. Bioinformatics 18, S312\u2013S320 (2002)","journal-title":"Bioinformatics"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Joseph, D., Meidanis, J., Tiwari, P.: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol. 621, pp. 326\u2013337. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-55706-7_29"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0893-9659(01)00085-4","volume":"15","author":"B Morgenstern","year":"2002","unstructured":"Morgenstern, B.: A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences. Appl. Math. Lett. 15, 11\u201316 (2002)","journal-title":"Appl. Math. Lett."},{"key":"12_CR10","first-page":"38","volume":"1995","author":"G Myers","year":"1995","unstructured":"Myers, G., Miller, W.: Chaining multiple-alignmment fragments in sub-quadratic time. SODA 1995, 38\u201347 (1995)","journal-title":"SODA"},{"key":"12_CR11","first-page":"599","volume":"54","author":"G Myers","year":"1992","unstructured":"Myers, G., Huang, X.: An $$O(N^2\\log N)$$ restriction map comparison and search algorithm. Bull. Math. Biol. 54, 599\u2013618 (1992)","journal-title":"Bull. Math. Biol."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E., Abouelhoda, M.I.: Chaining Algorithms and Applications in Comparative Genomics. In: Aluru, S. (ed.) Handbook of Computational Molecular Biology. CRC Press (2005)","DOI":"10.1201\/9781420036275.ch15"}],"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-319-23826-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:38:47Z","timestamp":1675874327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}