{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T14:57:46Z","timestamp":1790002666663,"version":"4.0.1"},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"19","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":1537,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Summary: UniMoG is a software combining five genome rearrangement models: double cut and join (DCJ), restricted DCJ, Hannenhalli and Pevzner (HP), inversion and translocation. It can compute the pairwise genomic distances and a corresponding optimal sorting scenario for an arbitrary number of genomes. All five models can be unified through the DCJ model, thus the implementation is based on DCJ and, where reasonable, uses the most efficient existing algorithms for each distance and sorting problem. Both textual and graphical output is possible for visualizing the operations.<\/jats:p><jats:p>Availability and implementation: The software is available through the Bielefeld University Bioinformatics Web Server at http:\/\/bibiserv.techfak.uni-bielefeld.de\/dcj with instructions and example data.<\/jats:p><jats:p>Contact: \u00a0rhilker@cebitec.uni-bielefeld.de<\/jats:p>","DOI":"10.1093\/bioinformatics\/bts440","type":"journal-article","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T10:12:51Z","timestamp":1342779171000},"page":"2509-2511","source":"Crossref","is-referenced-by-count":43,"title":["UniMoG\u2014a unifying framework for genomic distance calculation and sorting based on DCJ"],"prefix":"10.1093","volume":"28","author":[{"given":"Rolf","family":"Hilker","sequence":"first","affiliation":[{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"},{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corinna","family":"Sickinger","sequence":"additional","affiliation":[{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian N.S.","family":"Pedersen","sequence":"additional","affiliation":[{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"},{"name":"1 Computational Genomics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany, 2Institute for Bioinformatics, Center for Biotechnology (CeBiTec), Bielefeld University, 33615 Bielefeld, Germany, 3Bioinformatics Research Center (BiRC), Aarhus University, 8000 Aarhus, Denmark and 4Genome Informatics, Faculty of Technology, Bielefeld University, 33615 Bielefeld, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"key":"2023012513142524800_bts440-B1","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1093\/oso\/9780198566106.003.0010","article-title":"The inversion distance problem","volume-title":"Mathematics of Evolution and Phylogeny","author":"Bergeron","year":"2005"},{"key":"2023012513142524800_bts440-B2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1089\/cmb.2006.13.567","article-title":"On sorting by translocations","volume":"13","author":"Bergeron","year":"2006","journal-title":"J. Comput. Biol."},{"key":"2023012513142524800_bts440-B3","doi-asserted-by":"crossref","DOI":"10.1007\/11851561_16","article-title":"A unifying view of genome rearrangements","volume-title":"Proceedings of WABI 2006","author":"Bergeron","year":"2006"},{"key":"2023012513142524800_bts440-B4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.aml.2010.08.021","article-title":"Balanced vertices in trees and a simpler algorithm to compute the genomic distance","volume":"24","author":"Erd\u0151s","year":"2011","journal-title":"Appl. Math. Lett."},{"key":"2023012513142524800_bts440-B5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(96)00061-3","article-title":"Polynomial-time algorithm for computing translocation distance between genomes","volume":"71","author":"Hannenhalli","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"2023012513142524800_bts440-B6","first-page":"581","article-title":"Transforming men into mice (polynomial algorithm for genomic distance problem)","volume-title":"Proceedings of FOCS 1995","author":"Hannenhalli","year":"1995"},{"key":"2023012513142524800_bts440-B7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","article-title":"Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals","volume":"46","author":"Hannenhalli","year":"1999","journal-title":"J. ACM"},{"key":"2023012513142524800_bts440-B8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ipl.2007.04.011","article-title":"Genome rearrangements: a correct algorithm for optimal capping","volume":"104","author":"Jean","year":"2007","journal-title":"Inform. Process. Lett."},{"key":"2023012513142524800_bts440-B9","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1089\/cmb.2011.0116","article-title":"Restricted DCJ model: rearrangement problems with chromosome reincorporation","volume":"18","author":"Kov\u00e1\u010d","year":"2011","journal-title":"J. Comput. Biol."},{"key":"2023012513142524800_bts440-B10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/bioinformatics\/btn148","article-title":"Estimating true evolutionary distances under the DCJ model","volume":"24","author":"Lin","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012513142524800_bts440-B11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1101\/gr.757503","article-title":"Genome rearrangements in mammalian evolution: lessons from human and mouse genomes","volume":"13","author":"Pevzner","year":"2003","journal-title":"Genome Res."},{"key":"2023012513142524800_bts440-B12","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","article-title":"Advances on sorting by reversals","volume":"155","author":"Tannier","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"2023012513142524800_bts440-B13","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","article-title":"Efficient algorithms for multichromosomal genome rearrangements","volume":"65","author":"Tesler","year":"2002","journal-title":"J. Comput. Systems Sci."},{"key":"2023012513142524800_bts440-B14","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","article-title":"GRIMM: genome rearrangements web server","volume":"18","author":"Tesler","year":"2002","journal-title":"Bioinformatics"},{"key":"2023012513142524800_bts440-B15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1038\/nature04072","article-title":"Initial sequence of the chimpanzee genome and comparison with the human genome","volume":"437","author":"The Chimpanzee Sequencing and Analysis Consortium","year":"2005","journal-title":"Nature"},{"key":"2023012513142524800_bts440-B16","doi-asserted-by":"crossref","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","article-title":"Efficient sorting of genomic permutations by translocation, inversion and block interchange","volume":"21","author":"Yancopoulos","year":"2005","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/19\/2509\/48875906\/bioinformatics_28_19_2509.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/19\/2509\/48875906\/bioinformatics_28_19_2509.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T08:52:24Z","timestamp":1714207944000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/28\/19\/2509\/288010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":16,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2012,10,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bts440","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2012,10,1]]},"published":{"date-parts":[[2012,7,18]]}}}