The following pages link to Sorting by Transpositions (Q4388990):
Displaying 50 items.
- Exemplar or matching: modeling DCJ problems with unequal content genome data (Q346504) (← links)
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- Hamiltonian cycles in unitary prefix transposition rearrangement graphs (Q491601) (← links)
- Pancake flipping and sorting permutations (Q491630) (← 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)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The transposition median problem is NP-complete (Q631772) (← links)
- Girth of pancake graphs (Q642997) (← links)
- On maximal instances for the original syntenic distance (Q703532) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← 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)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Multi-break rearrangements and chromosomal evolution (Q932316) (← links)
- Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes (Q947117) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- Reversal and transposition medians (Q1022594) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Sorting by bounded block-moves (Q1281770) (← 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 permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
- Reversals distance considering flexible intergenic regions sizes (Q2062007) (← links)
- The role of colour flows in matrix element computations and Monte Carlo simulations (Q2082895) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Signed Hultman numbers and signed generalized commuting probability in finite groups (Q2141083) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- A new approach for the reversal distance with indels and moves in intergenic regions (Q2163962) (← links)
- Permutation patterns in genome rearrangement problems: the reversal model (Q2181214) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- Optimal algorithms for uncovering synteny problem (Q2385477) (← links)
