Pages that link to "Item:Q673336"
From MaRDI portal
The following pages link to Sorting permutations by block-interchanges (Q673336):
Displayed 38 items.
- Approximate string matching with stuck address bits (Q551176) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- The average number of block interchanges needed to sort a permutation and a recent result of Stanley (Q989529) (← links)
- Measures for the exceptionality of gene order in conserved genomic regions (Q990766) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- The role of colour flows in matrix element computations and Monte Carlo simulations (Q2082895) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← 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)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach (Q2569412) (← links)
- A versatile combinatorial approach of studying products of long cycles in symmetric groups (Q2665756) (← links)
- Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations (Q2818210) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- Edit Distances and Factorisations of Even Permutations (Q3541123) (← links)
- Sorting permutations: Games, genomes, and cycles (Q4595252) (← links)
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances (Q4992760) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- Quantifying CDS sortability of permutations by strategic pile size (Q5216454) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- (Q6065464) (← links)