{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:55Z","timestamp":1725491875015},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_1","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Abouelhoda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2-4","key":"1_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":"1_CR2","volume-title":"Handbook of Computational Molecular Biology","author":"M.I. Abouelhoda","year":"2006","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Enhanced suffix arrays and applicationss. In: Handbook of Computational Molecular Biology, CRC Press, Boca Raton (2006)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/98524.98564","volume-title":"Proc. of 6th Annual ACM Symposium on Computational Geometry","author":"J.L. Bently","year":"1990","unstructured":"Bently, J.L.: K-d trees for semidynamic point sets. In: Proc. of 6th Annual ACM Symposium on Computational Geometry, pp. 187\u2013197. ACM Press, New York (1990)"},{"issue":"4\/5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W.I. Chang","year":"1994","unstructured":"Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica\u00a012(4\/5), 327\u2013344 (1994)","journal-title":"Algorithmica"},{"key":"1_CR5","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":"1_CR6","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. I: linear cost functions; II: convex and concave cost functions. J. Assoc. Comput. Mach.\u00a039, 519\u2013567 (1992)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1101\/gr.8.9.967","volume":"8","author":"L. Florea","year":"1998","unstructured":"Florea, L., Hartzell, G., Zhang, Z., Rubin, G., Miller, W.: A computer program for aligning a cDNA sequence with a genomic DNA sequence. Genome Research\u00a08, 967\u2013974 (1998)","journal-title":"Genome Research"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1101\/gr.229202. Article published online before March 2002","volume":"12","author":"W.J. Kent","year":"2002","unstructured":"Kent, W.J.: BLAT\u2014the BLAST-like alignment tool. Genome Research\u00a012, 656\u2013664 (2002)","journal-title":"Genome Research"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Messeguer, X., Treangen, T.: M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species. BMC Bioinformatics\u00a07(433) (2006)","DOI":"10.1186\/1471-2105-7-433"},{"key":"1_CR10","unstructured":"Myers, E.W., Miller, W.: Chaining multiple-alignment fragments in sub-quadratic time. In: Proc. of SODA, pp. 38\u201347 (1995)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E., Kurtz, S.: Space efficient computation of rare maximal exact matches between multiple sequences (submitted, 2007)","DOI":"10.1089\/cmb.2007.0105"},{"key":"1_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","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":"1_CR13","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","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:14Z","timestamp":1619518994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_1","relation":{},"subject":[]}}