{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T22:55:20Z","timestamp":1773356120318,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642156458","type":"print"},{"value":"9783642156465","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15646-5_15","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T03:43:52Z","timestamp":1283744632000},"page":"142-151","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Chaining Algorithms"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Abouelhoda","sequence":"first","affiliation":[]},{"given":"Hisham","family":"Mohamed","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jda.2004.08.011","volume":"3","author":"M.I. Abouelhoda","year":"2005","unstructured":"Abouelhoda, M.I., Ohlebusch, E.: Chaining algorithms and applications in comparative genomics. J. Discrete Algorithms\u00a03(2-4), 321\u2013341 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-68530-8_7","volume-title":"Proc. 6th ESA","author":"B. Baker","year":"1998","unstructured":"Baker, B., Giancarlo, R.: Longest common subsequence from fragments via sparse dynamic programming. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 79\u201390. Springer, Heidelberg (1998)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bently, J.L.: K-d trees for semidynamic point sets. In: Proc. of 6th Annual ACM Symposium on Computational Geometry, pp. 187\u2013197 (1990)","DOI":"10.1145\/98524.98564"},{"key":"15_CR4","unstructured":"Deogen, J.S., Yang, J., Ma, F.: EMAGEN: An efficient approach to multiple genome alignment. In: Proc. of Asia-Pacific Bioinf. Conf., pp. 113\u2013122 (2004)"},{"key":"15_CR5","doi-asserted-by":"crossref","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. J. Assoc. Comput. Mach.\u00a039, 519\u2013567 (1992)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"15_CR6","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 Applied Mathematics\u00a074(1), 13\u201332 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"312","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\u00a018(Suppl.\u00a01), 312\u2013320 (2002)","journal-title":"Bioinformatics"},{"issue":"4","key":"15_CR8","first-page":"599","volume":"54","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W., Huang, X.: An O(n\n                  2logn) restriction map comparison and search algorithm. Bulletin of Mathematical Biology\u00a054(4), 599\u2013618 (1992)","journal-title":"Bulletin of Mathematical Biology"},{"key":"15_CR9","unstructured":"Myers, E.W., Miller, W.: Chaining multiple-alignment fragments in sub-quadratic time. In: Proc. of SODA, pp. 38\u201347 (1995)"},{"key":"15_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-39763-2_33","volume-title":"Algorithms in Bioinformatics","author":"S. Shibuya","year":"2003","unstructured":"Shibuya, S., Kurochkin, I.: Match chaining algorithms for cDNA mapping. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 462\u2013475. Springer, Heidelberg (2003)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1186\/1471-2105-7-433","volume":"7","author":"T. Treangen","year":"2006","unstructured":"Treangen, T., Messeguer, X.: M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks. BMC Bioinformatics\u00a07, 433 (2006)","journal-title":"BMC Bioinformatics"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1089\/cmb.1994.1.51","volume":"1","author":"Z. Zhang","year":"1994","unstructured":"Zhang, Z., Raghavachari, B., Hardison, R.C., et al.: Chaining multiple-alignment blocks. J. Computional Biology\u00a01, 51\u201364 (1994)","journal-title":"J. Computional Biology"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in the Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15646-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T09:00:08Z","timestamp":1619773208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15646-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156458","9783642156465"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15646-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}