A Computational Approach towards Fragment Based Drug Design and Analysis Using G = (V, E) Decomposition

Article Sidebar

PDF
DOI: https://doi.org/10.28924/2291-8639-23-2025-26
Published: Jan 27, 2025
Cite as:
M. Sivasankari, M. Yamuna, A Computational Approach towards Fragment Based Drug Design and Analysis Using G = (V, E) Decomposition, Int. J. Anal. Appl., 23 (2025), 26.

Main Article Content

M. Sivasankari, M. Yamuna

Abstract

Objectives: To develop an efficient algorithm for decomposing arbitrary graphs into circuits and paths, thereby enabling a more comprehensive analysis of molecules for fragment-based drug design. Methods: We have devised Algorithm GD for decomposing any graph into its constituent circuits and paths. A MATLAB implementation of this algorithm was developed to generate the necessary outputs. Algorithm GD was applied to identify nonoverlapping fragments within drug molecules. Results: The MATLAB code’s performance was evaluated in terms of sample outputs and runtime calculations. Algorithm GD was successfully employed to determine the non-overlapping fragments of fungicides. Subsequently, the Wiener Index of these fragments was calculated. Conclusion: A regression equation was established between the graph Wiener Index estimated from non-overlapping fragments and log KOC values. This model can be utilized to predict the log KOC values of fungicides without the need for experimental setups, thereby streamlining the drug discovery process.

Article Details

References

  1. B.C. Wagner, Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs, Graphs Comb. 29 (2013), 1549–1555. https://doi.org/10.1007/s00373-012-1208-5.
  2. A. Austin, B. Wagner, Ascending Subgraph Decompositions of Oriented Graphs That Factor into Triangles, Discuss. Math.: Graph Theory 42 (2020), 811–822. https://doi.org/10.7151/dmgt.2306.
  3. H. Gao, J. Wang, Y. Han, J. Sun, Enhancing Crystal Structure Prediction by Decomposition and Evolution Schemes Based on Graph Theory, Fund. Res. 1 (2021), 466–471. https://doi.org/10.1016/j.fmre.2021.06.005.
  4. J. Guo, M. Li, T. Wu, A New View toward Vertex Decomposable Graphs, Discr. Math. 345 (2022), 112953. https://doi.org/10.1016/j.disc.2022.112953.
  5. A. El-Mesady, Y.S. Hamed, H. Shabana, On the Decomposition of Circulant Graphs Using Algorithmic Approaches, Alexandria Eng. J. 61 (2022), 8263–8275. https://doi.org/10.1016/j.aej.2022.01.049.
  6. D. Saranya, S. Jeevadoss, Decomposition of Hypercube Graphs into Paths and Cycles of Length Four, AKCE Int. J. Graphs Comb. 19 (2022), 141–145. https://doi.org/10.1080/09728600.2022.2084356.
  7. K. Arthi, C. Sankari, R. Sangeetha, {Cn,C4}-Decomposition of the Line Graph of the Complete Graph, TWMS J. Appl. Eng. Math. 12 (2022), 1441–1447.
  8. E.E.R. Merly, M. Mahiba, Some Results on Steiner Decomposition Number of Graphs, Kuwait J. Sci. 50 (2023), 1–15. https://doi.org/10.48129/kjs.16863.
  9. A.S. Issacraj, J.P. Joseph, Fork Decomposition of Some Total Graphs, Palestine J. Math. 12 (2023), 65–72.
  10. A.P. Ezhilarasi, M. Ilayaraja, A. Muthusamy, Decomposition of Tensor Product of Complete Graphs Into Cycles and Stars With Four Edges, TWMS J. Appl. Eng. Math. 13 (2023), 626–634.
  11. N.D. Tan, A Decomposition for DigraphsWith Minimum Outdegree 3 Having No Vertex Disjoint Cycles of Different Lengths, Discuss. Math.: Graph Theory, 43 (2023), 573–581.
  12. Y. Xin, W. Yang, Decomposition of the Line Graph of the Complete Graph into Stars, Discr. Math. 347 (2024), 114026. https://doi.org/10.1016/j.disc.2024.114026.
  13. S. Chandran C., R. T., Common Multiples of Paths and Stars with Crowns, Proyecciones (Antofagasta) 43 (2024), 331–344. https://doi.org/10.22199/issn.0717-6279-5720.
  14. R. Campbell, F. Hörsch, B. Moore, Decompositions into Two Linear Forests of Bounded Lengths, Discr. Math. 347 (2024), 113962. https://doi.org/10.1016/j.disc.2024.113962.
  15. J.P. Gollin, K. Hendrey, S. Oum, B. Reed, Linear Bounds on Treewidth in Terms of Excluded Planar Minors, arXiv:2402.17255 [math.CO] (2024). http://arxiv.org/abs/2402.17255.
  16. L. Niu, X. Li, Decomposing Graphs of Nonnegative Characteristic into Subgraphs with Degree Restrictions, Discr. Math. 347 (2024), 113965. https://doi.org/10.1016/j.disc.2024.113965.
  17. N.N. Ivanov, D.A. Shulga, V.A. Palyulin, Decomposition of Small Molecules for Fragment-Based Drug Design, Biophysica 3 (2023), 362–372. https://doi.org/10.3390/biophysica3020024.
  18. M. Yamuna, T. Divya, Boiling Point of Alkanes and Alkenes-From Graph Eccentricity, Res. J. Pharm. Technol. 11 (2018), 1962–1970. https://doi.org/10.5958/0974-360X.2018.00364.5.
  19. H. Wiener, Structural Determination of Paraffin Boiling Points, J. Amer. Chem. Soc. 69 (1947), 17–20. https://doi.org/10.1021/ja01193a005.
  20. https://en.wikipedia.org/wiki/Powdery_mildew.
  21. https://ipm.ucanr.edu/home-and-landscape/anthracnose/pest-notes/#gsc.tab=0.
  22. https://www.istockphoto.com/photos/rose-black-spot.
  23. https://www.istockphoto.com/photos/apple-scab.
  24. https://ppqs.gov.in/divisions/cib-rc/major-uses-of-pesticides.
  25. R. Long, J. Gan, M. Nett, Pesticide Choice: Best Management Practice (BMP) for Protecting Surface Water Quality in Agriculture, University of California, Agriculture and Natural Resources, 2005.
  26. ChemSafetyPro, Soil Adsorption Coefficient (Kd/Kf/Koc/Kfoc), https://www.chemsafetypro.com/Topics/CRA/Soil_Adsorption_Coefficient_Kd_Koc.html.
  27. https://legacy.chemspider.com.