A factor-(1.408+) approximation for sorting unsigned genomes by reciprocal translocations
From MaRDI portal
Publication:897944
DOI10.1016/J.TCS.2015.04.036zbMATH Open1332.68286OpenAlexW599463929MaRDI QIDQ897944FDOQ897944
Haitao Jiang, Binhai Zhu, Lusheng Wang, Daming Zhu
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.036
Recommendations
- A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
- A new approximation algorithm for unsigned translocation sorting
- A 1.375-approximation algorithm for unsigned translocation sorting
- An approximation algorithm for sorting by reversals and transpositions
- A 1.75-approximation algorithm for unsigned translocation distance
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial-time algorithm for computing translocation distance between genomes
- Title not available (Why is that?)
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- On the complexity of unsigned translocation distance
- Combinatorial Pattern Matching
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Improved approximation for breakpoint graph decomposition and sorting by reversals
- A further improved approximation algorithm for breakpoint graph decomposition
- A 1.75-approximation algorithm for unsigned translocation distance
Cited In (2)
This page was built for publication: A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897944)
