{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:20:56Z","timestamp":1742973656541,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047435"},{"type":"electronic","value":"9783642047442"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04744-2_6","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T09:16:13Z","timestamp":1253697373000},"page":"59-69","source":"Crossref","is-referenced-by-count":2,"title":["Finding Nested Common Intervals Efficiently"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1137\/060651331","volume":"22","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discret. Math.\u00a022(3), 1022\u20131039 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45784-4_36","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 464\u2013476. Springer, Heidelberg (2002)"},{"key":"6_CR3","first-page":"177","volume-title":"Bioinformatics Algorithms: Techniques and Applications, ch. 8","author":"A. Bergeron","year":"2008","unstructured":"Bergeron, A., Gingras, Y., Chauve, C.: Formal models of gene clusters. In: Mandoiu, I.I., Zelikovsky, A. (eds.) Bioinformatics Algorithms: Techniques and Applications, ch. 8, pp. 177\u2013202. Wiley, Chichester (2008)"},{"issue":"7","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1089\/cmb.2006.13.1340","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. J. Comp. Biol.\u00a013(7), 1340\u20131354 (2006)","journal-title":"J. Comp. Biol."},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TCBB.2007.1069","volume":"14","author":"G. Blin","year":"2007","unstructured":"Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. ACM\/IEEE Trans. Comput. Biol. Bioinf.\u00a014(4), 523\u2013534 (2007)","journal-title":"ACM\/IEEE Trans. Comput. Biol. Bioinf."},{"key":"6_CR6","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-78839-3_28","volume-title":"Research in Computational Molecular Biology","author":"S. B\u00f6cker","year":"2008","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 331\u2013345. Springer, Heidelberg (2008)"},{"issue":"2","key":"6_CR7","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. J. Discr. Alg.\u00a05(2), 330\u2013340 (2007)","journal-title":"J. Discr. Alg."},{"issue":"6","key":"6_CR8","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. J. Comp. Biol.\u00a012(6), 638\u2013656 (2005)","journal-title":"J. Comp. Biol."},{"key":"6_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11554714_7","volume-title":"Comparative Genomics","author":"R. Hoberman","year":"2005","unstructured":"Hoberman, R., Durand, D.: The incompatible desiderata of gene cluster properties. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 73\u201387. Springer, Heidelberg (2005)"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0167-4781(96)00108-X","volume":"1308","author":"U. Kurzik-Dumke","year":"1996","unstructured":"Kurzik-Dumke, U., Zengerle, A.: Identification of a novel Drosophila melanogaster gene, angel, a member of a nested gene cluster at locus 59F4,5. Biochim. Biophys. Acta\u00a01308(3), 177\u2013181 (1996)","journal-title":"Biochim. Biophys. Acta"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11496656_12","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2005","unstructured":"Landau, G.M., Parida, L., Weimann, O.: Using pq trees for comparative genomics. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 128\u2013143. Springer, Heidelberg (2005)"},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-86659-3","volume-title":"Evolution by gene duplication","author":"S. Ohno","year":"1970","unstructured":"Ohno, S.: Evolution by gene duplication. Springer, Heidelberg (1970)"},{"key":"6_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11851561_28","volume-title":"Algorithms in Bioinformatics","author":"S. Rahmann","year":"2006","unstructured":"Rahmann, S., Klau, G.W.: Integer linear programs for discovering approximate gene clusters. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 298\u2013309. Springer, Heidelberg (2006)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-27801-6_26","volume-title":"Combinatorial Pattern Matching","author":"T. Schmidt","year":"2004","unstructured":"Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 347\u2013358. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR15","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":"6_CR16","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-87989-3_8","volume-title":"Comparative Genomics","author":"M. Zhang","year":"2008","unstructured":"Zhang, M., Leong, H.W.: Gene team tree: A compact representation of all gene teams. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 100\u2013112. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04744-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:37:24Z","timestamp":1558269444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}