Pages that link to "Item:Q4877518"
From MaRDI portal
The following pages link to Genome Rearrangements and Sorting by Reversals (Q4877518):
Displayed 50 items.
- An algebraic view of bacterial genome evolution (Q476821) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Pancake flipping is hard (Q494050) (← 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)
- An algorithm for reversal median problem (Q551853) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- Sorting permutations by block-interchanges (Q673336) (← 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)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- On the complexity of unsigned translocation distance (Q818147) (← links)
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- A bound for the reversal distance of genome rearrangements (Q839363) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes (Q887405) (← links)
- Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Vertex reconstruction in Cayley graphs (Q1011492) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Reversal and transposition medians (Q1022594) (← links)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions (Q1274604) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← 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)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- On minimal generating sets for symmetric and alternating groups (Q1734155) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Estimating the expected reversal distance after a fixed number of reversals (Q1883401) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
- String factorisations with maximum or minimum dimension (Q2006777) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Reversal distance on genomes with different gene content and intergenic regions information (Q2062006) (← links)
- Reversals distance considering flexible intergenic regions sizes (Q2062007) (← links)
- Signed Hultman numbers and signed generalized commuting probability in finite groups (Q2141083) (← links)
- A mean first passage time genome rearrangement distance (Q2182305) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)