Complexity of molecules
- PMID: 10955519
- DOI: 10.1021/ci9901183
Complexity of molecules
Abstract
Several currently used measures of the complexity of molecules, such as, for example, those by Bertz and Randic or those based on the number of spanning trees, are briefly reviewed. We also proposed as complexity measures the sum of vertex-weights and the sum of edge-weights and their variants related to partition of vertex-weights and edge-weights into classes by their numerical values. The vertex-weights considered are the squares of the vertex-degrees, and the edge-weights are products of vertex-degrees making up the edges. Comparison is made between considered complexity measures for selected molecular graphs. All considered indices increase with increasing size and cyclicity and most with increasing branching. However, they differ regarding the influence of symmetry.
Similar articles
-
Walk counts, labyrinthicity, and complexity of acyclic and cyclic graphs and molecules.J Chem Inf Comput Sci. 2000 Jan;40(1):99-106. doi: 10.1021/ci9900579. J Chem Inf Comput Sci. 2000. PMID: 10661555
-
On the centrality of vertices of molecular graphs.J Comput Chem. 2013 Nov 5;34(29):2514-23. doi: 10.1002/jcc.23413. Epub 2013 Aug 19. J Comput Chem. 2013. PMID: 23955387
-
Overall connectivities/topological complexities: a new powerful tool for QSPR/QSAR.J Chem Inf Comput Sci. 2000 Jul;40(4):934-41. doi: 10.1021/ci990120u. J Chem Inf Comput Sci. 2000. PMID: 10955521
-
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. SAR QSAR Environ Res. 2006. PMID: 16920663
-
Overall connectivity--a next generation molecular connectivity.J Mol Graph Model. 2001;20(1):65-75. doi: 10.1016/s1093-3263(01)00101-2. J Mol Graph Model. 2001. PMID: 11760004 Review.
Cited by
-
The hierarchical organization of autocatalytic reaction networks and its relevance to the origin of life.PLoS Comput Biol. 2022 Sep 9;18(9):e1010498. doi: 10.1371/journal.pcbi.1010498. eCollection 2022 Sep. PLoS Comput Biol. 2022. PMID: 36084149 Free PMC article.
-
A probabilistic framework for identifying biosignatures using Pathway Complexity.Philos Trans A Math Phys Eng Sci. 2017 Dec 28;375(2109):20160342. doi: 10.1098/rsta.2016.0342. Philos Trans A Math Phys Eng Sci. 2017. PMID: 29133442 Free PMC article.
-
[COMMODE] a large-scale database of molecular descriptors using compounds from PubChem.Source Code Biol Med. 2013 Nov 13;8(1):22. doi: 10.1186/1751-0473-8-22. Source Code Biol Med. 2013. PMID: 24225386 Free PMC article.
-
The importance of molecular complexity in the design of screening libraries.J Comput Aided Mol Des. 2013 Sep;27(9):783-92. doi: 10.1007/s10822-013-9683-1. J Comput Aided Mol Des. 2013. PMID: 24122490
-
Connections between classical and parametric network entropies.PLoS One. 2011 Jan 5;6(1):e15733. doi: 10.1371/journal.pone.0015733. PLoS One. 2011. PMID: 21246046 Free PMC article.