Genome Rearrangements and Sorting by Reversals
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A quadratic time 2-approximation algorithm for block sorting
- Distribution of segment lengths in genome rearrangements
- Vertex reconstruction in Cayley graphs
- An approximation algorithm for sorting by reversals and transpositions
- On approximating four covering and packing problems
- Reversal and transposition medians
- Probabilistic models of genome shuffling
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- On the complexity and approximation of syntenic distance
- Sorting by bounded block-moves
- Reconstructing a history of recombinations from a set of sequences
- On the tightness of the alternating-cycle lower bound for sorting by reversals
- A new approximation algorithm for sorting of signed permutations
- Shuffling chromosomes
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- Sorting permutations by limited-size operations
- Sorting by reversals and the theory of 4-regular graphs
- On the average number of reversals needed to sort signed permutations
- On minimal generating sets for symmetric and alternating groups
- Sorting signed permutations by reversals, revisited
- Packing triangles in bounded degree graphs.
- (1+)-approximation of sorting by reversals and transpositions.
- Efficient algorithms for multichromosomal genome rearrangements.
- Estimating the expected reversal distance after a fixed number of reversals
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- String factorisations with maximum or minimum dimension
- Sorting a permutation by best short swaps
- Reversal distance on genomes with different gene content and intergenic regions information
- Reversals distance considering flexible intergenic regions sizes
- Signed Hultman numbers and signed generalized commuting probability in finite groups
- Permutation patterns in genome rearrangement problems: the reversal model
- A mean first passage time genome rearrangement distance
- Maximum cycle packing in Eulerian graphs using local traces
- Compatible cycles and CHY integrals
- A topological framework for signed permutations
- The spectral gap of graphs arising from substring reversals
- Sorting on graphs by adjacent swaps using permutation groups
- On sorting unsigned permutations by double-cut-and-joins
- Genome rearrangements: a correct algorithm for optimal capping
- Estimate the distance of genome rearrangements by reversals
- Optimal algorithms for uncovering synteny problem
- The evolution of the random reversal graph
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- The distribution of cycles in breakpoint graphs of signed permutations
- Multiple genome rearrangement by swaps and by element duplications
- Edit distance with move operations
- Reconstruction of permutations distorted by reversal errors
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- On sorting by 3-bounded transpositions
- Genome rearrangements with partially ordered chromosomes
- Group-theoretic models of the inversion process in bacterial genomes
- Generating a random signed permutation with random reversals
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- A 1.75-approximation algorithm for unsigned translocation distance
- scientific article; zbMATH DE number 1615283 (Why is no real title available?)
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- An audit tool for genome rearrangement algorithms
- Sorting by Cuts, Joins and Whole Chromosome Duplications
- scientific article; zbMATH DE number 2185633 (Why is no real title available?)
- On the similarity of sets of permutations and its applications to genome comparison
- Two-sided group digraphs and graphs
- A faster algorithm for genomic sorting problem
- Edge-disjoint packing of stars and cycles
- Rearrangement of Noisy Genomes
- Efficient data structures and a new randomized approach for sorting signed permutations by reversals
- On the expectation and variance of the reversal distance
- Finding All Sorting Tandem Duplication Random Loss Operations
- scientific article; zbMATH DE number 4049453 (Why is no real title available?)
- scientific article; zbMATH DE number 1263193 (Why is no real title available?)
- scientific article; zbMATH DE number 1301599 (Why is no real title available?)
- scientific article; zbMATH DE number 1342319 (Why is no real title available?)
- Sorting by Transpositions
- scientific article; zbMATH DE number 1945172 (Why is no real title available?)
- scientific article; zbMATH DE number 1754614 (Why is no real title available?)
- An algebraic view of bacterial genome evolution
- scientific article; zbMATH DE number 1830749 (Why is no real title available?)
- Sorting by prefix reversals and prefix transpositions
- Experiments in Computing Sequences of Reversals
- scientific article; zbMATH DE number 871927 (Why is no real title available?)
- scientific article; zbMATH DE number 910920 (Why is no real title available?)
- Pancake flipping and sorting permutations
- scientific article; zbMATH DE number 1405677 (Why is no real title available?)
- Intersection graphs of general linear groups
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- The structure of Cayley graphs of dihedral groups of valencies 1, 2 and 3
- Two examples of Wilf-collapse
- Weighted Minimum-Length Rearrangement Scenarios.
- Finding Local Genome Rearrangements
- Word length perturbations in certain symmetric presentations of dihedral groups
- scientific article; zbMATH DE number 7286740 (Why is no real title available?)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- Packing Euler graphs with traces
- APPROXIMATE BLOCK SORTING
- Combinatorial Pattern Matching
- Finding all sorting tandem duplication random loss operations
- A 14/11-approximation algorithm for sorting by short block-moves
- Algorithms for multiple genome rearrangements by signed reversals
- Experimental and statistical analysis of sorting by reversals
This page was built for publication: Genome Rearrangements and Sorting by Reversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877518)
