{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:04:36Z","timestamp":1757541876823},"reference-count":12,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: We implemented a software tool called GENESIS for three different genome rearrangement problems: Sorting a unichromosomal genome by weighted reversals and transpositions (SwRT), sorting a multichromosomal genome by reversals, translocations, fusions and fissions (SRTl), and sorting a multichromosomal genome by weighted reversals, translocations, fusions, fissions and transpositions (SwRTTl).<\/jats:p>\n               <jats:p>Availability: Source code can be obtained by the authors, or use the web interface http:\/\/www.uni-ulm.de\/in\/theo\/research\/genesis.html<\/jats:p>\n               <jats:p>Contact: \u00a0simon.gog@uni-ulm.de<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn026","type":"journal-article","created":{"date-parts":[[2008,1,20]],"date-time":"2008-01-20T01:13:55Z","timestamp":1200791635000},"page":"711-712","source":"Crossref","is-referenced-by-count":3,"title":["GENESIS: genome evolution scenarios"],"prefix":"10.1093","volume":"24","author":[{"given":"Simon","family":"Gog","sequence":"first","affiliation":[{"name":"Institute of Theoretical Computer Science, University of Ulm, D-89069 Ulm, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bader","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Computer Science, University of Ulm, D-89069 Ulm, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enno","family":"Ohlebusch","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Computer Science, University of Ulm, D-89069 Ulm, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,1,19]]},"reference":[{"key":"2023020210115178400_B1","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1089\/cmb.2007.R006","article-title":"Sorting by weighted reversals, transpositions, and inverted transpositions","volume":"14","author":"Bader","year":"2007","journal-title":"J. Comput. Biol"},{"key":"2023020210115178400_B2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","article-title":"Genome rearrangements and sorting by reversals","volume":"25","author":"Bafna","year":"1996","journal-title":"SIAM J. Comput"},{"key":"2023020210115178400_B3","doi-asserted-by":"crossref","first-page":"GC 11","DOI":"10.1016\/0378-1119(95)00878-0","article-title":"Parametric genome rearrangement","volume":"172","author":"Blanchette","year":"1996","journal-title":"Gene"},{"key":"2023020210115178400_B4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TCBB.2006.44","article-title":"A 1.375-approximation algorithm for sorting by transpositions","volume":"3","author":"Elias","year":"2006","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"2023020210115178400_B5","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1093\/genetics\/118.4.649","article-title":"Drosophila melanogaster mitochondrial DNA: Gene organization and evolutionary considerations","volume":"118","author":"Garesse","year":"1988","journal-title":"Genetics"},{"key":"2023020210115178400_B6","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/SFCS.1995.492588","article-title":"Transforming men into mice (polynomial algorithm for genetic distance problem)","volume-title":"Proc. 36th Annual IEEE Symposium on Foundations of Computer Science.","author":"Hannenhalli","year":"1995"},{"key":"2023020210115178400_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":"2023020210115178400_B8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.jcss.2004.12.006","article-title":"A 1.5-approximation algorithm for sorting by transpositions and transreversals","volume":"70","author":"Hartman","year":"2005","journal-title":"J. Comput. Syst. Sci"},{"key":"2023020210115178400_B9","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1139\/g93-141","article-title":"The mitochondrial genome of Anopheles quadrimaculatus species: complete nucleotide sequence and gene organization","volume":"36","author":"Michell","year":"1993","journal-title":"Genome"},{"key":"2023020210115178400_B10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S0219720003000198","article-title":"Two notes on genome rearrangement","volume":"1","author":"Ozery-Flato","year":"2003","journal-title":"J. Bioinformatics Comput. Biol"},{"key":"2023020210115178400_B11","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. Syst. Sci"},{"key":"2023020210115178400_B12","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\/24\/5\/711\/49051597\/bioinformatics_24_5_711.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/5\/711\/49051597\/bioinformatics_24_5_711.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T11:49:45Z","timestamp":1675338585000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/5\/711\/203588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,19]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn026","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,3,1]]},"published":{"date-parts":[[2008,1,19]]}}}