Abstract
Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.
Author supplied keywords
Cite
CITATION STYLE
Pu, L., Zhu, D., & Jiang, H. (2016). A new approximation algorithm for unsigned translocation sorting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9838 LNCS, pp. 269–280). Springer Verlag. https://doi.org/10.1007/978-3-319-43681-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
