The following pages link to (Q4886097):
Displaying 23 items.
- Two permutation classes related to the bubble sort operator (Q456356) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Finding all sorting tandem duplication random loss operations (Q533407) (← links)
- An algorithm for reversal median problem (Q551853) (← links)
- Sorting permutations by block-interchanges (Q673336) (← links)
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions (Q1274604) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Steps toward accurate reconstructions of phylogenies from gene-order data. (Q1872721) (← links)
- Reversal distance on genomes with different gene content and intergenic regions information (Q2062006) (← links)
- Estimate the distance of genome rearrangements by reversals (Q2385374) (← links)
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations (Q2818210) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- (Q5140777) (← links)
- Bacterial phylogeny in the Cayley graph (Q5242833) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
- Polynomial-time algorithm for computing translocation distance between genomes (Q5961622) (← links)
- Sorting with fixed-length reversals (Q5961630) (← links)
- Distances in graphs of permutations (Q6499988) (← links)
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss (Q6616297) (← links)
