{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T20:47:15Z","timestamp":1789418835055,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161803","type":"print"},{"value":"9783642161810","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16181-0_2","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:06:33Z","timestamp":1286957193000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["The Problem of Chromosome Reincorporation in DCJ Sorting and Halving"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Kov\u00e1\u010d","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","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"},{"key":"2_CR2","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":"2_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett.\u00a060, 165\u2013169 (1996)","journal-title":"Inf. Process. Lett."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms 3 (2007)","DOI":"10.1145\/1273340.1273341"},{"key":"2_CR5","first-page":"489","volume":"17","author":"K.M. Swenson","year":"2010","unstructured":"Swenson, K.M., Rajan, V., Lin, Y., Moret, B.M.E.: Sorting signed permutations by inversions in O(nlogn) time. JCB\u00a017, 489\u2013501 (2010)","journal-title":"JCB"},{"key":"2_CR6","first-page":"357","volume":"7","author":"R. Warren","year":"2009","unstructured":"Warren, R., Sankoff, D.: Genome halving with double cut and join. JBCB\u00a07, 357\u2013371 (2009)","journal-title":"JBCB"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","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, pp. 276\u2013286. Springer, Heidelberg (2008)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10 (2009)","DOI":"10.1186\/1471-2105-10-120"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1137\/S0097539700377177","volume":"32","author":"N. El-Mabrouk","year":"2003","unstructured":"El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput.\u00a032, 754\u2013792 (2003)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jcss.2004.12.002","volume":"70","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Verbin, E.: Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci.\u00a070(3), 321\u2013341 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR11","unstructured":"Han, Y.: Improving the efficiency of sorting by reversals. In: Arabnia, H.R., Valafar, H. (eds.) BIOCOMP, pp. 406\u2013409. CSREA Press (2006)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0304-3975(90)90053-K","volume":"71","author":"M. Chrobak","year":"1990","unstructured":"Chrobak, M., Szymacha, T., Krawczyk, A.: A data structure useful for finding hamiltonian cycles. Theor. Comput. Sci.\u00a071, 419\u2013424 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","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 Applied Mathematics\u00a0155, 881\u2013888 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11780441_24","volume-title":"Combinatorial Pattern Matching","author":"M. Ozery-Flato","year":"2006","unstructured":"Ozery-Flato, M., Shamir, R.: An \n                  \n                    \n                  \n                  $O(n^{3\/2}\\sqrt{\\log (n)})$\n                 algorithm for sorting by reciprocal translocations. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 258\u2013269. Springer, Heidelberg (2006)"},{"key":"2_CR15","first-page":"1287","volume":"16","author":"S. B\u00e9rard","year":"2009","unstructured":"B\u00e9rard, S., Chateau, A., Chauve, C., Paul, C., Tannier, E.: Computation of perfect dcj rearrangement scenarios with linear and circular chromosomes. JCB\u00a016, 1287\u20131309 (2009), PMID: 19803733","journal-title":"JCB"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16181-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T13:03:28Z","timestamp":1553173408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16181-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161803","9783642161810"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16181-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}