Pages that link to "Item:Q3550833"
From MaRDI portal
The following pages link to A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions (Q3550833):
Displayed 13 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach (Q2569412) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)