A 1.375-approximation algorithm for unsigned translocation sorting
From MaRDI portal
Publication:2186826
DOI10.1016/j.jcss.2020.05.004zbMath1444.68295OpenAlexW3026707364MaRDI QIDQ2186826
Daming Zhu, Lianrong Pu, Haitao Jiang
Publication date: 9 June 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2020.05.004
Searching and sorting (68P10) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- On the complexity of unsigned translocation distance
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- A 1.75-approximation algorithm for unsigned translocation distance
- Sorting by Transpositions Is Difficult
- Transforming cabbage into turnip
- A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Combinatorial Pattern Matching
- Polynomial-time algorithm for computing translocation distance between genomes
This page was built for publication: A 1.375-approximation algorithm for unsigned translocation sorting
