A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (original) (raw)
Related papers
An algorithm to enumerate sorting reversals for signed permutations
2003
Sorting Signed Permutations by Inversions in O ( n log n ) Time
Journal of Computational Biology, 2010
Sorting Signed Permutations by Reversal (Reversal Distance)
Encyclopedia of Algorithms, 2008
Journal of Computational Biology, 2001
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences, 2008
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms, 2008
2008
Sorting by Restricted-Length-Weighted Reversals
Genomics, Proteomics & Bioinformatics, 2005
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science, 2009
Approximation Algorithm for Sorting by Reversals and Transpositions
2007
An algorithm to enumerate all sorting reversals
2002
The solution space of sorting by reversals
2007
Sorting by Reciprocal Translocations via Reversals Theory
Journal of Computational Biology, 2007
Sorting by Translocations Via Reversals Theory
Lecture Notes in Computer Science, 2006
Pancake flipping and sorting permutations
Journal of Discrete Algorithms, 2015
Sorting by Prefix Reversals and Prefix Transpositions with Forward March
Arxiv preprint arXiv:0812.3933, 2008
Journal of Discrete Algorithms, 2005
Ranking and unranking permutations in linear time
Information Processing Letters, 2001
Sorting permutations with transpositions in O(n3) amortized time
Theoretical Computer Science, 2018
Sorting by Fissions, Fusions, and Signed Reversals in O(n
A loopless implementation of a gray code for signed permutations
Publications de l'Institut Mathematique, 2011
Common intervals and sorting by reversals: a marriage of necessity
2002
Edit Distances and Factorisations of Even Permutations
Algorithms-ESA 2008, 2008
A barrier for further approximating Sorting By Transpositions
arXiv (Cornell University), 2023
On compressing permutations and adaptive sorting
Theoretical Computer Science, 2013
A new 1.375-approximation algorithm for sorting by transpositions
Algorithms for Molecular Biology, 2022
Reversals and transpositions over finite alphabets
2006
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics, 2007
Sorting by Multi-cut Rearrangements
SOFSEM 2021: Theory and Practice of Computer Science, 2021