{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:08:50Z","timestamp":1742400530918},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457671"},{"type":"electronic","value":"9783540457688"}],"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\/11875741_6","type":"book-chapter","created":{"date-parts":[[2006,11,21]],"date-time":"2006-11-21T13:13:09Z","timestamp":1164114789000},"page":"52-63","source":"Crossref","is-referenced-by-count":2,"title":["The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bernt","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Merkle","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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":"6_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-30219-3_2","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Blanchette, M., Chateau, A., Chauve, C.: Reconstructing Ancestral Gene Orders Using Conserved Intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 14\u201325. Springer, Heidelberg (2004)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-44696-6_20","volume-title":"Algorithms in Bioinformatics","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Algorithms for Finding Gene Clusters. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 252\u2013263. Springer, Heidelberg (2001)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distance for genome comparison based on non-local operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A. Caprara","year":"2003","unstructured":"Caprara, A.: The Reversal Median Problem. INFORMS Journal on Computing\u00a015(1), 93\u2013113 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"6_CR6","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_CR7","doi-asserted-by":"crossref","unstructured":"Moret, B.M.E., Tang, J., Warnow, T.: Reconstructing phylogenies from gene-content and gene-order data. Mathematics of Evolution and Phylogeny. In: Gascuel, O. (ed.), pp. 321\u2013352. Oxford University Press, Oxford (2004)","DOI":"10.1093\/oso\/9780198566106.003.0012"},{"issue":"1","key":"6_CR8","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.A.: Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species. Genome Res.\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"6_CR9","unstructured":"Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. Genome Informatics, 25\u201334 (1997)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44696-6_15","volume-title":"Algorithms in Bioinformatics","author":"A.C. Siepel","year":"2001","unstructured":"Siepel, A.C., Moret, B.M.E.: Finding an Optimal Inversion Median: Experimental Results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 189\u2013203. Springer, Heidelberg (2001)"},{"key":"6_CR11","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Genome Rearrangement Based on Reversals that Preserve Conserved Intervals. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (to appear)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45071-8_9","volume-title":"Computing and Combinatorics","author":"A. Bergeron","year":"2003","unstructured":"Bergeron, A., Stoye, J.: On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697. Springer, Heidelberg (2003)"},{"key":"6_CR13","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.: Sorting by Reversals with Common Intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"6_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11557067_19","volume-title":"Algorithms in Bioinformatics","author":"S. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 228\u2013238. Springer, Heidelberg (2005)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: Proc. 27th Ann. ACM Symp. on Theory of Comput., pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"6_CR16","unstructured":"Boore, J.L.: Mitochondrial database (2005), http:\/\/evogen.jgi.doe.gov\/"}],"container-title":["Lecture Notes in Computer Science","Computational Life Sciences II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875741_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T11:14:17Z","timestamp":1707390857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875741_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457671","9783540457688"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11875741_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}