Pages that link to "Item:Q2643729"
From MaRDI portal
The following pages link to A 1.75-approximation algorithm for unsigned translocation distance (Q2643729):
Displaying 8 items.
- On the complexity of unsigned translocation distance (Q818147) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- A new approximation algorithm for unsigned translocation sorting (Q1708438) (← 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)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466322) (← links)
- Algorithms and Computation (Q5897872) (← links)
- Exact and approximation algorithms for the contiguous translocation distance problem (Q6658300) (← links)