Pages that link to "Item:Q2186826"
From MaRDI portal
The following pages link to A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826):
Displaying 7 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- On the complexity of unsigned translocation distance (Q818147) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- A new approximation algorithm for unsigned translocation sorting (Q1708438) (← links)
- A 1.75-approximation algorithm for unsigned translocation distance (Q2643729) (← links)
- Algorithms and Computation (Q5897872) (← links)
- Exact and approximation algorithms for the contiguous translocation distance problem (Q6658300) (← links)