{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:26:57Z","timestamp":1773275217393,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13015-015-0041-9","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:52:21Z","timestamp":1427896341000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On the family-free DCJ distance and similarity"],"prefix":"10.1186","volume":"10","author":[{"given":"F\u00e1bio V","family":"Martinez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Feij\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00edlia DV","family":"Braga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,1]]},"reference":[{"key":"41_CR1","volume-title":"Proc. of CPM 1992. LNCS, vol. 644","author":"D Sankoff","year":"1992","unstructured":"Sankoff D. Edit distance for genome comparison based on non-local operations. In: Proc. of CPM 1992. LNCS, vol. 644. Heidelberg: Springer Verlag: 1992. p. 121\u201335."},{"key":"41_CR2","volume-title":"Proc. of WABI 2006. LNBI, vol. 4175","author":"A Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. In: Proc. of WABI 2006. LNBI, vol. 4175. Heidelberg: Springer Verlag: 2006. p. 163\u201373."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Bafna V, Pevzner P. Genome rearrangements and sorting by reversals. In: Proc. of FOCS 1993: 1993. p. 148\u201357.","DOI":"10.1109\/SFCS.1993.366872"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Hannenhalli S, Pevzner P. Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. of FOCS 1995: 1995. p. 581\u201392.","DOI":"10.1109\/SFCS.1995.492588"},{"issue":"16","key":"41_CR5","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 interchanges. Bioinformatics. 2005; 21(16):3340\u20136.","journal-title":"Bioinformatics"},{"issue":"11","key":"41_CR6","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D Sankoff","year":"1999","unstructured":"Sankoff D. Genome rearrangement with gene families. Bioinformatics. 1999; 15(11):909\u201317.","journal-title":"Bioinformatics"},{"key":"41_CR7","volume-title":"Comparative Genomics","author":"D Bryant","year":"2000","unstructured":"Bryant D. The complexity of calculating exemplar distances In: Sankoff D, Nadeau JH, editors. Comparative Genomics. Dortrecht: Kluwer Academic Publishers: 2000. p. 207\u201311."},{"issue":"6","key":"41_CR8","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/TCBB.2012.144","volume":"10","author":"L Bulteau","year":"2013","unstructured":"Bulteau L, Jiang M. Inapproximability of (1,2)-exemplar distance. IEEE\/ACM Trans Comput Biol Bioinf. 2013; 10(6):1384\u201390.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf."},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S Angibaud","year":"2009","unstructured":"Angibaud S, Fertin G, Rusu I, Th\u00e9venin A, Vialette S. On the approximability of comparing genomes with duplicates. J Graph Algorithms Appl. 2009; 13(1):19\u201353.","journal-title":"J Graph Algorithms Appl."},{"key":"41_CR10","volume-title":"Proc. of RECOMB 2014. LNBI, vol. 8394","author":"M Shao","year":"2014","unstructured":"Shao M, Lin Y, Moret B. An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Proc. of RECOMB 2014. LNBI, vol. 8394. Heidelberg: Springer Verlag: 2014. p. 280\u201392."},{"issue":"Suppl 19","key":"41_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2105-13-S19-S3","volume":"13","author":"D D\u00f6rr","year":"2012","unstructured":"D\u00f6rr D, Th\u00e9venin A, Stoye J. Gene family assignment-free comparative genomics. BMC Bioinformatics. 2012; 13(Suppl 19):3.","journal-title":"BMC Bioinformatics"},{"key":"41_CR12","volume-title":"Models and Algorithms for Genome Evolution, Chap. 13","author":"MDV Braga","year":"2013","unstructured":"Braga MDV, Chauve C, D\u00f6rr D, Jahn K, Stoye J, Th\u00e9venin A, et al. The potential of family-free genome comparison In: Chauve C, El-Mabrouk N, Tannier E, editors. Models and Algorithms for Genome Evolution, Chap. 13. London: Springer: 2013. p. 287\u2013307."},{"key":"41_CR13","volume-title":"Proc. of WABI 2014. LNBI, vol. 8701","author":"FV Martinez","year":"2014","unstructured":"Martinez FV, Feij\u00e3o P, Braga MDV, Stoye J. On the family-free DCJ distance. In: Proc. of WABI 2014. LNBI, vol. 8701. Heidelberg: Springer Verlag: 2014. p. 174\u201386."},{"issue":"9","key":"41_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\u201365.","journal-title":"J Comp Biol."},{"issue":"5","key":"41_CR15","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P Feij\u00e3o","year":"2011","unstructured":"Feij\u00e3o P, Meidanis J, SCJ: A breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans Comput Biol Bioinf. 2011; 8(5):1318\u201329.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf."},{"key":"41_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Protasi M, Marchetti-Spaccamela A, Gambosi G, Crescenzi P, Kann V. Complexity and approximation: combinatorial optimization problems and their approximability properties. Heidelberg: Springer; 1999."},{"issue":"4","key":"41_CR17","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1093\/molbev\/msr268","volume":"29","author":"DA Dalquen","year":"2012","unstructured":"Dalquen DA, Anisimova M, Gonnet GH, Dessimoz C. ALF\u2013a simulation framework for genome evolution. Mol Biol Evol. 2012; 29(4):1115\u201323.","journal-title":"Mol Biol Evol."},{"issue":"8","key":"41_CR18","doi-asserted-by":"publisher","first-page":"107014","DOI":"10.1371\/journal.pone.0105015","volume":"9","author":"M Lechner","year":"2014","unstructured":"Lechner M, Hernandez-Rosales M, Doerr D, Wieseke N, Th\u00e9venin A, Stoye J, et al. Orthology detection combining clustering and synteny for very large datasets. PLOS ONE. 2014; 9(8):107014.","journal-title":"PLOS ONE"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-015-0041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-015-0041-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-015-0041-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-015-0041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:58:10Z","timestamp":1747857490000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-015-0041-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1186\/s13015-015-0041-9","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,1]]},"assertion":[{"value":"10 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}