• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种在通过反转排序时保留公共区间的非对称方法。

An asymmetric approach to preserve common intervals while sorting by reversals.

作者信息

Braga Marília D V, Gautier Christian, Sagot Marie-France

机构信息

Université de Lyon, F-69000, Lyon, France.

出版信息

Algorithms Mol Biol. 2009 Dec 30;4:16. doi: 10.1186/1748-7188-4-16.

DOI:10.1186/1748-7188-4-16
PMID:20042101
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC2813847/
Abstract

BACKGROUND

The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios. However, the number of sequences is huge and some additional criteria should be used to obtain a more accurate analysis. One strategy is searching for sequences that respect constraints, such as the common intervals (clusters of co-localised genes). Another approach is to explore the whole space of sorting sequences, eventually grouping them into classes of equivalence. Recently both strategies started to be put together, to restrain the space to the sequences that respect constraints. In particular an algorithm has been proposed to list classes whose sorting sequences do not break the common intervals detected between the two initial genomes A and B. This approach may reduce the space of sequences and is symmetric (the result of the analysis sorting A into B can be obtained from the analysis sorting B into A).

RESULTS

We propose an alternative approach to restrain the space of sorting sequences, using progressive instead of initial detection of common intervals (the list of common intervals is updated after applying each reversal). This may reduce the space of sequences even more, but is shown to be asymmetric.

CONCLUSIONS

We suggest that our method may be more realistic when the relation ancestor-descendant between the analysed genomes is clear and we apply it to do a better characterisation of the evolutionary scenario of the bacterium Rickettsia felis with respect to one of its ancestors.

摘要

背景

将一个基因组转化为另一个基因组的反转距离和最优反转序列是分析进化情景的有用工具。然而,序列数量巨大,需要使用一些额外标准来获得更准确的分析。一种策略是寻找符合约束条件的序列,比如共同区间(共定位基因簇)。另一种方法是探索排序序列的整个空间,最终将它们分组为等价类。最近,这两种策略开始结合起来,将空间限制在符合约束条件的序列上。特别是,已经提出了一种算法来列出其排序序列不会破坏在两个初始基因组A和B之间检测到的共同区间的类。这种方法可能会减少序列空间,并且是对称的(将A排序为B的分析结果可以从将B排序为A的分析中获得)。

结果

我们提出了一种替代方法来限制排序序列的空间,使用逐步而非初始检测共同区间(在应用每次反转后更新共同区间列表)。这可能会进一步减少序列空间,但结果表明该方法是不对称的。

结论

我们认为,当所分析基因组之间的祖先-后代关系明确时,我们的方法可能更符合实际情况,我们将其应用于更好地描述猫立克次氏体相对于其一个祖先的进化情景。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/5fd03d17d820/1748-7188-4-16-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/4dc802901303/1748-7188-4-16-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/2a578d416398/1748-7188-4-16-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/5fd03d17d820/1748-7188-4-16-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/4dc802901303/1748-7188-4-16-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/2a578d416398/1748-7188-4-16-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d667/2813847/5fd03d17d820/1748-7188-4-16-3.jpg

相似文献

1
An asymmetric approach to preserve common intervals while sorting by reversals.一种在通过反转排序时保留公共区间的非对称方法。
Algorithms Mol Biol. 2009 Dec 30;4:16. doi: 10.1186/1748-7188-4-16.
2
baobabLUNA: the solution space of sorting by reversals.猴面包树LUNA:通过反转进行排序的解空间。
Bioinformatics. 2009 Jul 15;25(14):1833-5. doi: 10.1093/bioinformatics/btp285. Epub 2009 Apr 28.
3
Sampling solution traces for the problem of sorting permutations by signed reversals.用于通过带符号反转对排列进行排序问题的采样解决方案轨迹。
Algorithms Mol Biol. 2012 Jun 15;7(1):18. doi: 10.1186/1748-7188-7-18.
4
Exploring the solution space of sorting by reversals, with experiments and an application to evolution.通过反转进行排序的解决方案空间探索,包括实验及在进化中的应用。
IEEE/ACM Trans Comput Biol Bioinform. 2008 Jul-Sep;5(3):348-56. doi: 10.1109/TCBB.2008.16.
5
An algorithm to enumerate sorting reversals for signed permutations.一种用于枚举带符号排列的排序反转的算法。
J Comput Biol. 2003;10(3-4):575-97. doi: 10.1089/10665270360688200.
6
Perfect sorting by reversals is not always difficult.通过反转进行完美排序并不总是困难的。
IEEE/ACM Trans Comput Biol Bioinform. 2007 Jan-Mar;4(1):4-16. doi: 10.1109/TCBB.2007.1011.
7
Sorting by reversals, block interchanges, tandem duplications, and deletions.通过反转、块交换、串联重复和缺失进行排序。
BMC Bioinformatics. 2009 Jan 30;10 Suppl 1(Suppl 1):S9. doi: 10.1186/1471-2105-10-S1-S9.
8
Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance.秩距离的计数排序场景和中间基因组。
IEEE/ACM Trans Comput Biol Bioinform. 2024 May-Jun;21(3):316-327. doi: 10.1109/TCBB.2023.3277733. Epub 2024 Jun 5.
9
Genome rearrangements with duplications.基因组重排与重复。
BMC Bioinformatics. 2010 Jan 18;11 Suppl 1(Suppl 1):S27. doi: 10.1186/1471-2105-11-S1-S27.
10
On the Complexity of Sorting by Reversals and Transpositions Problems.关于通过反转和转置问题进行排序的复杂性
J Comput Biol. 2019 Nov;26(11):1223-1229. doi: 10.1089/cmb.2019.0078. Epub 2019 May 23.

引用本文的文献

1
Sampling solution traces for the problem of sorting permutations by signed reversals.用于通过带符号反转对排列进行排序问题的采样解决方案轨迹。
Algorithms Mol Biol. 2012 Jun 15;7(1):18. doi: 10.1186/1748-7188-7-18.

本文引用的文献

1
baobabLUNA: the solution space of sorting by reversals.猴面包树LUNA:通过反转进行排序的解空间。
Bioinformatics. 2009 Jul 15;25(14):1833-5. doi: 10.1093/bioinformatics/btp285. Epub 2009 Apr 28.
2
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.一种用于解决带权重反转和转置的多基因组重排问题的快速算法。
BMC Bioinformatics. 2008 Dec 4;9:516. doi: 10.1186/1471-2105-9-516.
3
Exploring the solution space of sorting by reversals, with experiments and an application to evolution.
通过反转进行排序的解决方案空间探索,包括实验及在进化中的应用。
IEEE/ACM Trans Comput Biol Bioinform. 2008 Jul-Sep;5(3):348-56. doi: 10.1109/TCBB.2008.16.
4
Evolution under reversals: parsimony and conservation of common intervals.反转下的进化:简约性与公共区间的保守性。
IEEE/ACM Trans Comput Biol Bioinform. 2007 Apr-Jun;4(2):301-9. doi: 10.1109/TCBB.2007.1042.
5
Perfect sorting by reversals is not always difficult.通过反转进行完美排序并不总是困难的。
IEEE/ACM Trans Comput Biol Bioinform. 2007 Jan-Mar;4(1):4-16. doi: 10.1109/TCBB.2007.1011.
6
Reductive genome evolution from the mother of Rickettsia.立克次氏体之母的还原性基因组进化。
PLoS Genet. 2007 Jan 19;3(1):e14. doi: 10.1371/journal.pgen.0030014.
7
Using median sets for inferring phylogenetic trees.使用中位数集推断系统发育树。
Bioinformatics. 2007 Jan 15;23(2):e129-35. doi: 10.1093/bioinformatics/btl300.
8
An algorithm to enumerate sorting reversals for signed permutations.一种用于枚举带符号排列的排序反转的算法。
J Comput Biol. 2003;10(3-4):575-97. doi: 10.1089/10665270360688200.
9
Common intervals and sorting by reversals: a marriage of necessity.常见区间与反转排序:必然的结合。
Bioinformatics. 2002;18 Suppl 2:S54-63. doi: 10.1093/bioinformatics/18.suppl_2.s54.
10
GRIMM: genome rearrangements web server.GRIMM:基因组重排网络服务器。
Bioinformatics. 2002 Mar;18(3):492-3. doi: 10.1093/bioinformatics/18.3.492.