{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:48:47Z","timestamp":1757540927628},"reference-count":13,"publisher":"Oxford University Press (OUP)","issue":"14","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2714,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Computing the reversal distance and searching for an optimal sequence of reversals to transform a unichromosomal genome into another are useful algorithmic tools to analyse real evolutionary scenarios. Currently, these problems can be solved by at least two available softwares, the prominent of which are GRAPPA and GRIMM. However, the number of different optimal sequences is usually huge and taking only the distance and\/or one example is often insufficient to do a proper analysis. Here, we offer an alternative and present baobabLUNA, a framework that contains an algorithm to give a compact representation of the whole space of solutions for the sorting by reversals problem.<\/jats:p>\n               <jats:p>Availability and Implementation: Compiled code implemented in Java is freely available for download at http:\/\/pbil.univ-lyon1.fr\/software\/luna\/. Documentation with methodological background, technical aspects, download and setup instructions, interface description and tutorial are available at http:\/\/pbil.univ-lyon1.fr\/software\/luna\/doc\/luna-doc.pdf.<\/jats:p>\n               <jats:p>Contact: \u00a0mdvbraga@gmail.com<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btp285","type":"journal-article","created":{"date-parts":[[2009,4,29]],"date-time":"2009-04-29T01:14:58Z","timestamp":1240967698000},"page":"1833-1835","source":"Crossref","is-referenced-by-count":18,"title":["<b>\n                     <tt>baobabLUNA<\/tt>\n                  <\/b>: the solution space of sorting by reversals"],"prefix":"10.1093","volume":"25","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lyon, F-69000, Lyon; Universit\u00e9 Lyon 1; CNRS UMR5558; Inria Grenoble Rh\u00f4ne-Alpes, Lyon, France"}]}],"member":"286","published-online":{"date-parts":[[2009,4,28]]},"reference":[{"key":"2023013112052226700_B1","first-page":"99","article-title":"On the properties of sequences of reversals that sort a signed permutation","volume-title":"Journ\u00e9es Ouvertes en Biologie, Informatique et Math\u00e9matiques 2002","author":"Bergeron","year":"2002"},{"key":"2023013112052226700_B2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1371\/journal.pgen.0030014","article-title":"Reductive genome evolution from the mother of Rickettsia","volume":"3","author":"Blanc","year":"2007","journal-title":"PLoS Genet."},{"key":"2023013112052226700_B3","article-title":"Exploring the Solution Space of Sorting by Reversals When Analyzing Genome Rearrangements","volume-title":"PhD Thesis","author":"Braga","year":"2009"},{"key":"2023013112052226700_B4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/TCBB.2008.16","article-title":"Exploring the solution space of sorting by reversals with experiments and an application to evolution","volume":"5","author":"Braga","year":"2008","journal-title":"Trans. Comput. Biol. Bioinform."},{"key":"2023013112052226700_B5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TCBB.2007.1042","article-title":"Evolution under reversals: parsimony and conservation of common intervals","volume":"4","author":"Diekmann","year":"2007","journal-title":"Trans. Comput. Biol. Bioinform."},{"key":"2023013112052226700_B6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/300515.300516","article-title":"Transforming cabbage into turnip (polyn. algorithm for sorting signed permutations by reversals)","volume":"46","author":"Hannenhalli","year":"1999","journal-title":"J. ACM"},{"key":"2023013112052226700_B7","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1126\/science.286.5441.964","article-title":"Four evolutionary strata on the human X chromosome","volume":"286","author":"Lahn","year":"1999","journal-title":"Science"},{"key":"2023013112052226700_B8","doi-asserted-by":"crossref","DOI":"10.1093\/gbe\/evp006","article-title":"Footprints of inversions at present and past pseudoautosomal boundaries in human sex chromosomes","author":"Lemaitre","year":"2009","journal-title":"Genome Biol. Evol."},{"key":"2023013112052226700_B9","first-page":"583","article-title":"A new implementation and detailed study of breakpoint analysis","volume-title":"Proceedings of the 6th Pacific Symposium on Biocomputing","author":"Moret","year":"2001"},{"key":"2023013112052226700_B10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1038\/nature03440","article-title":"The DNA sequence of the human X chromosome","volume":"434","author":"Ross","year":"2005","journal-title":"Nature"},{"key":"2023013112052226700_B11","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1089\/10665270360688200","article-title":"An algorithm to enumerate sorting reversals for signed permutations","volume":"10","author":"Siepel","year":"2003","journal-title":"J. Comput. Biol."},{"key":"2023013112052226700_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":"2023013112052226700_B13","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"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/14\/1833\/48993827\/bioinformatics_25_14_1833.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/14\/1833\/48993827\/bioinformatics_25_14_1833.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T21:20:59Z","timestamp":1675200059000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/14\/1833\/224316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,28]]},"references-count":13,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2009,7,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btp285","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,7,15]]},"published":{"date-parts":[[2009,4,28]]}}}