The following pages link to Advances on sorting by reversals (Q876490):
Displaying 11 items.
- Topological morphing of planar graphs (Q386891) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Reversals Cayley graphs of symmetric groups (Q975546) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- Sorting signed permutations by reversals using link-cut trees (Q1705654) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
