Partial enumeration of solutions traces for the problem of sorting by signed reversals - Université Claude Bernard Lyon 1 Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Partial enumeration of solutions traces for the problem of sorting by signed reversals

Résumé

Traditional algorithms to solve the problem of sorting by signed reversals output just one optional solution while the space of optimal solutions can be huge. Algorithms for enumerating the complete set of solutions traces were developed aiming to support biologists studies of alternative evolutionary scenarios. Due to the exponential complexity of the algorithms, their practical use is limited to small permutations. In this work, we propose and evaluate three di erent approaches to producing a partial enumeration of the complete set of traces to transform a given permutation to another one.
Fichier non déposé

Dates et versions

hal-00748607 , version 1 (05-11-2012)

Identifiants

Citer

Christian Baudet, Zanoni Dias. Partial enumeration of solutions traces for the problem of sorting by signed reversals. Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, Aug 2011, Chicago, United States. pp.505--507, ⟨10.1145/2147805.2147884⟩. ⟨hal-00748607⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More