Graph-Theoretical Analysis of Biological Networks: A Survey

Abstract

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.

Keywords

• biological network
• graph analysis
• clustering
• network motif
• network alignment