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

Authors:
Christian Baudet;Zanoni Dias
Affiliations:
Université Claude Bernard, Lyon, France;University of Campinas, Campinas -- São Paulo, Brazil
Venue:
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Year:
2011

Citing 5
Cited 0

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The solution space of sorting by reversals

ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 different approaches to producing a partial enumeration of the complete set of traces to transform a given permutation to another one.