A more efficient algorithm for perfect sorting by reversals

Authors:
Sèverine Bérard;Cedric Chauve;Christophe Paul
Affiliations:
Département de Mathématiques et d'Informatique Appliquée, INRA, Toulouse, France and Université Montpellier 2, UMR AMAP, Montpellier, F-34000 France;Department of Mathematics, Simon Fraser University, Canada and Comparative Genomics Laboratory, Université du Québec à Montréal, Canada;CNRS, LIRMM, Université Montpellier 2, France
Venue:
Information Processing Letters
Year:
2008

Citing 8
Cited 4

Sorting Permutations by Reversals and Eulerian Cycle Decompositions

SIAM Journal on Discrete Mathematics
Advances on sorting by reversals

Discrete Applied Mathematics
Perfect Sorting by Reversals Is Not Always Difficult

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolution under Reversals: Parsimony and Conservation of Common Intervals

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mathematics of Evolution and Phylogeny

Mathematics of Evolution and Phylogeny
Computing common intervals of K permutations, with applications to modular decomposition of graphs

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Revisiting t. uno and m. yagiura's algorithm

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Parameterized Complexity

Parameterized Complexity

Perfect DCJ Rearrangement

RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Average-Case Analysis of Perfect Sorting by Reversals

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Survey: A survey of the algorithmic aspects of modular decomposition

Computer Science Review
Preserving inversion phylogeny reconstruction

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.96

Visualization

Abstract

We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum prime degree d of the strong interval tree, i.e., f(d).n^O^(^1^). This improves the best known algorithm which complexity was based on a parameter always larger than or equal to d.