{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:43:48Z","timestamp":1725529428547},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879886"},{"type":"electronic","value":"9783540879893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87989-3_12","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:19:16Z","timestamp":1237288756000},"page":"158-169","source":"Crossref","is-referenced-by-count":5,"title":["Perfect DCJ Rearrangement"],"prefix":"10.1007","author":[{"given":"S\u00e8verine","family":"B\u00e9rard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Chateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Tannier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1177\/117693430800400004","volume":"4","author":"Z. Adam","year":"2008","unstructured":"Adam, Z., Sankoff, D.: The ABC of MGR with DCJ. Evol. Bioinformatics\u00a04, 69\u201374 (2008)","journal-title":"Evol. Bioinformatics"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alekseyev, M., Pevzner, P.: Multi-break rearrangements and chromosomal evolution. Theor. Comput. Sci. (in press, 2008)","DOI":"10.1016\/j.tcs.2008.01.013"},{"key":"12_CR3","series-title":"Lecture Notes in Bioinformatics","first-page":"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":"12_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2007.1011","volume":"4","author":"S. B\u00e9rard","year":"2007","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a04, 4\u201316 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2007.10.012","volume":"106","author":"S. B\u00e9rard","year":"2008","unstructured":"B\u00e9rard, S., Chauve, C., Paul, C.: A more efficient algorithm for perfect sorting by reversals. Inform. Proc. Letters\u00a0106, 90\u201395 (2008)","journal-title":"Inform. Proc. Letters"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/11561071_69","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"key":"12_CR7","volume-title":"Mathematics of Evolution and Phylogeny","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Mathematics of Evolution and Phylogeny. Oxford University Press, Oxford (2005)"},{"key":"12_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11851561_16","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 163\u2013173. Springer, Heidelberg (2006)"},{"key":"12_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-72031-7_28","volume-title":"Bioinformatics Research and Applications","author":"M. Bernt","year":"2007","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: A fast and exact algorithm for the perfect reversal median. In: M\u0103ndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol.\u00a04463, pp. 305\u2013316. Springer, Heidelberg (2007)"},{"key":"12_CR10","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res.\u00a012, 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Braga, M., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals with experiments and an application to evolution. IEEE\/ACM Trans. Comput. Biol. Bioinform (2008)","DOI":"10.1109\/TCBB.2008.16"},{"key":"12_CR12","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 J. Comp.\u00a015, 93\u2013113 (2003)","journal-title":"INFORMS J. Comp."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCBB.2007.1042","volume":"4","author":"Y. Diekmann","year":"2007","unstructured":"Diekmann, Y., Sagot, M.-F., Tannier, E.: Evolution under reversals: Parsimony and conservation of common intervals. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a04, 301\u2013309 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"12_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","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)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","first-page":"347","volume-title":"Combinatorial Pattern Matching","author":"M. Habib","year":"2004","unstructured":"Habib, M., Paul, C., Raffinot, M.: Common connected components of interval graphs. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 347\u2013358. Springer, Heidelberg (2004)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM\u00a046, 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice: polynomial algorithm for genomic distance problem. In: FOCS 1995, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.M.: PC trees and circular-ones arrangements. Theor. Comput. Sci.\u00a0296, 99\u2013116 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-78604-7_23","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"R. Lenne","year":"2008","unstructured":"Lenne, R., Solnon, C., Stutzle, T., Tannier, E., Birattari, M.: Reactive stochastic local search algorithms for the genomic median problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol.\u00a04972, pp. 266\u2013276. Springer, Heidelberg (2008)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1089\/cmb.2005.12.102","volume":"12","author":"Y. Lin","year":"2005","unstructured":"Lin, Y., et al.: An efficient algorithm for sorting by block-interchange and its application to the evolution of vibrio species. J. Comput. Biol.\u00a012, 102\u2013112 (2005)","journal-title":"J. Comput. Biol."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1186\/1471-2105-7-295","volume":"7","author":"L. Lu","year":"2006","unstructured":"Lu, L., Huang, Y., Wang, T., Chiu, H.-T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics\u00a07, 295 (2006)","journal-title":"BMC Bioinformatics"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69733-6_28","volume-title":"Computing and Combinatorics","author":"J. Mixtacki","year":"2008","unstructured":"Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092. Springer, Heidelberg (2008)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1126\/science.1111387","volume":"309","author":"W. Murphy","year":"2005","unstructured":"Murphy, W., et al.: Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science\u00a0309, 613\u2013617 (2005)","journal-title":"Science"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/11533719_7","volume-title":"Computing and Combinatorics","author":"M.-F. Sagot","year":"2005","unstructured":"Sagot, M.-F., Tannier, E.: Perfect sorting by reversals. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 42\u201351. Springer, Heidelberg (2005)"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on sorting by reversals. Discrete Appl. Math.\u00a0155, 881\u2013888 (2007)","journal-title":"Discrete Appl. Math."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal genome median and halving problems. In: Proceedings of WABI 2008 (2008)","DOI":"10.1007\/978-3-540-87361-7_1"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Warren, R., Sankoff, D.: Genome halving with double cut and join. In: APBC 2008, pp. 231\u2013240 (2008)","DOI":"10.1142\/9781848161092_0025"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S. Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics\u00a021, 3340\u20133346 (2005)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87989-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:53:37Z","timestamp":1619524417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87989-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879886","9783540879893"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87989-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}