Transforming cabbage into turnip
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1263193
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Sorting signed permutations by reversals, revisited
- SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
- Heuristics for the sorting signed permutations by reversals and transpositions problem
- Efficient data structures and a new randomized approach for sorting signed permutations by reversals
- Sorting signed permutations by reversals using link-cut trees
- A new approximation algorithm for sorting of signed permutations
Cited in
(only showing first 100 items - show all)- Reversal and transposition medians
- A new linear time algorithm to compute the genomic distance via the double cut and join distance
- 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
- Prefix and suffix reversals on strings
- Sorting by reversals and the theory of 4-regular graphs
- Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach
- Uniquely pressable graphs: characterization, enumeration, and recognition
- A very elementary presentation of the Hannenhalli-Pevzner theory
- Sorting signed permutations by reversals, revisited
- Efficient algorithms for multichromosomal genome rearrangements.
- Estimating the expected reversal distance after a fixed number of reversals
- Cycles in the burnt pancake graph
- Quick greedy computation for minimum common string partition
- Length-weighted \(\lambda\)-rearrangement distance
- 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
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations
- Approximation algorithms for sorting permutations by length-weighted short rearrangements
- Entropic fluctuations in DNA sequences
- 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
- A 1.375-approximation algorithm for unsigned translocation sorting
- Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny
- Breakpoint distance and PQ-trees
- A topological framework for signed permutations
- Sorting on graphs by adjacent swaps using permutation groups
- The evolution of the random reversal graph
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- The distribution of cycles in breakpoint graphs of signed permutations
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- Genome rearrangements with partially ordered chromosomes
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
- Improved upper bound for sorting permutations by prefix transpositions
- Moduli spaces and macromolecules
- New genome similarity measures based on conserved gene adjacencies
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Average-case analysis of perfect sorting by reversals
- Prefix and Suffix Reversals on Strings
- Quick greedy computation for minimum common string partitions
- Approximating shortest connected graph transformation for trees
- Adjacent Swaps on Strings
- An Evolutionary Distance Based on Maximal Unique Matches
- Average-Case Analysis of Perfect Sorting by Reversals
- Sorting genomes by generalized translocations
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- Random induced subgraphs of Cayley graphs induced by transpositions
- scientific article; zbMATH DE number 1263193 (Why is no real title available?)
- Effect of scale on long-range random graphs and chromosomal inversions
- scientific article; zbMATH DE number 1786450 (Why is no real title available?)
- Sorting permutations: games, genomes, and cycles
- Statistical and Combinatorial Aspects of Comparative Genomics*
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- An algebraic view of bacterial genome evolution
- A retrospective on genomic preprocessing for comparative genomics
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- The potential of family-free genome comparison
- Kernelization of Whitney switches
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs
- Heuristics for reversal distance between genomes with duplicated genes
- Computing the rearrangement distance of natural genomes
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group
- Word length perturbations in certain symmetric presentations of dihedral groups
- scientific article; zbMATH DE number 7286740 (Why is no real title available?)
- Aligning and Labeling Genomes under the Duplication-Loss Model
- A representation-theoretic approach to the calculation of evolutionary distance in bacteria
- A 14/11-approximation algorithm for sorting by short block-moves
- Experimental and statistical analysis of sorting by reversals
- Signed genome rearrangement by reversals and transpositions: Models and approximations
- Sorting by prefix block-interchanges
- Lengths of cycles in generalized pancake graphs
- An Algorithm to Enumerate Grid Signed Permutation Classes
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023
- Rearrangement events on circular genomes
- On the class of double distance problems
- An algebraic model for inversion and deletion in bacterial genome rearrangement
- Invertibility of Digraphs and Tournaments
- Polynomial-time sortable stacks of burnt pancakes
- Girth of pancake graphs
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Complexity and enumeration in models of genome rearrangement
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss
- Short topological decompositions of non-orientable surfaces
- Some integer values in the spectra of burnt pancake graphs
- Complexity and enumeration in models of genome rearrangement
- Sorting genomes by prefix double-cut-and-joins
- Sorting permutations and binary strings by length-weighted rearrangements
- Improved approximation algorithm and hardness result for sorting unsigned strings by symmetric reversals
- Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
- The `Butterfly effect' in Cayley graphs with applications to genomics.
- On sorting by unsigned symmetric reversals
- Can the 1.375 approximation ratio of unsigned genomes distances be improved?
- On maximal instances for the original syntenic distance
- Pivots, determinants, and perfect matchings of graphs
This page was built for publication: Transforming cabbage into turnip
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158530)
