.png){kind=icon}
返回
Sorting Circular Permutations by Super Short Reversals
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2016.2515594.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. Moreover, we perform experiments for inferring phylogenies of two different groups of bacterial species and compare our results with the phylogenies presented in previous works. Finally, to facilitate phylogenetic studies based on the methods studied in this paper, we present a web tool for rearrangement-based phylogenetic inference using short operations, such as super short reversals.
Keyword:
Genome rearrangement
short reversals
circular permutations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Genome rearrangement distances and gene order phylogeny in γ-proteobacteriaΓ-变形杆菌的基因组重排距离和基因顺序系统发育
PREAI
分享收藏AUTOIMMUNE BASIS FOR VISUAL PARANEOPLASTIC SYNDROME IN PATIENTS WITH SMALL-CELL LUNG CARCINOMA.png)
The Lancet
The LancetIF0
PREAI
分享收藏PropAngio study protocol: a neoadjuvant trial on the efficacy of propranolol monotherapy in cutaneous angiosarcoma—a proof of principle studyBMJ OpenOAAI
BMJ OpenIF0
OAAI分享收藏
查看更多内容