Pages that link to "Item:Q1018097"
From MaRDI portal
The following pages link to An approximation algorithm for sorting by reversals and transpositions (Q1018097):
Displayed 8 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)