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

立即免费体验

基于距离、度和特征值的网络结构歧视。

Structural discrimination of networks by using distance, degree and eigenvalue-based measures.

机构信息

UMIT, Institute for Bioinformatics and Translational Research, Hall in Tyrol, Austria.

出版信息

PLoS One. 2012;7(7):e38564. doi: 10.1371/journal.pone.0038564. Epub 2012 Jul 6.

DOI:10.1371/journal.pone.0038564
PMID:22792157
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC3391207/
Abstract

In chemistry and computational biology, structural graph descriptors have been proven essential for characterizing the structure of chemical and biological networks. It has also been demonstrated that they are useful to derive empirical models for structure-oriented drug design. However, from a more general (complex network-oriented) point of view, investigating mathematical properties of structural descriptors, such as their uniqueness and structural interpretation, is also important for an in-depth understanding of the underlying methods. In this paper, we emphasize the evaluation of the uniqueness of distance, degree and eigenvalue-based measures. Among these are measures that have been recently investigated extensively. We report numerical results using chemical and exhaustively generated graphs and also investigate correlations between the measures.

摘要

在化学和计算生物学中,结构图描述符已被证明对于描述化学和生物网络的结构至关重要。也已经证明,它们对于推导出面向结构的药物设计的经验模型是有用的。然而,从更一般的(复杂网络导向)角度来看,研究结构描述符的数学性质,例如它们的唯一性和结构解释,对于深入了解基础方法也很重要。在本文中,我们强调评估距离、度和基于特征值的度量的唯一性。其中包括最近广泛研究的度量。我们使用化学和详尽生成的图报告数值结果,还研究了这些度量之间的相关性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/ddf0c4f57311/pone.0038564.g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/d8287de2a076/pone.0038564.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/f99ad5b02d03/pone.0038564.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/23fc8bf18639/pone.0038564.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/7c3c6f24e613/pone.0038564.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/cb6c214ee13b/pone.0038564.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/bb5c1d24676e/pone.0038564.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/557816c67304/pone.0038564.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/05c54b7a4ead/pone.0038564.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/892e83eedf6a/pone.0038564.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/6a4f64f2960a/pone.0038564.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/6cc54da962cf/pone.0038564.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/3997f0b29db1/pone.0038564.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/d5c1a4c1fe27/pone.0038564.g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/ddf0c4f57311/pone.0038564.g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/d8287de2a076/pone.0038564.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/f99ad5b02d03/pone.0038564.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/23fc8bf18639/pone.0038564.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/7c3c6f24e613/pone.0038564.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/cb6c214ee13b/pone.0038564.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/bb5c1d24676e/pone.0038564.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/557816c67304/pone.0038564.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/05c54b7a4ead/pone.0038564.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/892e83eedf6a/pone.0038564.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/6a4f64f2960a/pone.0038564.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/6cc54da962cf/pone.0038564.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/3997f0b29db1/pone.0038564.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/d5c1a4c1fe27/pone.0038564.g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5622/3391207/ddf0c4f57311/pone.0038564.g014.jpg

相似文献

1
Structural discrimination of networks by using distance, degree and eigenvalue-based measures.基于距离、度和特征值的网络结构歧视。
PLoS One. 2012;7(7):e38564. doi: 10.1371/journal.pone.0038564. Epub 2012 Jul 6.
2
Interrelations of graph distance measures based on topological indices.基于拓扑指数的图距离度量的相互关系。
PLoS One. 2014 Apr 23;9(4):e94985. doi: 10.1371/journal.pone.0094985. eCollection 2014.
3
Measuring the complexity of directed graphs: A polynomial-based approach.测度有向图的复杂性:基于多项式的方法。
PLoS One. 2019 Nov 14;14(11):e0223745. doi: 10.1371/journal.pone.0223745. eCollection 2019.
4
Novel topological descriptors for analyzing biological networks.用于分析生物网络的新型拓扑描述符。
BMC Struct Biol. 2010 Jun 17;10:18. doi: 10.1186/1472-6807-10-18.
5
A large scale analysis of information-theoretic network complexity measures using chemical structures.利用化学结构对信息论网络复杂性测度进行大规模分析。
PLoS One. 2009 Dec 15;4(12):e8057. doi: 10.1371/journal.pone.0008057.
6
Integrative network biology: graph prototyping for co-expression cancer networks.综合网络生物学:共表达癌症网络的图原型。
PLoS One. 2011;6(7):e22843. doi: 10.1371/journal.pone.0022843. Epub 2011 Jul 29.
7
Chemical graphs, molecular matrices and topological indices in chemoinformatics and quantitative structure-activity relationships.化学信息学与定量构效关系中的化学图、分子矩阵和拓扑指数
Curr Comput Aided Drug Des. 2013 Jun;9(2):153-63. doi: 10.2174/1573409911309020002.
8
Exploring community structure in biological networks with random graphs.用随机图探索生物网络中的社区结构。
BMC Bioinformatics. 2014 Jun 25;15:220. doi: 10.1186/1471-2105-15-220.
9
Modeling complex metabolic reactions, ecological systems, and financial and legal networks with MIANN models based on Markov-Wiener node descriptors.基于马尔可夫-维纳节点描述符的 MIANN 模型对复杂代谢反应、生态系统以及金融和法律网络进行建模。
J Chem Inf Model. 2014 Jan 27;54(1):16-29. doi: 10.1021/ci400280n. Epub 2013 Dec 23.
10
Recent developments in quantitative graph theory: information inequalities for networks.近期定量图论的发展:网络信息不等式。
PLoS One. 2012;7(2):e31395. doi: 10.1371/journal.pone.0031395. Epub 2012 Feb 15.

引用本文的文献

1
The discrimination power of structural SuperIndices.结构超指数的判别能力。
PLoS One. 2013 Jul 25;8(7):e70551. doi: 10.1371/journal.pone.0070551. Print 2013.

本文引用的文献

1
Information indices with high discriminative power for graphs.具有高区分能力的图信息指标。
PLoS One. 2012;7(2):e31214. doi: 10.1371/journal.pone.0031214. Epub 2012 Feb 29.
2
A network-based approach to classify the three domains of life.基于网络的方法对生命的三个域进行分类。
Biol Direct. 2011 Oct 13;6:53. doi: 10.1186/1745-6150-6-53.
3
Networks for systems biology: conceptual connection of data and function.系统生物学网络:数据与功能的概念连接。
IET Syst Biol. 2011 May;5(3):185-207. doi: 10.1049/iet-syb.2010.0025.
4
New polynomial-based molecular descriptors with low degeneracy.基于多项式的低简并性分子描述符。
PLoS One. 2010 Jul 30;5(7):e11393. doi: 10.1371/journal.pone.0011393.
5
Complexity of chemical graphs in terms of size, branching, and cyclicity.化学图在大小、分支和环状结构方面的复杂性。
SAR QSAR Environ Res. 2006 Aug;17(4):429-50. doi: 10.1080/10629360600884421.
6
Can topological indices transmit information on properties but not on structures?拓扑指数能否传递有关性质而非结构的信息?
J Comput Aided Mol Des. 2005 Sep-Oct;19(9-10):651-60. doi: 10.1007/s10822-005-9010-6. Epub 2005 Nov 23.
7
Characterization of the folding degree of proteins.蛋白质折叠程度的表征
Bioinformatics. 2002 May;18(5):697-704. doi: 10.1093/bioinformatics/18.5.697.
8
Entropy and the complexity of graphs. I. An index of the relative complexity of a graph.熵与图的复杂性。I. 图的相对复杂性指标。
Bull Math Biophys. 1968 Mar;30(1):175-204. doi: 10.1007/BF02476948.