{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:31:31Z","timestamp":1725564691228},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335174"},{"type":"electronic","value":"9783642335181"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33518-1_26","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T08:17:23Z","timestamp":1347092243000},"page":"214-223","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Distributed Computation of Maximal Exact Matches"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Abouelhoda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sondos","family":"Seif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45784-4_35","volume-title":"Algorithms in Bioinformatics","author":"M.I. Abouelhoda","year":"2002","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: The Enhanced Suffix Array and Its Applications to Genome Analysis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 449\u2013463. Springer, Heidelberg (2002)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1186\/1471-2105-9-476","volume":"9","author":"M.I. Abouelhoda","year":"2008","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: CoCoNUT: An efficient system for the comparison and analysis of genomes. BMC Bioinformatics\u00a09, 476 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1093\/nar\/29.1.126","volume":"29","author":"A. Bernal","year":"2001","unstructured":"Bernal, A., Ear, U., Kyrpide, N.: Genomes OnLine Database (GOLD): A monitor of genome projects world-wide. Nucleic Acids Research\u00a029(1), 126\u2013127 (2001)","journal-title":"Nucleic Acids Research"},{"issue":"11","key":"26_CR5","first-page":"2478","volume":"30","author":"A.L. Delcher","year":"2002","unstructured":"Delcher, A.L., Phillippy, A., Carlton, J., Salzberg, S.L.: Fast algorithms for large-scale genome alignment and comparison. Genome Research\u00a030(11), 2478\u20132483 (2002)","journal-title":"Genome Research"},{"key":"26_CR6","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":"26_CR7","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"suppl. 1","key":"26_CR8","doi-asserted-by":"publisher","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. 1), S312\u2013S320 (2002)","journal-title":"Bioinformatics"},{"issue":"13","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1093\/bioinformatics\/btp275","volume":"25","author":"Z. Khan","year":"2009","unstructured":"Khan, Z., Bloom, J.S., Kruglyak, L., Singh, M.: A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics\u00a025(13), 1609\u20131616 (2009)","journal-title":"Bioinformatics"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S. Kurtz","year":"2004","unstructured":"Kurtz, S., Phillippy, A., Delcher, A.L., et al.: Versatile and open software for comparing large genomes. Genome Biology\u00a05(2), R12+ (2004)","journal-title":"Genome Biology"},{"key":"26_CR11","unstructured":"Ohlebusch, E., Gog, S.: Space-efficient genome comparisons with compressed full-text indexes. In: BICoB, pp. 19\u201324 (2010)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E., Kurtz, S.: Space efficient computation of rare maximal exact matches between multiple sequences. J. Comp. Biol.\u00a015(4) (2008)","DOI":"10.1089\/cmb.2007.0105"},{"key":"26_CR13","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":"T. Shibuya","year":"2003","unstructured":"Shibuya, T., 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":"26_CR14","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1186\/1471-2105-7-433","volume":"7","author":"T.J. Treangen","year":"2006","unstructured":"Treangen, T.J., Messeguer, X.: M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks. BMC Bioinformatics\u00a07, 433 (2006)","journal-title":"BMC Bioinformatics"}],"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-33518-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:14:13Z","timestamp":1620116053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33518-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335174","9783642335181"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33518-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}