{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:30Z","timestamp":1725538350921},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_2","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:16:13Z","timestamp":1253711773000},"page":"13-23","source":"Crossref","is-referenced-by-count":2,"title":["Natural Parameter Values for Generalized Gene Adjacency"],"prefix":"10.1007","author":[{"given":"Zhenyu","family":"Yang","sequence":"first","affiliation":[]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","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":"2_CR2","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1126\/science.1167782","volume":"323","author":"R. D\u2019Souza","year":"2009","unstructured":"D\u2019Souza, R., Achlioptas, D., Spencer, J.: Explosive percolation in random networks. Science\u00a0323, 1453\u20131455 (2009)","journal-title":"Science"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1089\/10665270360688129","volume":"10","author":"D. Durand","year":"2003","unstructured":"Durand, D., Sankoff, D.: Tests for gene clusters. Journal of Computational Biology\u00a010, 453\u2013482 (2003)","journal-title":"Journal of Computational Biology"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"2_CR5","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences\u00a05, 17\u201361 (1960)","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P. Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the strength of connectedness of a random graphs. Acta Mathematica Scientia Hungary\u00a012, 261\u2013267 (1961)","journal-title":"Acta Mathematica Scientia Hungary"},{"key":"2_CR7","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)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1089\/cmb.2005.12.1083","volume":"12","author":"R. Hoberman","year":"2005","unstructured":"Hoberman, R., Sankoff, D., Durand, D.: The statistical analysis of spatially clustered genes under the maximum gap criterion. Journal of Computational Biology\u00a012, 1081\u20131100 (2005)","journal-title":"Journal of Computational Biology"},{"key":"2_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-85557-6_14","volume-title":"Advances in Bioinformatics and Computational Biology","author":"X. Xu","year":"2008","unstructured":"Xu, X., Sankoff, D.: Tests for gene clusters satisfying the generalized adjacency criterion. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds.) BSB 2008. LNCS (LNBI), vol.\u00a05167, pp. 152\u2013160. Springer, Heidelberg (2008)"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TCBB.2008.121","volume":"6","author":"Q. Zhu","year":"2009","unstructured":"Zhu, Q., Adam, Z., Choi, V., Sankoff, D.: Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution. Transactions on Computational Biology and Bioinformatics\u00a06(2), 213\u2013220 (2009)","journal-title":"Transactions on Computational Biology and Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04744-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T21:40:05Z","timestamp":1685137205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}