Sorting sequences by symmetric reversals
From MaRDI portal
Cites work
- 1. 375-approximation algorithm for sorting by reversals
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- Minimum common string partition problem: hardness and approximations
- On sorting by unsigned symmetric reversals
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Transforming cabbage into turnip
This page was built for publication: Sorting sequences by symmetric reversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442684)