The following pages link to (Q4234063):
Displaying 41 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Pancake flipping and sorting permutations (Q491630) (← links)
- Pancake flipping is hard (Q494050) (← links)
- Finding all sorting tandem duplication random loss operations (Q533407) (← links)
- An algorithm for reversal median problem (Q551853) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Decision problem for shuffled genes (Q958310) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← 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)
- Walking tree heuristics for comparative genomic alignments. (Q1427622) (← links)
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions. (Q1853543) (← links)
- Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
- Steps toward accurate reconstructions of phylogenies from gene-order data. (Q1872721) (← links)
- Genomic distances under deletions and insertions (Q1884838) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Genome rearrangements: a correct algorithm for optimal capping (Q2379988) (← links)
- Estimate the distance of genome rearrangements by reversals (Q2385374) (← links)
- Optimal algorithms for uncovering synteny problem (Q2385477) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- Reducibility of gene patterns in ciliates using the breakpoint graph. (Q2490806) (← links)
- Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
- A 1.75-approximation algorithm for unsigned translocation distance (Q2643729) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- Transforming cabbage into turnip (Q3158530) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)
- Simple Operations for Gene Assembly (Q3618682) (← links)
- Finding All Sorting Tandem Duplication Random Loss Operations (Q3637121) (← links)
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology (Q5041127) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
- Polynomial-time algorithm for computing translocation distance between genomes (Q5961622) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- Generating signed permutations by twisting two-sided ribbons (Q6547921) (← links)
