{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:09:21Z","timestamp":1773274161827,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"S15","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1186\/1471-2105-14-s15-s3","type":"journal-article","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T09:02:52Z","timestamp":1381827772000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the inversion-indel distance"],"prefix":"10.1186","volume":"14","author":[{"given":"Eyla","family":"Willing","sequence":"first","affiliation":[]},{"given":"Simone","family":"Zaccaria","sequence":"additional","affiliation":[]},{"given":"Mar\u00edlia DV","family":"Braga","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"6099_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM. 1999, 46: 1-27. 10.1145\/300515.300516. [A preliminary version appeared in Proc. of STOC 1995]","journal-title":"J ACM"},{"key":"6099_CR2","volume-title":"Relat\u00f3rio T\u00e9cnico IC-00-23, Institute of Computing, University of Campinas, Brazil","author":"J Meidanis","year":"2000","unstructured":"Meidanis J, Walter MEMT, Dias Z: Reversal distance of signed circular chromosomes. Relat\u00f3rio T\u00e9cnico IC-00-23, Institute of Computing, University of Campinas, Brazil. 2000"},{"key":"6099_CR3","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. Journal of Discrete Algorithms. 2001, 1: 105-122. [A preliminary version appeared in Proc. of CPM 2000, LNCS 1848]","journal-title":"Journal of Discrete Algorithms"},{"issue":"16","key":"6099_CR4","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. 2005, 21 (16): 3340-3346. 10.1093\/bioinformatics\/bti535.","journal-title":"Bioinformatics"},{"key":"6099_CR5","first-page":"163","volume-title":"A Unifying View of Genome Rearrangements In Proceedings of WABI 2006, Volume 4175 of LNBI","author":"A Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J: A Unifying View of Genome Rearrangements In Proceedings of WABI 2006, Volume 4175 of LNBI. 2006, 163-173."},{"issue":"51","key":"6099_CR6","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. 2009, 410 (51): 5300-5316. 10.1016\/j.tcs.2009.09.008.","journal-title":"Theor Comput Sci"},{"issue":"10","key":"6099_CR7","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. 2009, 16 (10): 1311-1338. 10.1089\/cmb.2009.0092.","journal-title":"J Comput Biol"},{"issue":"9","key":"6099_CR8","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"MDV Braga","year":"2011","unstructured":"Braga MDV, Willing E, Stoye J: Double cut and join with insertions and deletions. J Comput Biol. 2011, 18 (9): 1167-1184. 10.1089\/cmb.2011.0118. [http:\/\/dx.doi.org\/10.1089\/cmb.2011.0118]","journal-title":"J Comput Biol"},{"key":"6099_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1748-7188-8-21","volume":"8","author":"PH da Silva","year":"2013","unstructured":"da Silva PH, Machado R, Dantas S, Braga MDV: DCJ-indel and DCJ-substitution distances with distinct operation costs. Alg for Mol Biol. 2013, 8: 21-10.1186\/1748-7188-8-21.","journal-title":"Alg for Mol Biol"},{"key":"6099_CR10","first-page":"22","volume-title":"Proceedings of Computation in Europe, Volume 7921 of LNCS","author":"MDV Braga","year":"2013","unstructured":"Braga MDV: An overview of genomic distances modeled with indels. Proceedings of Computation in Europe, Volume 7921 of LNCS. 2013, 22-31."},{"key":"6099_CR11","volume-title":"PWS Publishing Company","author":"JC Setubal","year":"1997","unstructured":"Setubal JC, Meidanis J: Introduction to Computational Molecular Biology. PWS Publishing Company. 1997"},{"key":"6099_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-1-60327-159-2_18","volume":"452","author":"R Friedberg","year":"2008","unstructured":"Friedberg R, Darling A, Yancopoulos S: Genome rearrangement by the double cut and join operation. Bioinformatics, Methods in Molecular Biology. 2008, 452: 385-416. 10.1007\/978-1-60327-159-2_18.","journal-title":"Bioinformatics, Methods in Molecular Biology"},{"key":"6099_CR13","first-page":"148","volume-title":"Proc of FOCS","author":"V Bafna","year":"1993","unstructured":"Bafna V, Pevzner P: Genome rearrangements and sorting by reversals. Proc of FOCS. 1993, 148-157."},{"issue":"9","key":"6099_CR14","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2010.0109","volume":"17","author":"MDV Braga","year":"2010","unstructured":"Braga MDV, Stoye J: The solution space of sorting by DCJ. J Comp Biol. 2010, 17 (9): 1145-1165. 10.1089\/cmb.2010.0109.","journal-title":"J Comp Biol"},{"key":"6099_CR15","first-page":"581","volume-title":"Proc 36th Annu Symp Found Comput Sci, FOCS 1995","author":"S Hannenhalli","year":"1995","unstructured":"Hannenhalli S, Pevzner PA: Transforming Men Into Mice (Polynomial Algorithm for Genomic Distance Problem). Proc 36th Annu Symp Found Comput Sci, FOCS 1995. 1995, IEEE Press, 581-592."},{"key":"6099_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1093\/oso\/9780198566106.003.0010","volume-title":"Mathematics of Evolution and Phylogeny","author":"A Bergeron","year":"2005","unstructured":"Bergeron A, Mixtacki J, Stoye J: The Inversion Distance Problem. Mathematics of Evolution and Phylogeny. Edited by: Gascuel O. 2005, Oxford, UK: Oxford University Press, 262-290."},{"issue":"S19","key":"6099_CR17","doi-asserted-by":"crossref","first-page":"S14","DOI":"10.1186\/1471-2105-13-S19-S14","volume":"13","author":"PH da Silva","year":"2012","unstructured":"da Silva PH, Machado R, Dantas S, Braga MDV: Restricted DCJ-indel model: sorting linear genomes with DCJ and indels. BMC Bioinformatics. 2012, 13 (S19): S14-","journal-title":"BMC Bioinformatics"},{"key":"6099_CR18","doi-asserted-by":"crossref","unstructured":"Compeau PEC: DCJ-Indel sorting revisited. Algorithms for Molecular Biology. 2013, 8 (6):","DOI":"10.1186\/1748-7188-8-6"},{"issue":"9","key":"6099_CR19","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1089\/cmb.2011.0116","volume":"18","author":"J Kov\u00e1c","year":"2011","unstructured":"Kov\u00e1c J, Warren R, Braga MDV, Stoye J: Restricted DCJ Model (The Problem of Chromosome Reincorporation). Journal of Computational Biology. 2011, 18 (9): 1231-1241. 10.1089\/cmb.2011.0116.","journal-title":"Journal of Computational Biology"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S15-S3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T17:58:03Z","timestamp":1716055083000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-14-S15-S3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":19,"journal-issue":{"issue":"S15","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["6099"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-14-s15-s3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"15 October 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S3"}}