The following pages link to (Q4250188):
Displaying 15 items.
- Sorting by prefix reversals and prefix transpositions (Q479021) (← links)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- An approximation algorithm for sorting by reversals and transpositions (Q1018097) (← links)
- A topological framework for signed permutations (Q2359959) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
- Approximating Shortest Connected Graph Transformation for Trees (Q3297756) (← links)
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions (Q4680734) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- An improved genetic algorithm for problem of genome rearrangement (Q5492501) (← links)
