The following pages link to (Q3393448):
Displaying 50 items.
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution (Q281902) (← links)
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- Median approximations for genomes modeled as matrices (Q301565) (← links)
- Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps (Q329537) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- New applications of interval generators to genome comparison (Q414431) (← links)
- Approximating the number of double cut-and-join scenarios (Q441869) (← links)
- An algebraic view of bacterial genome evolution (Q476821) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Crossings and nestings for arc-coloured permutations and automation (Q490316) (← links)
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990) (← links)
- Polynomial-time sortable stacks of burnt pancakes (Q627167) (← links)
- Girth of pancake graphs (Q642997) (← links)
- Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- Extremal permutations in routing cycles (Q727043) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- Counting and sampling SCJ small parsimony solutions (Q740977) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- The complexity of genome rearrangement combinatorics under the infinite sites model (Q827869) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← 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)
- Prefix and suffix reversals on strings (Q1647842) (← links)
- Asymptotic medians of random permutations sampled from reversal random walks (Q1676301) (← links)
- Longest increasing subsequences and log concavity (Q1682614) (← links)
- Sorting by reversals and the theory of 4-regular graphs (Q1682854) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Sorting signed permutations by reversals using link-cut trees (Q1705654) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach (Q1736946) (← links)
- Length two path centered surface areas of the \((n, k)\)-star graph (Q1750617) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Reversal distance on genomes with different gene content and intergenic regions information (Q2062006) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- Metric intersection problems in Cayley graphs and the Stirling recursion (Q2375922) (← links)
- The evolution of the random reversal graph (Q2396473) (← links)
- Maximum likelihood estimates of pairwise rearrangement distances (Q2404039) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- The distribution of cycles in breakpoint graphs of signed permutations (Q2446324) (← links)
- Group-theoretic models of the inversion process in bacterial genomes (Q2510398) (← links)
