Pages that link to "Item:Q3012840"
From MaRDI portal
The following pages link to Sorting by Transpositions Is Difficult (Q3012840):
Displaying 43 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs (Q491601) (← links)
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- Improved upper bound for sorting permutations by prefix transpositions (Q2664958) (← links)
- Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations (Q2818210) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- Block Sorting Is APX-Hard (Q2947036) (← links)
- Block Crossings in Storyline Visualizations (Q2961533) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- (Q4899054) (redirect page) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions (Q5041121) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- A new upper bound for sorting permutations with prefix transpositions (Q5859487) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- (Q6065464) (← links)
- On rotation distance of rank bounded trees (Q6593700) (← links)
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss (Q6616297) (← links)
- Permutation-constrained common string partitions with applications (Q6647775) (← links)
