The following pages link to (Q4886096):
Displaying 18 items.
- Sorting genomes by generalized translocations (Q387818) (← links)
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations (Q655439) (← links)
- Sorting permutations by block-interchanges (Q673336) (← links)
- On the complexity of unsigned translocation distance (Q818147) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics (Q1633269) (← links)
- Reconstructing an ancestral genome using minimum segments duplications and reversals. (Q1872714) (← links)
- A 1.375-approximation algorithm for unsigned translocation sorting (Q2186826) (← 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)
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
- Polynomial-time algorithm for computing translocation distance between genomes (Q5961622) (← links)
- Exact and approximation algorithms for the contiguous translocation distance problem (Q6658300) (← links)
