{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:20:49Z","timestamp":1776424849551,"version":"3.51.2"},"reference-count":78,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>Biological networks such as protein interaction networks, gene regulation networks, and metabolic pathways are examples of complex networks that are large graphs with small-world and scale-free properties. An analysis of these networks has a profound effect on our understanding the origins of life, health, and the disease states of organisms, and it allows for the diagnosis of diseases to aid in the search for remedial processes. In this review, we describe the main analysis methods of biological networks using graph theory, by first defining the main parameters, such as clustering coefficient, modularity, and centrality. We then survey fundamental graph clustering methods and algorithms, followed by the network motif search algorithms, with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function that is carried out by that small network, and discovering such a function provides an insight into the overall function of the organism. Lastly, we review network alignment algorithms that find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor, and finding such a relationship may help researchers to derive ancestral relationships and to predict the future evolution of organisms to enable the design of new drugs. We provide a review of the research studies in all of these methods, and conclude using the current challenging areas of biological network analysis, and by using graph theory and parallel processing for high performance analysis.<\/jats:p>","DOI":"10.3390\/computation11100188","type":"journal-article","created":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T16:58:09Z","timestamp":1696179489000},"page":"188","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Graph-Theoretical Analysis of Biological Networks: A Survey"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9111-7156","authenticated-orcid":false,"given":"Kayhan","family":"Erciyes","sequence":"first","affiliation":[{"name":"Sofware Engineering Deptartment, Faculty of Engineering and Natural Sciences, Maltepe University, Maltepe, 34857 \u0130stanbul, T\u00fcrkiye"}]}],"member":"1968","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1038\/35042675","article-title":"Surfing the p53 network","volume":"408","author":"Vogelstein","year":"2000","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Carbonell, P., Anne-Galle Planson, A.-G., Davide Fichera, D., and Jean-Loup Faulon, J.-P. (2011). A retrosynthetic biology approach to metabolic pathway design for therapeutic production. BMC Syst. Biol., 5.","DOI":"10.1186\/1752-0509-5-122"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1049\/iet-syb:20060038","article-title":"Graph theory and networks in biology","volume":"1","author":"Mason","year":"2007","journal-title":"IET Syst. Biol."},{"key":"ref_4","unstructured":"Erciyes, K. (2013). Distributed and Sequential Algorithms for Bioinformatics, Springer. Chapter 7 and Chapters 10\u201313."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong","year":"2011","journal-title":"Nature"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Titz, B., Rajagopala, S.V., Goll, J., Hauser, R., McKevitt, M.T., Palzkill, T., and Uetz, P. (2008). The binary protein interactome of Treponema pallidum, the syphilis spirochete. PLoS ONE, 3.","DOI":"10.1371\/journal.pone.0002292"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"4756","DOI":"10.1523\/JNEUROSCI.0141-08.2008","article-title":"Structural insights into aberrant topological patterns of large scale cortical networks in Alzheimers disease","volume":"28","author":"He","year":"2008","journal-title":"J. Neurosci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1038\/73786","article-title":"A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks","volume":"18","author":"Schuster","year":"2000","journal-title":"Nat. Biotechnol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.cell.2011.02.016","article-title":"Interactome networks and human disease","volume":"144","author":"Vidal","year":"2011","journal-title":"Cell"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Junker, B. (2008). Analysis of Biological Networks, Wiley. Chapter 9.","DOI":"10.1002\/9780470253489"},{"key":"ref_11","unstructured":"Sporns, O. (2016). Networks of the Brain, MIT Press."},{"key":"ref_12","first-page":"2212","article-title":"A note on the fourth version of geometric-arithmetic index","volume":"4","author":"Ghorbani","year":"2010","journal-title":"Optoelectron. Adv. Mater. Rapid Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.sjbs.2017.11.022","article-title":"Study of biological networks using graph theory","volume":"25","author":"Gao","year":"2018","journal-title":"Saudi J. Biol. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.30538\/psrp-odam2019.0016","article-title":"M-polynomial of some cactus chains and their topological indices","volume":"2","author":"Basavanagoud","year":"2019","journal-title":"Open J. Discret. Appl. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.30538\/psrp-odam2020.0027","article-title":"Wiener index of hexago- nal chains under some transformations","volume":"3","author":"Dobrynin","year":"2020","journal-title":"Open J. Discret. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"11528","DOI":"10.3934\/mbe.2023511","article-title":"Comparative study of five topological invariants of supramolecular chain of different complexes of N-salicylidene-L-valine","volume":"20","author":"Zhang","year":"2023","journal-title":"AIMS Math. Biosci. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"E6375","DOI":"10.1073\/pnas.1720589115","article-title":"Predicting perturbation patterns from the topology of biological networks","volume":"115","author":"Santolini","year":"2018","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"The statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TCBB.2007.70272","article-title":"Parallel clustering algorithm for large data sets with applications in bioinformatics","volume":"6","author":"Olman","year":"2009","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"ref_22","unstructured":"Murtagh, F. (2002). Handbook of Massive Data Sets, Springer."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1504\/IJDMB.2007.011611","article-title":"A parallel edge-betweenness clustering tool for protein-protein interaction networks","volume":"1","author":"Yang","year":"2007","journal-title":"Int. J. Data Min. Bioinform. (IJDMB)"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: Finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"Commun. ACM"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","article-title":"A scalable, parallel algorithm for maximal clique enumeration","volume":"69","author":"Schmidt","year":"2009","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.compbiolchem.2004.03.002","article-title":"Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques","volume":"28","author":"Brezelec","year":"2004","journal-title":"Comput. Biol. Chem."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.3844\/ajassp.2009.1368.1372","article-title":"The parallel maximal cliques algorithm for protein sequence clustering","volume":"6","author":"Jaber","year":"2009","journal-title":"Am. J. Appl. Sci."},{"key":"ref_29","unstructured":"Batagelj, V., and Zaversnik, M. (2003). An O(m) algorithm for cores decomposition of networks. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Bader, G.D., and Hogue, C.W.V. (2003). An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform., 4.","DOI":"10.1186\/1471-2105-4-2"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TPDS.2012.124","article-title":"Distributed k-Core decomposition","volume":"24","author":"Montresor","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Gehweiler, J., and Meyerhenke, H. (2010, January 19\u201323). A distributed diffusive heuristic for clustering a virtual P2P supercomputer. Proceedings of the 7th High-Performance Grid Computing Workshop (HGCW10) in Conjunction with 24th International Parallel and Distributed Processing Symposium (IPDPS10), Atlanta, GA, USA.","DOI":"10.1109\/IPDPSW.2010.5470922"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Riedy, J., Bader, D.A., and Meyerhenke, H. (2012, January 21\u201325). Scalable multi-threaded community detection in social networks. Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW), Shanghai, China.","DOI":"10.1109\/IPDPSW.2012.203"},{"key":"ref_34","unstructured":"Dongen, S.V. (2000). Graph Clustering by Flow Simulation. [Ph.D. Thesis, University of Utrecht]."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Brohee, S., and van Helden, J. (2006). Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinform., 7.","DOI":"10.1186\/1471-2105-7-488"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Vlasblom, J., and Wodak, S.J. (2009). Markov clustering versus affinity propagation for the partitioning of protein interaction graphs. BMC Bioinform., 10.","DOI":"10.1186\/1471-2105-10-99"},{"key":"ref_37","unstructured":"Bustamam, A., Sehgal, M.S., Hamilton, N., Wong, S., Ragan, M.A., and Burrage, K. (2009, January 9\u201311). An efficient parallel implementation of Markov clustering algorithm for large-scale protein-protein interaction networks that uses MPI. Proceedings of the fifth IMT-GT International Conference Mathematics, Statistics, and Their Applications (ICMSA), Sumatra Barat, Indonesia."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TCBB.2011.68","article-title":"Fast parallel Markov clustering in bioinformatics using massively parallel computing on GPU with CUDA and ELLPACK-R sparse format","volume":"9","author":"Bustamam","year":"2011","journal-title":"IEEE\/ACM Trans. Comp. Biol. Bioinform."},{"key":"ref_39","first-page":"57","article-title":"Laplacian of graphs and algebraic connectivity","volume":"25","author":"Fiedler","year":"1989","journal-title":"Comb. Graph Theory"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TPAMI.2010.88","article-title":"Parallel spectral clustering in distributed systems","volume":"33","author":"Chen","year":"2010","journal-title":"IEEE Trans. Pattern. Anal. Mach. Intell."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TFUZZ.2015.2460732","article-title":"Fuzzy clustering in a complex network based on content relevance and link structures","volume":"24","author":"Hu","year":"2015","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Hu, L., Yang, Y., Tang, Z., He, Y., and XLuo, X. (2023). FCAN-MOPSO: An Improved Fuzzy-based Graph Clustering Algorithm for Complex Networks with Multi-objective Particle Swarm Optimization. IEEE Trans. Fuzzy Syst.","DOI":"10.1109\/TFUZZ.2023.3259726"},{"key":"ref_43","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., and Alon, U. (2002). Mfinder Tool Guide, Department of Molecular Cell Biology and Computer Science and Applied Mathematics, Weizman Institute of Science. Technical Report."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","article-title":"Efficient sampling algorithm for estimating sub-graph concentrations and detecting network motifs","volume":"20","author":"Kashtan","year":"2004","journal-title":"Bioinformatics"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/TCBB.2006.51","article-title":"Efficient detection of network motifs","volume":"3","author":"Wernicke","year":"2006","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","article-title":"FANMOD: A tool for fast network motif detection","volume":"22","author":"Wernicke","year":"2006","journal-title":"Bioinformatics"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","article-title":"Network motifs in the transcriptional regulation network of Escherichia Coli","volume":"31","author":"Milo","year":"2002","journal-title":"Nat. Gen."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: Simple building blocks of complex networks","volume":"298","author":"Milo","year":"2004","journal-title":"Science"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1038\/35004572","article-title":"Simple rules yield complex food webs","volume":"404","author":"Williams","year":"2000","journal-title":"Nature"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Kashani, Z.R., Ahrabian, H., Elahi, E., Nowzari-Dalini, A., Ansari, E.S., Asadi, S., Mohammadi, S., Schreiber, F., and Masoudi-Nejad, A. (2009). Kavosh: A new algorithm for finding network motifs. BMC Bioinform., 10.","DOI":"10.1186\/1471-2105-10-318"},{"key":"ref_51","unstructured":"Grochow, J., and Kellis, M. (2007, January 21\u201325). Network motif discovery using subgraph enumeration and symmetry-breaking. Proceedings of the 11th Annual International Conference Research in Computational Molecular Biology (RECOMB\u201907), Oakland, CA, USA."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1038\/nature02555","article-title":"Evidence for dynamically organized modularity in the yeast protein-protein interaction network","volume":"430","author":"Han","year":"2004","journal-title":"Nature"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1093\/nar\/29.1.75","article-title":"Ypd(tm), pombepd(tm), and wormpd(tm): Model organism volumes of the bioknowledge(tm) library, an integrated resource for protein information","volume":"29","author":"Costanzo","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1266\/ggs.84.385","article-title":"MODA: An efficient algorithm for network motif discovery in biological networks","volume":"84","author":"Omidi","year":"2009","journal-title":"Genes Genet. Syst."},{"key":"ref_55","unstructured":"Wang, T., Touchman, J.W., Zhang, W., Suh, E.B., and Xue, G. (2005, January 19\u201321). A parallel algorithm for extracting transcription regulatory network motifs. Proceedings of the IEEE International Symposium on Bioinformatics and Bioengineering, Minneapolis, MN, USA."},{"key":"ref_56","unstructured":"Schatz, M., Cooper-Balis, E., and Bazinet, A. (2008). Parallel Network Motif Finding, University of Maryland Insitute for Advanced Computer Studies. Technical Report."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Ribeiro, P. (2009). Efficient and Scalable Algorithms for Network Motifs Discovery. [Ph.D. Thesis, Doctoral Programme in Computer Science, Faculty of Science of the University of Porto].","DOI":"10.1109\/e-Science.2009.20"},{"key":"ref_58","unstructured":"Ribeiro, P., Silva, F., and Lopes, L. (2010, January 20\u201323). A parallel algorithm for counting subgraphs in complex networks. Proceedings of the 3rd International Conference on Biomedical Engineering Systems and Technologies, Valencia, Spain."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.jpdc.2011.08.007","article-title":"Parallel discovery of network motifs","volume":"72","author":"Ribeiro","year":"2012","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"102734","DOI":"10.1016\/j.parco.2020.102734","article-title":"Parallelization of network motif discovery using star contraction","volume":"101","author":"Ruzgar","year":"2021","journal-title":"Parallel Comput."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1049\/iet-syb.2020.0004","article-title":"Review of tools and algorithms for network motif discovery in biological networks","volume":"14","author":"Patra","year":"2020","journal-title":"IET Syst. Biol."},{"key":"ref_62","unstructured":"Singh, R., Xu, J., and Berger, B. (2007). Research in Computational Molecular Biology, Proceedings of the 11th Annunal International Conference, RECOMB 2007, Oakland, CA, USA, 21\u201325 April 2007, Springer."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"3105","DOI":"10.1093\/bioinformatics\/bts592","article-title":"Global network alignment using multiscale spectral signatures","volume":"28","author":"Patro","year":"2012","journal-title":"Bioinformatics"},{"key":"ref_64","unstructured":"Igor, J., and Dennis, W. (2005). A Chapter in Knowledge Discovery in Proteomics, CRC Press."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Mol. Biol"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"11394","DOI":"10.1073\/pnas.1534710100","article-title":"Conserved pathways within bacteria and yeast as revealed by global protein network alignment","volume":"100","author":"Kelley","year":"2003","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1089\/cmb.2006.13.182","article-title":"Pairwise alignment of protein interaction networks","volume":"13","author":"Koyuturk","year":"2006","journal-title":"J. Comput. Biol."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"El-Kebir, M., Heringa, J., and Klau, G.W. (2011, January 2\u20134). Lagrangian relaxation applied to sparse global network alignment. Proceedings of the 6th IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB\u201911), Delft, The Netherlands.","DOI":"10.1007\/978-3-642-24855-9_20"},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Klau, G.W. (2009). A new graph-based method for pairwise global network alignment. BMC Bioinform., 10.","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","article-title":"Topological network alignment uncovers biological function and phylogeny","volume":"7","author":"Kuchaiev","year":"2010","journal-title":"J. R. Soc. Interface"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1093\/bioinformatics\/btt071","article-title":"SPINAL: Scalable protein interaction network alignment","volume":"29","author":"Aladag","year":"2013","journal-title":"Bioinformatics"},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Meinel, C., and Tison, S. (1999). STACS99, Proceeedings of the 16th Annual Conference Theoretical Aspects of Computer Science, Trier, Germany, 4\u20136 March 1999, Springer. Lecture Notes in Computer, Science.","DOI":"10.1007\/3-540-49116-3"},{"key":"ref_73","unstructured":"Hoepman, J.H. (2004). Simple distributed weighted matchings. arXiv."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Wyrzykowski, R., Karczewski, K., Dongarra, J., and Wasniewski, J. (2007, January 9\u201312). A parallel approximation algorithm for the weighted maximum matching problem. Proceedings of the Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Gdansk, Poland. Lecture Notes in Computer, Science.","DOI":"10.1007\/978-3-540-68111-3"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.parco.2012.09.001","article-title":"An auction-based weighted matching implementation on massively parallel architectures","volume":"38","author":"Sathe","year":"2012","journal-title":"Parallel Comput."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Saribatir, M.B., and Erciyes, K. (2022, January 15\u201316). A Parallel Network Alignment Algorithm for Biological Networks. Proceedings of the IEEE 3rd International Informatics and Software Engineering Conference (IISEC), Ankara, Turkey.","DOI":"10.1109\/IISEC56263.2022.9998245"},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Maskey, S., and Cho, Y.-R. (2019, January 18\u201321). Survey of biological network alignment: Cross-species analysis of conserved systems. Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine (BIBM), San Diego, CA, USA.","DOI":"10.1109\/BIBM47256.2019.8983132"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Erciyes, K. (2021). Algebraic Graph Algorithms, A Practical Approach Using Python, Springer.","DOI":"10.1007\/978-3-030-87886-3"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/10\/188\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:02:53Z","timestamp":1760130173000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/10\/188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":78,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,10]]}},"alternative-id":["computation11100188"],"URL":"https:\/\/doi.org\/10.3390\/computation11100188","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]}}}