Pages that link to "Item:Q1018097"
From MaRDI portal
The following pages link to An approximation algorithm for sorting by reversals and transpositions (Q1018097):
Displaying 29 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Pancake flipping and sorting permutations (Q491630) (← 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)
- Advances on sorting by reversals (Q876490) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- Implementation of bubble sort and the odd-even transposition sort on a rack of transputers (Q1100880) (← links)
- A new approximation algorithm for sorting of signed permutations (Q1400064) (← links)
- Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← links)
- Heuristics for the sorting signed permutations by reversals and transpositions problem (Q1660118) (← links)
- A further improved approximation algorithm for breakpoint graph decomposition (Q1768609) (← links)
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications (Q1790950) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← 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)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← 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)
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach (Q2569412) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- Average-case analysis of perfect sorting by reversals (Q2890993) (← links)
- A New and Faster Method of Sorting by Transpositions (Q3506916) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)
- Algorithms – ESA 2005 (Q5475852) (← links)
- Signed genome rearrangement by reversals and transpositions: Models and approximations (Q5941291) (← links)
