The following pages link to Combinatorial Pattern Matching (Q5315321):
Displaying 16 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Advances on sorting by reversals (Q876490) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Heuristics for the sorting signed permutations by reversals and transpositions problem (Q1660118) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Sorting signed permutations by reversals using link-cut trees (Q1705654) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← links)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (Q4943850) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- Algorithms – ESA 2005 (Q5475852) (← links)
