Sorting permutations by block-interchanges
From MaRDI portal
Publication:673336
DOI10.1016/S0020-0190(96)00155-XzbMATH Open0900.68232OpenAlexW2004163905MaRDI QIDQ673336FDOQ673336
Authors: David A. Christie 
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00155-x
Recommendations
Cites Work
- Bounds for sorting by prefix reversal
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Title not available (Why is that?)
- Title not available (Why is that?)
- The minimum-length generator sequence problem is NP-hard
- Genome Rearrangements and Sorting by Reversals
- The complexity of finding minimum-length generator sequences
- Sorting by insertion of leading elements
Cited In (54)
- Title not available (Why is that?)
- Permutation patterns in genome rearrangement problems
- Permutation-constrained common string partitions with applications
- On the effective and automatic enumeration of polynomial permutation classes
- Title not available (Why is that?)
- Permutations with ascending and descending blocks
- Sorting by multi-cut rearrangements
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Pattern matching with address errors: rearrangement distances
- An improved block-interchange algorithm
- Approximate string matching with stuck address bits
- Sorting by prefix block-interchanges
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- An efficient algorithm for one-sided block ordering problem with block-interchange distance
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- The average number of block interchanges needed to sort a permutation and a recent result of Stanley
- Approximate string matching with address bit errors
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
- Stacking Blocks and Counting Permutations
- Edit Distances and Factorisations of Even Permutations
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- On the relationship between histogram indexing and block-mass indexing
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- Sorting permutations: games, genomes, and cycles
- Exploiting pseudo-locality of interchange distance
- Permutation-constrained common string partitions with applications
- Sorting a permutation by best short swaps
- Interchanging graphs associated with sorting by transpositions
- A topological framework for signed permutations
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- An improved algorithm for sorting by block-interchanges based on permutation groups
- Sorting by short block-moves
- Sorting a bridge hand
- Sorting by transpositions is difficult
- Approximation algorithms for sorting permutations by extreme block-interchanges
- Interchange rearrangement: the element-cost model
- Block patterns in Stirling permutations
- On the average number of reversals needed to sort signed permutations
- Sorting with forbidden intermediates
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Sorting by \(k\)-cuts on signed permutations
- On the computational complexity of closest genome problems
- On Hultman numbers
- Approximate String Matching with Address Bit Errors
- The role of colour flows in matrix element computations and Monte Carlo simulations
- The distribution of cycles in breakpoint graphs of signed permutations
- Measures for the exceptionality of gene order in conserved genomic regions
- On the cost of interchange rearrangement in strings
- Sorting on graphs by adjacent swaps using permutation groups
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Quantifying CDS sortability of permutations by strategic pile size
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)
