Pages that link to "Item:Q1775771"

The following pages link to Sorting signed permutations by reversals, revisited (Q1775771):

Displaying 11 items.

• An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
• On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
• Sorting signed permutations by reversals using link-cut trees (Q1705654) (← links)
• Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
• The evolution of the random reversal graph (Q2396473) (← links)
• On reconstruction of signed permutations distorted by reversal errors (Q2470469) (← links)
• Sorting permutations by reversals through branch-and-price (Q2884508) (← links)
• Transforming cabbage into turnip (Q3158530) (← links)
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (Q4943850) (← links)
• Combinatorial Pattern Matching (Q5315321) (← links)
• Computing and Combinatorics (Q5716990) (← links)