The following pages link to (Q4411359):
Displaying 34 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- 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)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- A new approach for the reversal distance with indels and moves in intergenic regions (Q2163962) (← links)
- A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- Approximating Shortest Connected Graph Transformation for Trees (Q3297756) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- Kernelization of Whitney Switches (Q4997132) (← links)
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes (Q5041123) (← links)
- Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals (Q5042264) (← links)
- (Q5140777) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- (Q6065464) (← links)
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals (Q6591644) (← links)
