The following pages link to (Q3393448):
Displaying 46 items.
- Group-theoretic models of the inversion process in bacterial genomes (Q2510398) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
- (Prefix) reversal distance for (signed) strings with few blocks or small alphabets (Q2628806) (← links)
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- Combinatorics of chromosomal rearrangements based on synteny blocks and synteny packs (Q2844000) (← links)
- The distance of rearrangement, the dual functional of Bowen (Q2908161) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- Prefix and Suffix Reversals on Strings (Q2949837) (← links)
- Sorting by Transpositions Is Difficult (Q3012840) (← links)
- (Q3024799) (← links)
- Comparative Genomics on Artificial Life (Q3188238) (← links)
- (Q3562783) (← links)
- The Combinatorics of Sequencing the Corn Genome (Q3608822) (← links)
- (Q3618811) (← links)
- Sorting permutations: Games, genomes, and cycles (Q4595252) (← links)
- (Q4782123) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- The Potential of Family-Free Genome Comparison (Q4992763) (← links)
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes (Q5041123) (← links)
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group (Q5109076) (← links)
- Packing Euler graphs with traces (Q5176280) (← links)
- Bacterial phylogeny in the Cayley graph (Q5242833) (← links)
- Models and Algorithms for Genome Rearrangement with Positional Constraints (Q5283831) (← links)
- Aligning and Labeling Genomes under the Duplication-Loss Model (Q5326363) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
- (Q6065464) (← links)
- Rearrangement events on circular genomes (Q6078306) (← links)
- The floor is lava -- halving genomes with viaducts, piers and pontoons (Q6086497) (← links)
- An algebraic model for inversion and deletion in bacterial genome rearrangement (Q6112440) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
- Distances in graphs of permutations (Q6499988) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- Generating signed permutations by twisting two-sided ribbons (Q6547921) (← 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)
- The \textsc{maximum zero-sum partition} problem (Q6633570) (← links)
- Some integer values in the spectra of burnt pancake graphs (Q6635251) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)
- Permutation-constrained common string partitions with applications (Q6647775) (← links)
- Sorting genomes by prefix double-cut-and-joins (Q6652451) (← links)
- Exact and approximation algorithms for the contiguous translocation distance problem (Q6658300) (← links)
