| Literature DB >> 29949872 |
Mihnea Dragomir1,2,3, Ana Carolina P Mafra4,5,6, Sandra M G Dias7,8, Catalin Vasilescu9, George A Calin10,11.
Abstract
Human cancers are characterized by deregulated expression of multiple microRNAs (miRNAs), involved in essential pathways that confer the malignant cells their tumorigenic potential. Each miRNA can regulate hundreds of messenger RNAs (mRNAs), while various miRNAs can control the same mRNA. Additionally, many miRNAs regulate and are regulated by other species of non-coding RNAs, such as circular RNAs (circRNAs) and long non-coding RNAs (lncRNAs). For this reason, it is extremely difficult to predict, study, and analyze the precise role of a single miRNA involved in human cancer, considering the complexity of its connections. Focusing on a single miRNA molecule represents a limited approach. Additional information could come from network analysis, which has become a common tool in the biological field to better understand molecular interactions. In this review, we focus on the main types of networks (monopartite, association networks and bipartite) used for analyzing biological data related to miRNA function. We briefly present the important steps to take when generating networks, illustrating the theory with published examples and with future perspectives of how this approach can help to better select miRNAs that can be therapeutically targeted in cancer.Entities:
Keywords: gene regulatory networks; microRNAs; molecular targeted therapy; neoplasms
Mesh:
Substances:
Year: 2018 PMID: 29949872 PMCID: PMC6073868 DOI: 10.3390/ijms19071871
Source DB: PubMed Journal: Int J Mol Sci ISSN: 1422-0067 Impact factor: 5.923
Definitions of network components and types of networks.
| Basic Nomenclature | Definitions |
|---|---|
| Nodes | Elements of a network. |
| Edges | Interactions/connections between elements of a network. |
| Hubs | Nodes with a high degree of interactions. |
| Association index | Method used for the quantification of similarity between nodes of the same species. The most common used association indices are: Jaccard, Simpson, Geometric and Cosin. |
| Monopartite network | Graph that contains only one species of nodes, such as a miRNA network. |
| Bipartite network | Graph that contains two species, with edges representing their interaction pattern, such as miRNA-mRNA networks. |
| Multipartite network | Graph that contains more than two species of nodes. |
| Association networks | Networks in which two nodes of the same type are connected only if their similarity calculated using an |
| Scale free network | A network that follows a power-law distribution, with some nodes that have a higher number of connections ( |
| Random network | A network with (N) labeled nodes that are connected with randomly distributed links (edges). |
| Undirected network | A graph in which the edges between nodes have no orientation. |
| Directed network | A graph in which edges between nodes have orientation. An edge is depicted as an arrow, is directed from node a to node b and is not equivalent to an edge from node b to node a. |
Figure 1Building miRNA networks. The first questions that need to be answered before building a miRNA network are—what are the nodes? And what does an edge between two nodes mean? The different answers to these questions lead to the multiple types of miRNA networks that can be built. The network can be composed only of miRNA nodes. This type of networks containing only a single species of nodes are termed monopartite networks (a). The entire construct is based only on the expression level of miRNAs. The most common method employed to build monopartite graphs is the correlation coefficient. A correlation matrix is built using the expression level of several miRNAs in multiple patients of the same cohort. The entire method depends on choosing a correlation threshold. All the miRNAs from the matrix that have a higher correlation value than the threshold will be joined by an edge in the network construction. Therefore, in this case, an edge means a high correlation level between two miRNAs. A second option is to build association networks (b), which are composed of two types of nodes, usually miRNAs (differentially expressed) and their common mRNA targets based on available predicted/validated miRNA-mRNA interaction data. The next step in building association networks is the use of an association index (Jaccard, Simpson, Geometric and Cosine) that calculates the amount of shared targets between two miRNAs. Again, a threshold must be selected to define which miRNA nodes are interconnected and the final network is composed only of miRNA nodes and an edge is a measure of shared targets between two miRNAs. Finally, a last type of miRNA networks commonly found in literature is the bipartite network (c). This network contains two species of nodes: miRNAs and most commonly mRNAs. (c.1) One possible way to generate this type of network is by experimentally determining the expression of miRNAs and mRNAs and determine the anti-correlation between them. If two elements of different species anti-correlate/correlate above a given threshold, an edge can be drawn between these elements. (c.2) A second way to generate bipartite networks is by imputing the differentially expressed miRNAs in computer software (most commonly IPA) which generates, based on available data from literature, an miRNA—mRNA network.
Useful software and webtools to generate monopartite, association and bipartite networks.
| Network Type | Method | Examples of Software/Webtools | Reference |
|---|---|---|---|
| Monopartite network | Correlation coefficient | Any statistics analysis software (GraphPad Prism, IBM SPSS, R) | [ |
| Hierarchical clustering | IBM SPSS, R | [ | |
| Bayesian inference | Banjo (Bayesian network inference with Java objects) | [ | |
| Association networks | Association indexes | GAIN | [ |
| Bipartite networks | Experimental approach (correlation coefficient) | Any statistics analysis software (GraphPad Prism, IBM SPSS, R) | [ |
| Automatic literature search | IPA Qiagen | [ |
* Reference [50] presents how to use the IBM SPSS software to build an miRNA hierarchical cluster network, and references [51,52] describe theoretically how hierarchical clustering can be used to generate networks, without referring to specific software.
Figure 2Networks can be characterized as random or scale-free. Networks can be classified as random or scale-free, depending on how the edges are shared among the nodes. (a) In random networks, (N) labeled nodes are connected with randomly distributed links (edges). (b) In scale-free networks, on the other hand, nodes have a different amount of edges and are not distributed randomly. In a scale-free miRNA network some miRNAs (in red) have more connections than others (in blue). Highly connected nodes, in this case represented by miRNAs in red, are termed hubs.