Recommendations
Cites work
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- scientific article; zbMATH DE number 910920 (Why is no real title available?)
- Bounds for sorting by prefix reversal
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- Sorting by insertion of leading elements
- The complexity of finding minimum-length generator sequences
- The minimum-length generator sequence problem is NP-hard
Cited in
(52)- Permutation patterns in genome rearrangement problems
- Permutation-constrained common string partitions with applications
- Pattern matching with address errors: rearrangement distances
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Block patterns in Stirling permutations
- Sorting a bridge hand
- Sorting by multi-cut rearrangements
- Measures for the exceptionality of gene order in conserved genomic regions
- Approximate string matching with stuck address bits
- On Hultman numbers
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- An improved algorithm for sorting by block-interchanges based on permutation groups
- Sorting a permutation by best short swaps
- Stacking Blocks and Counting Permutations
- Edit Distances and Factorisations of Even Permutations
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- The role of colour flows in matrix element computations and Monte Carlo simulations
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- Approximate string matching with address bit errors
- An efficient algorithm for one-sided block ordering problem with block-interchange distance
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Sorting on graphs by adjacent swaps using permutation groups
- On the computational complexity of closest genome problems
- On the cost of interchange rearrangement in strings
- Interchanging graphs associated with sorting by transpositions
- An improved block-interchange algorithm
- The distribution of cycles in breakpoint graphs of signed permutations
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- Sorting by prefix block-interchanges
- On the average number of reversals needed to sort signed permutations
- Approximation algorithms for sorting permutations by extreme block-interchanges
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- scientific article; zbMATH DE number 7286740 (Why is no real title available?)
- Sorting permutations: games, genomes, and cycles
- Interchange rearrangement: the element-cost model
- Permutations with ascending and descending blocks
- On the effective and automatic enumeration of polynomial permutation classes
- Approximate String Matching with Address Bit Errors
- Sorting by short block-moves
- A topological framework for signed permutations
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- On the relationship between histogram indexing and block-mass indexing
- Exploiting pseudo-locality of interchange distance
- Permutation-constrained common string partitions with applications
- The average number of block interchanges needed to sort a permutation and a recent result of Stanley
- Quantifying CDS sortability of permutations by strategic pile size
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Sorting by \(k\)-cuts on signed permutations
This page was built for publication: Sorting permutations by block-interchanges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673336)