Chronological order of reversal events on Rickettsia genus
ISB '10 Proceedings of the International Symposium on Biocomputing
An improved algorithm to enumerate all traces that sort a signed permutation by reversals
Proceedings of the 2010 ACM Symposium on Applied Computing
Listing all parsimonious reversal sequences: new algorithms and perspectives
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
| Hi-index | 3.84 |
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. 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. Contact: mdvbraga@gmail.com Supplementary information:Supplementary data are available at Bioinformatics online.