{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T20:47:16Z","timestamp":1789418836879,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319026237","type":"print"},{"value":"9783319026244","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02624-4_4","type":"book-chapter","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T06:21:00Z","timestamp":1381558860000},"page":"36-46","source":"Crossref","is-referenced-by-count":2,"title":["Restricted DCJ-Indel Model Revisited"],"prefix":"10.1007","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. of FOCS 1995, pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci.\u00a065, 587\u2013609 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M. Ozery-Flato","year":"2003","unstructured":"Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangement. J. Bioinf. Comput. Biol.\u00a01, 71\u201394 (2003)","journal-title":"J. Bioinf. Comput. Biol."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2007.04.011","volume":"104","author":"G. Jean","year":"2007","unstructured":"Jean, G., Nikolski, M.: Genome rearrangements: A correct algorithm for optimal capping. Inf. Process. Lett.\u00a0104, 14\u201320 (2007)","journal-title":"Inf. Process. Lett."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1016\/j.tcs.2009.09.008","volume":"410","author":"A. Bergeron","year":"2009","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theor. Comput. Sci.\u00a0410, 5300\u20135316 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.aml.2010.08.021","volume":"24","author":"P.L. Erd\u0151s","year":"2011","unstructured":"Erd\u0151s, P.L., Soukup, L., Stoye, J.: Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett.\u00a024, 82\u201386 (2011)","journal-title":"Appl. Math. Lett."},{"key":"4_CR7","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":"4_CR8","series-title":"LNBI","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":"4_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1177\/117693430800400004","volume":"4","author":"Z. Adam","year":"2008","unstructured":"Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bioinform. Online\u00a04, 69\u201374 (2008)","journal-title":"Evol. Bioinform. Online"},{"key":"4_CR10","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":"4_CR11","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, 120 (2009)","journal-title":"BMC Bioinformatics"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Thomas, A., Varr\u00e9, J.S., Ouangraoua, A.: Genome dedoubling by DCJ and reversal. BMC Bioinformatics\u00a012(suppl. 19), S20 (2012)","DOI":"10.1186\/1471-2105-12-S9-S20"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1089\/cmb.2011.0116","volume":"18","author":"J. Kov\u00e1\u010d","year":"2011","unstructured":"Kov\u00e1\u010d, J., Warren, R., Braga, M.D.V., Stoye, J.: Restricted DCJ model (the problem of chromosome reincorporation). J. Comput. Biol.\u00a018, 1231\u20131241 (2011)","journal-title":"J. Comput. Biol."},{"key":"4_CR14","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. J. Comput. Biol.\u00a016, 1311\u20131338 (2009)","journal-title":"J. Comput. Biol."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"M.D.V. Braga","year":"2011","unstructured":"Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol.\u00a018, 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"da Silva, P.H., Machado, R., Dantas, S., Braga, M.D.V.: Restricted DCJ-indel model: sorting linear genomes with DCJ and indels. BMC Bioinformatics\u00a013(suppl. 19), S14 (2012)","DOI":"10.1186\/1471-2105-13-S19-S14"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-39053-1_3","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"M.D.V. Braga","year":"2013","unstructured":"Braga, M.D.V.: An overview of genomic distances modeled with indels. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol.\u00a07921, pp. 22\u201331. Springer, Heidelberg (2013)"},{"key":"4_CR18","first-page":"105","volume":"1","author":"N. El-Mabrouk","year":"2001","unstructured":"El-Mabrouk, N.: Sorting signed permutations by reversals and insertions\/deletions of contiguous segments. J. Discr. Alg.\u00a01, 105\u2013122 (2001)","journal-title":"J. Discr. Alg."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Swenson, K.M., Arndt, W., Tang, J., Moret, B.: Phylogenetic reconstruction from complete gene orders of whole genomes. In: Proc. of Asia-Pacific Bioinformatics Conf. Advances in Bioinformatics and Comp. Biology, vol.\u00a06, pp. 241\u2013250 (2008)","DOI":"10.1142\/9781848161092_0026"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1748-7188-8-21","volume":"8","author":"P.H. Silva da","year":"2013","unstructured":"da Silva, P.H., Machado, R., Dantas, S., Braga, M.D.V.: DCJ-indel and DCJ-substitution distances with distinct operation costs. Alg. for Mol. Biol.\u00a08, 21 (2013)","journal-title":"Alg. for Mol. Biol."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: On the weight of indels in genomic distances. BMC Bioinformatics\u00a012(suppl. 9), S13 (2011)","DOI":"10.1186\/1471-2105-12-S9-S13"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1093\/bioinformatics\/bts440","volume":"28","author":"R. Hilker","year":"2012","unstructured":"Hilker, R., Sickinger, C., Pedersen, C., Stoye, J.: UniMoG - a unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics\u00a028, 2509\u20132511 (2012)","journal-title":"Bioinformatics"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Willing, E., Zaccaria, S., Braga, M.D.V., Stoye, J.: On the inversion-indel distance. BMC Bioinformatics 14(suppl. 11), S3 (2013)","DOI":"10.1186\/1471-2105-14-S15-S3"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: Genomic distance under gene substitutions. BMC Bioinformatics\u00a012(suppl. 9), S8 (2011)","DOI":"10.1186\/1471-2105-12-S9-S8"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02624-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T19:11:40Z","timestamp":1564513900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02624-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319026237","9783319026244"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02624-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}