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

立即免费体验

基于电导率测量的新型氨基酸距离矩阵。

Novel amino acid distance matrices based on conductance measure.

机构信息

Centre for Nuclear Magnetic Resonance, Ruđer Bošković Institute, Bijenička cesta 54, HR-10000 Zagreb, Croatia.

Center for Algorithmic and Mathematical Methods in Medicine, Biology, and Biotechnology, Mannheim University of Applied Sciences, Paul Wittsack Str. 10, 68163 Mannheim, Germany.

出版信息

Biosystems. 2024 Dec;246:105355. doi: 10.1016/j.biosystems.2024.105355. Epub 2024 Oct 17.

DOI:10.1016/j.biosystems.2024.105355
PMID:39424124
Abstract

Ancestral relationships among biological species are often represented and analyzed by means of phylogenetic trees. Substitution and distance matrices are two main types of matrices that are used in phylogeny analyses. Substitution matrices describe a frequency change of amino acids in nucleotide or protein sequence over time, while distance matrices estimate phylogeny using a matrix of pairwise distances based on a particular code or analytical concept. Recent investigation by Elena Fimmel and coworkers (Life 11:1338, 2021) showed that: 1. the robustness of a genetic code against point mutations can be described using the conductance measure, and 2. all possible point mutations of the genetic code can be represented as a weighted graph with weights that correspond to the probabilities of these mutations. In this article, we constructed and tested three novel distance matrices based on conductance measure, that take into account the point mutation robustness of the Standard Genetic Code (SGC). These distance matrices are based on maximum (CMAX), average (CAVG), and minimum (CMIN) conductance-optimized distances between codons coding for individual amino acids. The performance of those distance matrices was tested on a dataset of RecA proteins in Bacteria, Archaea (RadA homolog) and Eukarya (Rad51 homolog). RecA protein and its functional homologs were selected for this investigation since they are essential for the repair and maintenance of DNA, and consequently well conserved and present in all domains of life. PAM250 and BLOSUM62 matrices were usually used as a standard for distance matrix testing. PAM250 and BLOSUM62 substitution matrices specified accurately three biological domains of life according to Carl Woese and George Fox (Proc Natl Acad Sci U S A 74:5088, 1977). An identical result was obtained using three novel distance matrices (CMIN, CMAX, CAVG). This result supports the applicability of novel distance matrices based on the conductance method and suggests that further investigations based on this approach are justified.

摘要

生物种系之间的亲缘关系通常通过系统发生树来表示和分析。替代和距离矩阵是两种主要的矩阵类型,用于系统发生分析。替代矩阵描述了核苷酸或蛋白质序列中氨基酸随时间的频率变化,而距离矩阵则使用基于特定代码或分析概念的成对距离矩阵来估计系统发生。Elena Fimmel 及其同事最近的研究表明:1. 遗传密码对点突变的稳健性可以用电导率来描述,2. 遗传密码的所有可能点突变都可以表示为一个加权图,其中权重对应于这些突变的概率。在本文中,我们构建并测试了三种基于电导率的新距离矩阵,这些矩阵考虑了标准遗传密码(SGC)的点突变稳健性。这些距离矩阵基于编码单个氨基酸的密码子之间的最大(CMAX)、平均(CAVG)和最小(CMIN)电导率优化距离。这些距离矩阵在细菌、古菌(RadA 同源物)和真核生物(Rad51 同源物)的 RecA 蛋白数据集上进行了测试。选择 RecA 蛋白及其功能同源物进行这项研究,因为它们对 DNA 的修复和维持至关重要,因此在所有生命领域都得到很好的保守和存在。PAM250 和 BLOSUM62 矩阵通常被用作距离矩阵测试的标准。Carl Woese 和 George Fox(Proc Natl Acad Sci U S A 74:5088, 1977)的 PAM250 和 BLOSUM62 替换矩阵准确地指定了生命的三个生物领域。使用三种新的距离矩阵(CMIN、CMAX、CAVG)也得到了相同的结果。这一结果支持了基于电导法的新距离矩阵的适用性,并表明基于该方法的进一步研究是合理的。

相似文献

1
Novel amino acid distance matrices based on conductance measure.基于电导率测量的新型氨基酸距离矩阵。
Biosystems. 2024 Dec;246:105355. doi: 10.1016/j.biosystems.2024.105355. Epub 2024 Oct 17.
2
New algorithm for the analysis of nucleotide and amino acid evolutionary relationships based on Klein four-group.基于 Klein 四组的核苷酸和氨基酸进化关系分析新算法。
Biosystems. 2023 Nov;233:105030. doi: 10.1016/j.biosystems.2023.105030. Epub 2023 Sep 17.
3
Robustness against point mutations of genetic code extensions under consideration of wobble-like effects.考虑到摆动样效应,遗传密码扩展的点突变抗性。
Biosystems. 2021 Oct;208:104485. doi: 10.1016/j.biosystems.2021.104485. Epub 2021 Jul 16.
4
Genetic code, hamming distance and stochastic matrices.遗传密码、汉明距离和随机矩阵。
Bull Math Biol. 2004 Sep;66(5):1405-21. doi: 10.1016/j.bulm.2004.01.002.
5
Properties of biological mutation networks and their implications for ALife.生物突变网络的特性及其对人工生命的启示。
Artif Life. 2011 Fall;17(4):353-64. doi: 10.1162/artl_a_00043. Epub 2011 Jul 15.
6
The structure of the genetic code as an optimal graph clustering problem.遗传密码的结构作为一个最优图聚类问题。
J Math Biol. 2022 Jul 15;85(1):9. doi: 10.1007/s00285-022-01778-4.
7
Phylogenetic inference with weighted codon evolutionary distances.基于加权密码子进化距离的系统发育推断。
J Mol Evol. 2009 Apr;68(4):377-92. doi: 10.1007/s00239-009-9212-y. Epub 2009 Mar 24.
8
The Quality of Genetic Code Models in Terms of Their Robustness Against Point Mutations.遗传密码模型的稳健性对点突变的质量。
Bull Math Biol. 2019 Jul;81(7):2239-2257. doi: 10.1007/s11538-019-00603-2. Epub 2019 Apr 5.
9
A Mutation Model from First Principles of the Genetic Code.基于遗传密码第一原理的突变模型。
IEEE/ACM Trans Comput Biol Bioinform. 2016 Sep-Oct;13(5):878-886. doi: 10.1109/TCBB.2015.2489641. Epub 2015 Oct 16.
10
The information capacity of the genetic code: Is the natural code optimal?遗传密码的信息容量:自然密码是最优的吗?
J Theor Biol. 2017 Apr 21;419:227-237. doi: 10.1016/j.jtbi.2017.01.046. Epub 2017 Feb 3.