.png){kind=icon}
返回
Sorting Signed Permutations by Intergenic Reversals
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2020.2993002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Genome rearrangements are mutations affecting large portions of a genome, and a reversal is one of the most studied genome rearrangements in the literature through the Sorting by Reversals (SbR) problem. SbR is solvable in polynomial time on signed permutations (i.e., the gene orientation is known), and it is NP-hard on unsigned permutations. This problem (and many others considering genome rearrangements) models genome as a list of its genes in the order they appear, ignoring all other information present in the genome. Recent works claimed that the incorporation of the size of intergenic regions, i.e., sequences of nucleotides between genes, may result in better estimators for the real distance between genomes. Here we introduce the Sorting Signed Permutations by Intergenic Reversals problem, that sorts a signed permutation using reversals both on gene order and intergenic sizes. We show that this problem is NP-hard by a reduction from the 3-partition problem. Then, we propose a 2-approximation algorithm for it. Finally, we also incorporate intergenic indels (i.e., insertions or deletions of intergenic regions) to overcome a limitation of sorting by conservative events (such as reversals) and propose two approximation algorithms.
Keyword:
Genomics
Bioinformatics
Sorting
Approximation algorithms
Electronic mail
Transforms
Time complexity
Genome rearrangements
intergenic regions
signed permutations
reversals
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
查看更多机构
引用论文
分享收藏Predicted Strain Coverage of a New Meningococcal Multicomponent Vaccine (4CMenB) in Spain: Analysis of the Differences with Other European Countries.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏 没有更多内容