{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T08:36:25Z","timestamp":1780389385944,"version":"3.54.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","funder":[{"name":"GRIOTE"},{"name":"ANCESTROME"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0107-y","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T13:58:39Z","timestamp":1496671119000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Algorithms for computing the double cut and join distance on both gene order and intergenic sizes"],"prefix":"10.1186","volume":"12","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9raldine","family":"Jean","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Tannier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,5]]},"reference":[{"key":"107_CR1","doi-asserted-by":"crossref","first-page":"312","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of genome rearrangements. Computational molecular biology","author":"G Fertin","year":"2009","unstructured":"Fertin G, Labarre A, Rusu I, Tannier E, Vialette S. Combinatorics of genome rearrangements. Computational molecular biology. Cambridge: MIT Press; 2009. p. 312."},{"key":"107_CR2","volume-title":"The Origin of Genome Architecture","author":"M Lynch","year":"2007","unstructured":"Lynch M. The Origin of Genome Architecture. Sunderland, USA: Sinauer; 2007."},{"key":"107_CR3","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1093\/gbe\/evw083","volume":"8","author":"P Biller","year":"2016","unstructured":"Biller P, Gu\u00e9guen L, Knibbe C, Tannier E. Breaking good: accounting for the diversity of fragile regions for estimating rearrangement distances. Genome Biol Evol. 2016;8:1427\u201339.","journal-title":"Genome Biol Evol"},{"key":"107_CR4","doi-asserted-by":"crossref","unstructured":"Biller P, Knibbe C, Beslon G, Tannier E. Comparative genomics on artificial life. In: Beckmann A, Bienvenu L, Jonoska N, editors. Proceedings of Pursuit of the Universal-12th conference on computability in Europe, CiE 2016, Lecture notes in computer science, vol. 9709, Paris, France, June 27\u2013July 1, 2016. Berlin: Springer; 2016. p. 35\u201344.","DOI":"10.1007\/978-3-319-40189-8_4"},{"issue":"16","key":"107_CR5","doi-asserted-by":"crossref","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\u20136.","journal-title":"Bioinformatics"},{"key":"107_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-12418-6_13","volume-title":"Advances in bioinformatics and computational biology - 9th Brazilian symposium on bioinformatics, BSB 2014, Belo Horizonte, October 28\u201330, 2014, Proceedings","author":"C Baudet","year":"2014","unstructured":"Baudet C, Dias U, Dias Z. Length and symmetry on the sorting by weighted inversions problem. In: Campos SVA, editor. Advances in bioinformatics and computational biology - 9th Brazilian symposium on bioinformatics, BSB 2014, Belo Horizonte, October 28\u201330, 2014, Proceedings, vol. 8826., Lecture notes in computer scienceBerlin: Springer; 2014. p. 99\u2013106."},{"key":"107_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-662-48221-6_18","volume-title":"Algorithms in bioinformatics-15th international workshop, WABI 2015, Atlanta,September 10\u201312, 2015, Proceedings","author":"KM Swenson","year":"2015","unstructured":"Swenson KM, Blanchette M. Models and algorithms for genome rearrangement with positional constraints. In: Pop M, Touzet H, editors. Algorithms in bioinformatics-15th international workshop, WABI 2015, Atlanta,September 10\u201312, 2015, Proceedings, vol. 9289., Lecture notes in computer scienceBerlin: Springer; 2015. p. 243\u201356."},{"key":"107_CR8","doi-asserted-by":"crossref","unstructured":"Alexeev N, Alekseyev MA. Estimation of the true evolutionary distance under the fragile breakage model. In: IEEE 5th international conference on computational advances in Bio and medical sciences; 2015","DOI":"10.1109\/ICCABS.2015.7344706"},{"issue":"S\u201314","key":"107_CR9","first-page":"225","volume":"17","author":"L Bulteau","year":"2016","unstructured":"Bulteau L, Fertin G, Tannier E. Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 2016;17(S\u201314):225\u201331.","journal-title":"BMC Bioinform"},{"key":"107_CR10","doi-asserted-by":"crossref","unstructured":"Fertin G, Jean G, Tannier E. Genome rearrangements on both gene order and intergenic regions. In: Frith MC, Pedersen CNS, editors. Proceedings lecture notes in computer science algorithms in bioinformatics-16th international workshop, WABI 2016, Aarhus, Denmark, August 22\u201324, 2016 , vol. 9838. Berlin: Springer; 2016. p. 162\u2013173","DOI":"10.1007\/978-3-319-43681-4_13"},{"key":"107_CR11","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS. Computers and intractability; a guide to the theory of NP-completeness. New York: W. H. Freeman & Co; 1990."},{"issue":"1","key":"107_CR12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM. A dynamic programming approach to sequencing problems. J Soc Ind Appl Math. 1962;10(1):196\u2013210.","journal-title":"J Soc Ind Appl Math"},{"key":"107_CR13","unstructured":"van\u00a0der Zanden T. Personal communication. 2016"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0107-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T13:59:02Z","timestamp":1496671142000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0107-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["107"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0107-y","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,5]]},"article-number":"16"}}