A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

Authors:
Haim Kaplan;Ron Shamir;Robert E. Tarjan
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 51

An algorithm to enumerate all sorting reversals

Proceedings of the sixth annual international conference on Computational biology
Efficient algorithms for multichromosomal genome rearrangements

Journal of Computer and System Sciences - Computational biology 2002
Phylogenetic Inference from Mitochondrial Genome Arrangement Data

ICCS '01 Proceedings of the International Conference on Computational Science-Part II
On the Practical Solution of the Reversal Median Problem

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Finding an Optimal Inversion Median: Experimental Results

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Algorithms for Finding Gene Clusters

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Experiments in Computing Sequences of Reversals

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Sorting by Prefix Transpositions

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Sorting signed permutations by reversals, revisited

Journal of Computer and System Sciences - Special issue on bioinformatics II
A 1.375-Approximation Algorithm for Sorting by Transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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)
Colored de Bruijn Graphs and the Genome Halving Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A very elementary presentation of the Hannenhalli-Pevzner theory

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
A 1.75-approximation algorithm for unsigned translocation distance

Journal of Computer and System Sciences
Whole genome duplications, multi-break rearrangements, and genome halving problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear time algorithm for the inversion median problem in circular bacterial genomes

Journal of Discrete Algorithms
Patterns of simple gene assembly in ciliates

Discrete Applied Mathematics
Decision problem for shuffled genes

Information and Computation
A new linear time algorithm to compute the genomic distance via the double cut and join distance

Theoretical Computer Science
A very elementary presentation of the Hannenhalli-Pevzner theory

Discrete Applied Mathematics
A simpler and faster 1.5-approximation algorithm for sorting by transpositions

Information and Computation
An improved algorithm for sorting by block-interchanges based on permutation groups

Information Processing Letters
Efficient data structures and a new randomized approach for sorting signed permutations by reversals

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On the similarity of sets of permutations and its applications to genome comparison

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Rearrangements in genomes with centromeres part I: translocations

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
How to achieve an equivalent simple permutation in linear time

RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Evolution of tandemly arrayed genes in multiple species

RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
A fixed-parameter algorithm for string-to-string correction

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Listing all sorting reversals in quadratic time

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals

Journal of Computer Science and Technology
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations

Journal of Discrete Algorithms
Maximizing synteny blocks to identify ancestral homologs

RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Efficient sampling of transpositions and inverted transpositions for bayesian MCMC

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Simple operations for gene assembly

DNA'05 Proceedings of the 11th international conference on DNA Computing
An O(n3/2√log(n)) algorithm for sorting by reciprocal translocations

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Matrix tightness: a linear-algebraic framework for sorting by transpositions

SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A 1.75-approximation algorithm for unsigned translocation distance

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The streaming complexity of cycle counting, sorting by reversals, and other problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The median problem for the reversal distance in circular bacterial genomes

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A 1.375-approximation algorithm for sorting by transpositions

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A parallel implementation for determining genomic distances under deletion and insertion

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Genome halving problem revisited

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Evolution of tandemly repeated sequences through duplication and inversion

RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
A PQ framework for reconstructions of common ancestors and phylogeny

RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Calculating genomic distances in parallel using OpenMP

Transactions on Computational Systems Biology II
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

Journal of Computer and System Sciences
Conservation of combinatorial structures in evolution scenarios

RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Genome rearrangement in mitochondria and its computational biology

RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a quadratic time algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation by Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.