Sorting Circular Permutations by Super Short Reversals.

Gustavo Rodrigues Galvao,Christian Baudet,Zanoni Dias

IEEE/ACM Transactions on Computational Biology and Bioinformatics（2017）

引用 11|浏览6

暂无评分

摘要

We consider the problem of sorting a circular permutation by super short reversals (i.e., reversals of length at most 2), a problem that finds application in comparative genomics. Polynomial-time solutions to the unsigned version of this problem are known, but the signed version remained open. In this paper, we present the first polynomial-time solution to the signed version of this problem. Moreo...

查看译文

关键词

Sorting,Genomics,Phylogeny,Generators,Microorganisms,Transforms,Electronic mail

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要