Sorting by Transpositions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A quadratic time 2-approximation algorithm for block sorting
- An approximation algorithm for sorting by reversals and transpositions
- Reversal and transposition medians
- Approximate string matching with address bit errors
- Sorting by bounded block-moves
- A new approximation algorithm for sorting of signed permutations
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Edit distance with block deletions
- Diameter bounds and recursive properties of Full-Flag Johnson graphs
- Uniquely pressable graphs: characterization, enumeration, and recognition
- (1+)-approximation of sorting by reversals and transpositions.
- Reconstructing an ancestral genome using minimum segments duplications and reversals.
- Reversals distance considering flexible intergenic regions sizes
- The role of colour flows in matrix element computations and Monte Carlo simulations
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Signed Hultman numbers and signed generalized commuting probability in finite groups
- Approximation algorithms for sorting by bounded singleton moves
- Exploiting pseudo-locality of interchange distance
- Sorting by \(k\)-cuts on signed permutations
- A new approach for the reversal distance with indels and moves in intergenic regions
- Permutation patterns in genome rearrangement problems: the reversal model
- Approximation algorithms for sorting permutations by extreme block-interchanges
- On the computational complexity of closest genome problems
- Counting sorting scenarios and intermediate genomes for the rank distance
- A topological framework for signed permutations
- Estimate the distance of genome rearrangements by reversals
- Optimal algorithms for uncovering synteny problem
- Computing similarity distances between rankings
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- Edit distance with move operations
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- On sorting by 3-bounded transpositions
- Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
- Improved upper bound for sorting permutations by prefix transpositions
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- Sorting strings by reversals and by transpositions
- An audit tool for genome rearrangement algorithms
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
- Block Sorting Is APX-Hard
- Computing signed permutations of polygons
- On Sorting by 3-Bounded Transpositions
- Exemplar or matching: modeling DCJ problems with unequal content genome data
- A New and Faster Method of Sorting by Transpositions
- Approximate String Matching with Address Bit Errors
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- Edit Distances and Factorisations of Even Permutations
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
- Interchanging graphs associated with sorting by transpositions
- Finding All Sorting Tandem Duplication Random Loss Operations
- scientific article; zbMATH DE number 1301599 (Why is no real title available?)
- scientific article; zbMATH DE number 1342319 (Why is no real title available?)
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- A (1+)-approximation algorithm for sorting by short block-moves
- Sorting permutations: games, genomes, and cycles
- Hultman numbers and generalized commuting probability in finite groups
- Sorting by prefix reversals and prefix transpositions
- Genome Rearrangements and Sorting by Reversals
- scientific article; zbMATH DE number 910919 (Why is no real title available?)
- scientific article; zbMATH DE number 910920 (Why is no real title available?)
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs
- Pancake flipping and sorting permutations
- Tighter upper bound for sorting permutations with prefix transpositions
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- APPROXIMATE BLOCK SORTING
- Finding similar/diverse solutions in answer set programming
- Extension of the Bafna-Pevzner theory for the transposition sorting problem
- Transposition rearrangement: linear algorithm for length-cost model
- A 14/11-approximation algorithm for sorting by short block-moves
- Approximate string matching with stuck address bits
- Block Sorting is Hard
- A new upper bound for sorting permutations with prefix transpositions
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- On the effective and automatic enumeration of polynomial permutation classes
- Sorting by prefix block-interchanges
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Rearrangement events on circular genomes
- Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
- Block crossings in one-sided tanglegrams
- The transposition median problem is NP-complete
- Girth of pancake graphs
- Constant time and space updates for the sigma-tau problem
- Block crossings in one-sided tanglegrams
- On the complexity of the median and closest permutation problems
- Permutations with restricted cycle lengths
- Exploiting pseudo-locality of interchange distance
- On reduced unicellular hypermonopoles
- Can the 1.375 approximation ratio of unsigned genomes distances be improved?
- Transposition diameter on circular binary strings
- On maximal instances for the original syntenic distance
- Constructing permutation codes under the generalized Kendall- metric
- Interchange rearrangement: the element-cost model
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- Bounding prefix transposition distance for strings and permutations
- The complexity of genome rearrangement combinatorics under the infinite sites model
- Sorting by multi-cut rearrangements
- Structural properties and tractability results for linear synteny
This page was built for publication: Sorting by Transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388990)
