• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

带有插入和缺失的双切割与连接。

Double cut and join with insertions and deletions.

作者信息

Braga Marília D V, Willing Eyla, Stoye Jens

机构信息

Technische Fakultät, Universität Bielefeld, Bielefeld, Germany.

出版信息

J Comput Biol. 2011 Sep;18(9):1167-84. doi: 10.1089/cmb.2011.0118.

DOI:10.1089/cmb.2011.0118
PMID:21899423
Abstract

Many approaches to compute the genomic distance are still limited to genomes with the same content, without duplicated markers. However, differences in the gene content are frequently observed and can reflect important evolutionary aspects. While duplicated markers can hardly be handled by exact models, when duplicated markers are not allowed, a few polynomial time algorithms that include genome rearrangements, insertions and deletions were already proposed. In an attempt to improve these results, in the present work we give the first linear time algorithm to compute the distance between two multichromosomal genomes with unequal content, but without duplicated markers, considering insertions, deletions and double cut and join (DCJ) operations. We derive from this approach algorithms to sort one genome into another one also using DCJ operations, insertions and deletions. The optimal sorting scenarios can have different compositions and we compare two types of sorting scenarios: one that maximizes and one that minimizes the number of DCJ operations with respect to the number of insertions and deletions. We also show that, although the triangle inequality can be disrupted in the proposed genomic distance, it is possible to correct this problem adopting a surcharge on the number of non-common markers. We use our method to analyze six species of Rickettsia, a group of obligate intracellular parasites, and identify preliminary evidence of clusters of deletions.

摘要

许多计算基因组距离的方法仍然局限于具有相同内容且无重复标记的基因组。然而,基因内容的差异经常被观察到,并且可以反映重要的进化方面。虽然精确模型很难处理重复标记,但当不允许重复标记时,已经提出了一些包括基因组重排、插入和缺失的多项式时间算法。为了改进这些结果,在本工作中,我们给出了第一个线性时间算法,用于计算两个内容不等但无重复标记的多染色体基因组之间的距离,同时考虑插入、缺失和双切割与连接(DCJ)操作。我们从这种方法推导出算法,也使用DCJ操作、插入和缺失将一个基因组排序为另一个基因组。最优排序方案可以有不同的组成,我们比较了两种类型的排序方案:一种是相对于插入和缺失的数量最大化DCJ操作的数量,另一种是最小化DCJ操作的数量。我们还表明,虽然在所提出的基因组距离中三角不等式可能会被打破,但通过对非共同标记的数量收取附加费可以纠正这个问题。我们使用我们的方法分析了立克次氏体属的六个物种,这是一组专性细胞内寄生虫,并确定了缺失簇的初步证据。

相似文献

1
Double cut and join with insertions and deletions.带有插入和缺失的双切割与连接。
J Comput Biol. 2011 Sep;18(9):1167-84. doi: 10.1089/cmb.2011.0118.
2
On the weight of indels in genomic distances.在基因组距离中的插入缺失的权重。
BMC Bioinformatics. 2011 Oct 5;12 Suppl 9(Suppl 9):S13. doi: 10.1186/1471-2105-12-S9-S13.
3
Sorting Linear Genomes with Rearrangements and Indels.通过重排和插入缺失对线性基因组进行排序
IEEE/ACM Trans Comput Biol Bioinform. 2015 May-Jun;12(3):500-6. doi: 10.1109/TCBB.2014.2329297.
4
Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.受限 DCJ 插入缺失模型:使用 DCJ 和插入缺失对线性基因组进行排序。
BMC Bioinformatics. 2012;13 Suppl 19(Suppl 19):S14. doi: 10.1186/1471-2105-13-S19-S14. Epub 2012 Dec 19.
5
Restricted DCJ model: rearrangement problems with chromosome reincorporation.受限DCJ模型:带染色体重新纳入的重排问题
J Comput Biol. 2011 Sep;18(9):1231-41. doi: 10.1089/cmb.2011.0116.
6
Genomic distance under gene substitutions.基因替换下的基因组距离。
BMC Bioinformatics. 2011 Oct 5;12 Suppl 9(Suppl 9):S8. doi: 10.1186/1471-2105-12-S9-S8.
7
Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes.具有线性和环状染色体的完美DCJ重排方案的计算。
J Comput Biol. 2009 Oct;16(10):1287-309. doi: 10.1089/cmb.2009.0088.
8
On the inversion-indel distance.关于倒位缺失距离。
BMC Bioinformatics. 2013;14 Suppl 15(Suppl 15):S3. doi: 10.1186/1471-2105-14-S15-S3. Epub 2013 Oct 15.
9
Genome halving and double distance with losses.基因组减半与带损失的双倍距离。
J Comput Biol. 2011 Sep;18(9):1185-99. doi: 10.1089/cmb.2011.0136.
10
The solution space of sorting by DCJ.基于DCJ排序的解空间
J Comput Biol. 2010 Sep;17(9):1145-65. doi: 10.1089/cmb.2010.0109.

引用本文的文献

1
Reconstructing rearrangement phylogenies of natural genomes.重建天然基因组的重排系统发育树。
Algorithms Mol Biol. 2025 Jun 7;20(1):10. doi: 10.1186/s13015-025-00279-5.
2
Six Newly Sequenced Chloroplast Genomes From Quadriflagellate Chlamydomonadales (Chlorophyceae): Phylogeny and Comparative Genome Analyses.来自四鞭毛衣藻目(绿藻纲)的六个新测序叶绿体基因组:系统发育和比较基因组分析
Genome Biol Evol. 2025 Apr 30;17(5). doi: 10.1093/gbe/evaf074.
3
Molecular phylogeny and comparative chloroplast genome analysis of the type species Crucigenia quadrata.
模式种四角十字藻的分子系统发育与叶绿体基因组比较分析
BMC Plant Biol. 2025 Jan 16;25(1):64. doi: 10.1186/s12870-025-06070-3.
4
Applying rearrangement distances to enable plasmid epidemiology with pling.应用重排距离使 pling 能够进行质粒流行病学研究。
Microb Genom. 2024 Oct;10(10). doi: 10.1099/mgen.0.001300.
5
RIBAP: a comprehensive bacterial core genome annotation pipeline for pangenome calculation beyond the species level.RIBAP:一种全面的细菌核心基因组注释管道,用于超越物种水平的泛基因组计算。
Genome Biol. 2024 Jul 1;25(1):170. doi: 10.1186/s13059-024-03312-9.
6
Family-Free Genome Comparison.无家族基因组比较。
Methods Mol Biol. 2024;2802:57-72. doi: 10.1007/978-1-0716-3838-5_3.
7
The Floor Is Lava: Halving Natural Genomes with Viaducts, Piers, and Pontoons.“地板是熔岩”:利用高架桥、桥墩和浮桥将天然基因组减半。
J Comput Biol. 2024 Apr;31(4):294-311. doi: 10.1089/cmb.2023.0330. Epub 2024 Apr 15.
8
Recombinations, chains and caps: resolving problems with the DCJ-indel model.重组、链与端粒帽:用DCJ-插入缺失模型解决问题
Algorithms Mol Biol. 2024 Feb 27;19(1):8. doi: 10.1186/s13015-024-00253-7.
9
Efficient gene orthology inference via large-scale rearrangements.通过大规模重排进行高效的基因直系同源推断。
Algorithms Mol Biol. 2023 Sep 28;18(1):14. doi: 10.1186/s13015-023-00238-y.
10
Generalizations of the genomic rank distance to indels.广义基因组秩距离与插入缺失
Bioinformatics. 2023 Mar 1;39(3). doi: 10.1093/bioinformatics/btad087.