An approximation algorithm for sorting by reversals and transpositions
From MaRDI portal
(Redirected from Publication:1018097)
Recommendations
Cites work
- scientific article; zbMATH DE number 1263193 (Why is no real title available?)
- scientific article; zbMATH DE number 1303563 (Why is no real title available?)
- scientific article; zbMATH DE number 1947393 (Why is no real title available?)
- scientific article; zbMATH DE number 1405677 (Why is no real title available?)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- A further improved approximation algorithm for breakpoint graph decomposition
- A simpler 1.5-approximation algorithm for sorting by transpositions
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- Improved approximation for breakpoint graph decomposition and sorting by reversals
- Sorting a bridge hand
- Sorting by Transpositions
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
Cited in
(37)- Working on the problem of sorting by transpositions on genome rearrangements
- Advances on sorting by reversals
- Replacement sort revisited: The ``gold standard unearthed!
- Pancake flipping and sorting permutations
- Average-case analysis of perfect sorting by reversals
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- A further improved approximation algorithm for breakpoint graph decomposition
- Approximation algorithms for sorting permutations by fragmentation-weighted operations
- Heuristics for the sorting signed permutations by reversals and transpositions problem
- (1+ε)-Approximation of Sorting by Reversals and Transpositions
- Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- Sorting permutations and binary strings by length-weighted rearrangements
- scientific article; zbMATH DE number 1947393 (Why is no real title available?)
- An audit tool for genome rearrangement algorithms
- A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Length-weighted \(\lambda\)-rearrangement distance
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- A New and Faster Method of Sorting by Transpositions
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- scientific article; zbMATH DE number 2073943 (Why is no real title available?)
- A new approximation algorithm for sorting of signed permutations
- Approximation algorithms for sorting permutations by length-weighted short rearrangements
- Implementation of bubble sort and the odd-even transposition sort on a rack of transputers
- Sorting of Permutations by Cost-Constrained Transpositions
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- A simpler 1.5-approximation algorithm for sorting by transpositions
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications
- Sorting permutations by prefix and suffix versions of reversals and transpositions
- Algorithms – ESA 2005
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
This page was built for publication: An approximation algorithm for sorting by reversals and transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018097)
