{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:26:02Z","timestamp":1725470762933},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540445296"},{"type":"electronic","value":"9783540445302"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864127_9","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T04:41:57Z","timestamp":1158900117000},"page":"99-112","source":"Crossref","is-referenced-by-count":1,"title":["Inferring Gene Orders from Gene Maps Using the Breakpoint Distance"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Blais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Guillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Blanchette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-32290-0_1","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C.: Conservation of combinatorial structures in evolution scenarios. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 1\u201314. Springer, Heidelberg (2005)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11533719_5","volume-title":"Computing and Combinatorics","author":"G. Blin","year":"2005","unstructured":"Blin, G., Rizzi, R.: Conserved interval distance computation between non-trivial genomes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 22\u201331. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Bowers, J.E., Abbey, C., Anderson, A., Chang, C., Draye, X., Hoppe, A.H., Jessup, R., Lemke, C., Lennington, J., Li, Z.K., Lin, Y.R., Liu, S.C., Luo, L.J., Marler, B., Ming, R.G., Mitchell, S.E., Qiang, D., Reischmann, K., Schulze, S.R., Skinner, D.N., Wang, Y.W., Kresovich, S., Schertz, K.F., Paterson, A.H.: A high-density genetic recombination map of sequence-tagged sites for Sorghum, as a framework for comparative structural and evolutionary genomics of tropical grains and grasses. Genetics (2003)","key":"9_CR4","DOI":"10.1093\/genetics\/165.1.367"},{"key":"9_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30219-3_3","volume-title":"Algorithms in Bioinformatics","author":"M. Figeac","year":"2004","unstructured":"Figeac, M., Varr\u00e9, J.S.: Sorting by reversals with common intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Communications of the ACM (1962)","key":"9_CR6","DOI":"10.1145\/367766.368168"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1073\/pnas.95.5.1971","volume":"95","author":"M.D. Gale","year":"1998","unstructured":"Gale, M.D., Devos, K.M.: Comparative genetics in the grasses. Proceedings of the National Academy of Sciences USA\u00a095, 1971\u20131974 (1998)","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"9_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"48","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM\u00a048, 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Jackson, B.N., Aluru, S., Schnable, P.S.: Consensus genetic maps: a graph theory approach. In: IEEE Computational Systems Bioinformatics Conference (CSB 2005), pp. 35\u201343 (2005)","key":"9_CR10","DOI":"10.1109\/CSB.2005.26"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/S1360-1385(00)01629-0","volume":"5","author":"B. Keller","year":"2000","unstructured":"Keller, B., Feuillet, C.: Colinearity and gene density in grass genomes. Trends Plant Sci.\u00a05, 246\u2013251 (2000)","journal-title":"Trends Plant Sci."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0888-7543(87)90010-3","volume":"1","author":"S.E. Lander","year":"1987","unstructured":"Lander, S.E., Green, P., Abrahamson, J., Barlow, A., Daly, M.J., et al.: MAPMAKER: an interactive computer package for constructing primary genetic linkage maps of experimental and natural populations. Genomics\u00a01, 174\u2013181 (1987)","journal-title":"Genomics"},{"unstructured":"Menz, M.A., Klein, R.R., Mullet, J.E., Obert, J.A., Unruh, N.C., Klein, P.E.: A High-Density Genetic Map of Sorghum Bicolor (L.) Moench Based on 2926 Aflp, Rflp and Ssr Markers. Plant Molecular Biology (2002)","key":"9_CR13"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1073\/pnas.1330369100","volume":"100","author":"P.A. Pevzner","year":"2003","unstructured":"Pevzner, P.A., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA\u00a0100, 7672\u20137677 (2003)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"unstructured":"Polacco, M.L., Coe, Jr., E.: IBM neighbors: a consensus GeneticMap (2002)","key":"9_CR15"},{"key":"9_CR16","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11554714_12","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Zheng, C., Lenert, A.: Reversals of fortune. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 131\u2013141. Springer, Heidelberg (2005)"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1093\/genetics\/165.4.2235","volume":"165","author":"I.V. Yap","year":"2003","unstructured":"Yap, I.V., Schneider, D., Kleinberg, J., Matthews, D., Cartinhour, S., McCouch, S.R.: A graph-theoretic approach to comparing and integrating genetic, physical and sequence-based maps. Genetics\u00a0165, 2235\u20132247 (2003)","journal-title":"Genetics"},{"doi-asserted-by":"crossref","unstructured":"Zheng, C., Lenert, A., Sankoff, D.: Reversal distance for partially ordered genomes. Bioinformatics\u00a021 (in press, 2005)","key":"9_CR18","DOI":"10.1093\/bioinformatics\/bti1037"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864127_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T13:31:30Z","timestamp":1627824690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864127_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445296","9783540445302"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11864127_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}