Experiments in Computing Sequences of Reversals

Authors:
Anne Bergeron;François Strasbourg
Affiliations:
-;-
Venue:
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Year:
2001

Citing 8
Cited 0

Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Edit Distances for Genome Comparisons Based on Non-Local Operations

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Efficient Bounds for Oriented Chromosome Inversion Distance

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Fast Sorting by Reversal

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence of reversals that sorts a signed permutation. The main characteristics of the implementation are its simplicity, both in terms of data structures and operations, and the fact that it exploits the parallelism of bitwise logical operations.