BaobabLUNA: the solution space of sorting by reversals - Université Claude Bernard Lyon 1 Accéder directement au contenu
Article Dans Une Revue Bioinformatics Année : 2009

BaobabLUNA: the solution space of sorting by reversals

M. Braga
  • Fonction : Auteur

Résumé

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.

Domaines

Autre [q-bio.OT]

Dates et versions

hal-00539408 , version 1 (24-11-2010)

Identifiants

Citer

M. Braga. BaobabLUNA: the solution space of sorting by reversals. Bioinformatics, 2009, 25 (14), pp.1833-1835. ⟨10.1093/bioinformatics/btp285⟩. ⟨hal-00539408⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More