Chronological order of reversal events on Rickettsia genus

Authors:
Christian Baudet;Zanoni Dias
Affiliations:
INRIA Grenoble Rhône-Alpes, Villeurbanne Cedex, France;State University of Campinas -- Unicamp, Campinas -- São Paulo -- Brazil
Venue:
ISB '10 Proceedings of the International Symposium on Biocomputing
Year:
2010

Citing 5
Cited 0

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

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Advances on sorting by reversals

Discrete Applied Mathematics
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
baobabLUNA

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional algorithms for sorting permutations by signed reversals output one solution while the solution space can be huge. The enumeration of traces of solutions for this problem can be a powerful tool to help the study of rear-rangement scenarios which only include reversals. Through the analysis of the permutations of six members of the Rickettsia genus in relation with their common ancestral, we were able to produce all possible scenarios and infer some chronological order over the reversal events that occurred during the evolution of these species. Our results matched with the scenario proposed in the literature.