A simpler 1.5-approximation algorithm for sorting by transpositions
From MaRDI portal
(Redirected from Publication:3550833)
Recommendations
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- An approximation algorithm for sorting by reversals and transpositions
- (1+ε)-Approximation of Sorting by Reversals and Transpositions
- (1+)-approximation of sorting by reversals and transpositions.
- scientific article; zbMATH DE number 910920
Cited in
(20)- An approximation algorithm for sorting by reversals and transpositions
- A new approximation algorithm for unsigned translocation sorting
- Sorting signed permutations by reversals, revisited
- (1+)-approximation of sorting by reversals and transpositions.
- Sorting by shuffling methods and a queue
- Short proofs for cut-and-paste sorting of permutations
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- On sorting by 3-bounded transpositions
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
- The 1.375 approximation algorithm for sorting by transpositions can run in O(n n) time
- A New and Faster Method of Sorting by Transpositions
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- Pancake flipping and sorting permutations
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- A 14/11-approximation algorithm for sorting by short block-moves
- Sorting by shuffling methods and a queue
- A review of metrics on permutations for search landscape analysis
- Multi-break rearrangements and chromosomal evolution
This page was built for publication: A simpler 1.5-approximation algorithm for sorting by transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550833)
