Pages that link to "Item:Q1764894"
From MaRDI portal
The following pages link to A very elementary presentation of the Hannenhalli-Pevzner theory (Q1764894):
Displaying 15 items.
- Word length perturbations in certain symmetric presentations of dihedral groups (Q512537) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- Successful pressing sequences for a bicolored graph and binary matrices (Q898795) (← links)
- Sequential vs. Parallel complexity in simple gene assembly (Q924677) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Cycles in the burnt pancake graph (Q2009003) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- Sorting permutations: Games, genomes, and cycles (Q4595252) (← links)
- On the flip graphs on perfect matchings of complete graphs and signed reversal graphs (Q5026994) (← links)
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes (Q5041123) (← links)
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals (Q6591644) (← links)
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss (Q6616297) (← links)
