{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:49Z","timestamp":1725892609559},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_30","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"275-286","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters"],"prefix":"10.1007","author":[{"given":"Trong Dao","family":"Le","sequence":"first","affiliation":[]},{"given":"Melvin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hon Wai","family":"Leong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.tcs.2004.02.036","volume":"320","author":"M.P. B\u00e9al","year":"2004","unstructured":"B\u00e9al, M.P., Bergeron, A., Corteel, S., Raffinot, M.: An algorithmic view of gene teams. Theoretical Computer Science\u00a0320(2-3), 395\u2013418 (2004)","journal-title":"Theoretical Computer Science"},{"key":"30_CR2","unstructured":"Bentley, J.: Solutions to Klee\u2019s rectangle problems. Unpublished manuscript, Dept. of Comp. Sci., Carnegie-Mellon University, Pittsburgh (1977)"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.jda.2006.03.021","volume":"5","author":"G. Didier","year":"2007","unstructured":"Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. Journal of Discrete Algorithms\u00a05(2), 330\u2013340 (2007)","journal-title":"Journal of Discrete Algorithms"},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1089\/cmb.2005.12.638","volume":"12","author":"X. He","year":"2005","unstructured":"He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of homology families. Journal of Computational Biology\u00a012(6), 638\u2013656 (2005)","journal-title":"Journal of Computational Biology"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Combinatorial Pattern Matching","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 207\u2013218. Springer, Heidelberg (2001)"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/bioinformatics\/btm585","volume":"24","author":"G. Moreno-Hagelsieb","year":"2008","unstructured":"Moreno-Hagelsieb, G., Latimer, K.: Choosing BLAST options for better detection of orthologs as reciprocal best hits. Bioinformatics\u00a024(3), 319 (2008)","journal-title":"Bioinformatics"},{"issue":"6","key":"30_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.gde.2003.10.006","volume":"13","author":"D. Sankoff","year":"2003","unstructured":"Sankoff, D.: Rearrangements and chromosomal evolution. Current Opinion in Genetics & Development\u00a013(6), 583\u2013587 (2003)","journal-title":"Current Opinion in Genetics & Development"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/nar\/29.1.22","volume":"29","author":"R.L. Tatusov","year":"2001","unstructured":"Tatusov, R.L., Natale, D.A., Garkavtsev, I.V., Tatusova, T.A., Shankavaram, U.T., Rao, B.S., Kiryutin, B., Galperin, M.Y., Fedorova, N.D., Koonin, E.V.: The COG database: new developments in phylogenetic classification of proteins from complete genomes. Nucleic Acids Research\u00a029(1), 22\u201328 (2001)","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica\u00a026(2), 290\u2013309 (2000)","journal-title":"Algorithmica"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, M., Leong, H.W.: Bidirectional best hit r-window gene clusters. BMC Bioinformatics\u00a011(suppl. 1), S63 (2010)","DOI":"10.1186\/1471-2105-11-S1-S63"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T00:53:40Z","timestamp":1548464020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}