Pages that link to "Item:Q818147"
From MaRDI portal
The following pages link to On the complexity of unsigned translocation distance (Q818147):
Displayed 9 items.
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← 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)
- A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
- Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling (Q4632180) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)