The following pages link to Algorithms – ESA 2005 (Q5475852):
Displaying 11 items.
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- A Smooth Reshuffling Algorithm for Solving the Bulterman's Problem (Q3813305) (← links)
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group (Q5109076) (← links)