The following pages link to Transforming cabbage into turnip (Q3158530):
Displaying 50 items.
- Sorting genomes by generalized translocations (Q387818) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Random induced subgraphs of Cayley graphs induced by transpositions (Q409364) (← links)
- Effect of scale on long-range random graphs and chromosomal inversions (Q453237) (← links)
- An algebraic view of bacterial genome evolution (Q476821) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Word length perturbations in certain symmetric presentations of dihedral groups (Q512537) (← links)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Girth of pancake graphs (Q642997) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- On maximal instances for the original syntenic distance (Q703532) (← links)
- Pivots, determinants, and perfect matchings of graphs (Q714808) (← links)
- A new characterization of \(\mathcal{V} \)-posets (Q781541) (← links)
- On the complexity of unsigned translocation distance (Q818147) (← links)
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- A bound for the reversal distance of genome rearrangements (Q839363) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Advances on sorting by reversals (Q876490) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- A lower bound for the breakpoint phylogeny problem (Q876716) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- Successful pressing sequences for a bicolored graph and binary matrices (Q898795) (← links)
- Sequential vs. Parallel complexity in simple gene assembly (Q924677) (← links)
- A linear time algorithm for the inversion median problem in circular bacterial genomes (Q925057) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- The fibers and range of reduction graphs in ciliates (Q938298) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes (Q947117) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- An algorithm with linear expected running time for string editing with substitutions and substring reversals (Q963370) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- Reversal and transposition medians (Q1022594) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- A new approximation algorithm for sorting of signed permutations (Q1400064) (← links)
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics (Q1633269) (← links)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach (Q1736946) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- A very elementary presentation of the Hannenhalli-Pevzner theory (Q1764894) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Efficient algorithms for multichromosomal genome rearrangements. (Q1872727) (← links)
- Estimating the expected reversal distance after a fixed number of reversals (Q1883401) (← links)
- Cycles in the burnt pancake graph (Q2009003) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
