{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:54Z","timestamp":1775054094925,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642331213","type":"print"},{"value":"9783642331220","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_29","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"365-377","source":"Crossref","is-referenced-by-count":8,"title":["A Simplified View of DCJ-Indel Distance"],"prefix":"10.1007","author":[{"given":"Phillip E. C.","family":"Compeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-15294-8_8","volume-title":"Algorithms in Bioinformatics","author":"M.D.V. Braga","year":"2010","unstructured":"Braga, M.D.V., Willing, E., Stoye, J.: Genomic Distance with DCJ and Indels. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol.\u00a06293, pp. 90\u2013101. Springer, Heidelberg (2010)"},{"issue":"1","key":"29_CR2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/genetics\/23.1.28","volume":"23","author":"T. Dobzhansky","year":"1938","unstructured":"Dobzhansky, T., Sturtevant, A.H.: Inversions in the chromosomes of drosophila pseudoobscura. Genetics\u00a023(1), 28\u201364 (1938)","journal-title":"Genetics"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements, pp. 205\u2013206. MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Dweighter, H. (pseudonym of Goodman, J.): Problem E2569. American Mathematical Monthly\u00a082, 1010 (1975)","DOI":"10.2307\/2318261"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Mathematics\u00a027(1), 47\u201357 (1979)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"M.H. Heydari","year":"1997","unstructured":"Heydari, M.H., Sudborough, I.H.: On the diameter of the pancake network. Journal of Algorithms\u00a025(1), 67\u201394 (1997)","journal-title":"Journal of Algorithms"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Chitturi, B., Fahle, W., Meng, Z., Morales, L., Shields, C.O., Sudborough, I.H., Voit, W.: An upper bound for sorting by prefix reversals. Theoretical Computer Science\u00a0410(36), 3372 (2009); Graphs, Games and Computation: Dedicated to Professor Burkhard Monien on the Occasion of his 65th Birthday","DOI":"10.1016\/j.tcs.2008.04.045"},{"key":"29_CR8","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Pancake flipping is hard. CoRRabs\/1111.0434 (preprint)"},{"issue":"16","key":"29_CR9","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(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"29_CR10","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)"},{"issue":"10","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1089\/cmb.2009.0092","volume":"16","author":"S. Yancopoulos","year":"2009","unstructured":"Yancopoulos, S., Friedberg, R.: DCJ path formulation for genome transformations which include insertions, deletions, and duplications. Journal of Computational Biology\u00a016(10), 1311\u20131338 (2009)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V. Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput.\u00a025(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E. Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics\u00a010(1), 120 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"38","key":"29_CR14","doi-asserted-by":"publisher","first-page":"14254","DOI":"10.1073\/pnas.0805217105","volume":"105","author":"J. Ma","year":"2008","unstructured":"Ma, J., Ratan, A., Raney, B.J., Suh, B.B., Miller, W., Haussler, D.: The infinite sites model of genome evolution. Proceedings of the National Academy of Sciences of the United States of America\u00a0105(38), 14254\u201314261 (2008)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"9","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"M.D.V. Braga","year":"2010","unstructured":"Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. Journal of Computational Biology\u00a017(9), 1145\u20131165 (2010)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T13:05:08Z","timestamp":1687698308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}