Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 17, 2026.

RegNetwork: an integrated database of transcriptional and post-transcriptional regulatory networks in human and mouse

Zhi-Ping Liu, Canglin Wu, Hongyu Miao and 1 more

Database · 2015

doi:10.1093/database/bav095

Abstract

Transcriptional and post-transcriptional regulation of gene expression is of fundamental importance to numerous biological processes. Nowadays, an increasing amount of gene regulatory relationships have been documented in various databases and literature. However, to more efficiently exploit such knowledge for biomedical research and applications, it is necessary to construct a genome-wide regulatory network database to integrate the information on gene regulatory relationships that are widely scattered in many different places. Therefore, in this work, we build a knowledge-based database, named 'RegNetwork', of gene regulatory networks for human and mouse by collecting and integrating the documented regulatory interactions among transcription factors (TFs), microRNAs (miRNAs) and target genes from 25 selected databases. Moreover, we also inferred and incorporated potential regulatory relationships based on transcription factor binding site (TFBS) motifs into RegNetwork. As a result, RegNetwork contains a comprehensive set of experimentally observed or predicted transcriptional and post-transcriptional regulatory relationships, and the database framework is flexibly designed for potential extensions to include gene regulatory networks for other organisms in the future. Based on RegNetwork, we characterized the statistical and topological properties of genome-wide regulatory networks for human and mouse, we also extracted and interpreted simple yet important network motifs that involve the interplays between TF-miRNA and their targets. In summary, RegNetwork provides an integrated resource on the prior information for gene regulatory relationships, and it enables us to further investigate context-specific transcriptional and post-transcriptional regulatory interactions based on domain-specific experimental data. Database URL: http://www.regnetworkweb.org.

Full text

From PubMed Central, U.S. National Library of Medicine, as current on Oct 17, 2026. Paragraph numbers are ours, so an answer can point at one.

Introduction

Gene regulatory events play crucial roles in a variety of physiological and developmental processes in a cell, in which macromolecules such as genes, RNAs and proteins are coordinated to orchestrate operative responses under different conditions. Therefore, substantial efforts have been made to reveal gene regulatory network structures from transcriptomic profiling datasets generated by, e.g. microarray, ChIP-Seq and RNA-Seq. Although a number of data-driven reverse engineering techniques were previously proposed to identify regulatory relationships between regulators and their targets [e.g. TFs and downstream genes], the low accuracy of these existing methods due to the curse of dimensionality significantly limits their applications in practice. However, several recent studies suggested a promising alternative for identifying regulatory network structures by combining the high-throughput transcriptomic profiling data with the prior knowledge on known or predicted regulatory relationships available in various databases and literature. For instance, the framework in can significantly improve the accuracy of regulatory relationship identification by appropriately incorporating prior knowledge into the transcriptomic profiling data. Also, the results from several other independent studies suggest that the incorporation of prior knowledge can help to better identify the context-specific regulatory interactions corresponding to certain phenotypes. It is thus of paramount interest to collect, organize and share such prior information with the related communities for future biomedical research and practice.

Prior knowledge on gene regulatory relationships from multiple sources (e.g. genomic context, conserved gene co-expression, knockout or high-throughput experiment) spreads out in various databases and literature. It is desirable to develop a unified database and provide users with the necessary tools for information access or retrieval. However, only limited efforts such as RegulonDB for Escherichia coli have been previously made towards this goal, and the works on the genome-wide regulatory relationships for other species are still lacking so far. Considering the overwhelming importance of human and mouse in biomedical studies, we build a database of genome-wide regulatory relationships for the two species. It should be noted that, besides the experimentally observed or discovered regulatory relationships curated in public databases such as TRED and KEGG, the TF binding site (TFBS) information for TF–gene regulatory interaction potentials can also be used to predict new transcriptional regulatory relationships between TFs and genes by matching the binding motifs in DNA sequences. Thus, such predictions based on TFBS are also integrated into our database to provide a more comprehensive landscape of gene regulations. Moreover, to include post- transcriptional regulatory relationships in the database, we also consider miRNAs, which are small non-coding RNA molecules (∼22 nucleotides) found in various organisms and ubiquitously perform crucial roles in post- transcriptional regulation of gene expression by binding to the 3′ untranslated region of mRNA.

Although there exist many computational methods for deciphering the transcriptional regulatory interactions between TFs and genes, the integrative analysis considering both TF and miRNA as regulators is still very limited due to the lack of a ready-to-use regulatory network database. In recognition of such an emerging need, here we build a comprehensive database for genome-wide regulatory networks at both transcriptional and post- transcriptional levels for human and mouse by integrating the documented regulatory relationships from 25 databases. RegNetwork can be freely accessed at http://www.regnetworkweb.org.

Data sources

Both transcriptional and post-transcriptional regulatory relationships are important, we thus consider both TFs and miRNAs as regulators. Figure 1 shows a basic regulatory circuit involving TF, miRNA and target gene, as well as the essential steps of transcriptional and post- transcriptional regulation of gene expression. Note that the miRNA component is usually missing in most of the previous studies on reverse engineering of gene regulatory networks. However, given its important role in the post-transcriptional regulatory process, we believe that it is necessary to include miRNAs in RegNetwork.

As shown in Figure 1, five types of regulatory relationships among TFs, miRNAs and target genes are considered in the regulatory network. More specifically, for transcriptional regulatory relationships, ‘TF-TF’ (①) and ‘TF-gene’ (②) interactions are considered; for post-transcriptional regulatory relationships, the curated and predicted ‘miRNA-gene’ interactions (⑤) are considered; for interplays between regulators, ‘TF-miRNA’ (③) and ‘miRNA-TF’ (④) are included. A number of databases contain regulatory information for human and mouse, from which we collect the relevant information and data (e.g. TFs, miRNAs, TFBS motifs, genes and their annotations). Table 1 lists the databases we used to build the RegNetwork.

Regulatory relationship curation and prediction

Figure 2 illustrates how the databases listed in Table 1 are used to construct the RegNetwork, and the same procedure in forms of tested computer code is performed for human and mouse, respectively.

More specifically, for transcriptional regulatory relationships, we first compile a list of TFs for human and mouse, respectively, from FANTOM, UniProt, TRANSFAC and JASPAR. Then, the ‘TF-gene’ interactions documented in TRED and KEGG are directly deposited in RegNetwork. Moreover, we predict the potential ‘TF-gene’ interactions from the documented TF binding site (TFBS) motifs in TRANSFAC and JASPAR. Since TFs regulate the target genes by binding to these experimentally identified TFBSs, we pair the TFs and genes by searching the promoter regions from the 5 kb upstream to 1 kb downstream of the transcription start site (TSS) for RefSeq genes. Figure 3 illustrates the basic idea of how to pair a TF with the potential target genes via TFBS. As an example, TF ‘NR2F1’ has a known TFBS ‘MA0017’, which is represented by a position weighted matrix, and the sequence logo at the top-left corner in Figure 3 shows its nucleotides composition. Screening the promoter regions in the whole genome of human and mouse for this TFBS, the genes containing ‘MA0017’ in their promoter regions are thus identified as the potential targets of ‘NR2F1’. In general, we retrieve the information of TFBS conservation tracks from the UCSC Genome Browser and Ensembl database. Specifically, UCSC’s tfbsConsSites table contains the location and score of TFBS conserved in the human/mouse sequence alignment results. A binding site is considered to be conserved across the alignment results if its score is no less than the threshold score. The score and the threshold are computed with the TRANSFAC matrices by the TFLOC program. Since the UCSC only implements the TFBS conservation tracks in human genome, we map the TFBS conservation information to mouse genome by employing the LiftOver tool of UCSC. Similarly, Ensemble’s MotifFeatures.gff table contains the alignment information for the TFBS element matrix documented in JASPAR [by MOODS software] for human and mouse. The chromosomal coordinates of TFBSs can be used to identify their corresponding genes and the potential regulatory relationships between TFs and genes can then be established. To include as many TFs and their interaction targets as possible in our database, we also consider and include protein–protein interactions (PPIs) in RegNetwork. We retrieve the PPI pairs that contain at least one TF from HPRD, BioGrid, IntAct, KEGG and STRING. The functional linkages between TF and its interacting partners indicate putative gene regulations. Obviously, when a TF regulates the expression of its own gene, the ‘TF-TF’ self-regulations are also identified. To be consistent in this process, TFs and genes are represented using their corresponding NCBI Entrez IDs and official symbols.

For post-transcriptional regulations, the experimentally validated ‘miRNA–gene’ pairs in human and mouse from miRTarBase, TarBase and miRecords are directly deposited in RegNetwork. Then, the predicted ‘miRNA–gene’ interactions by one of the five representative algorithms, i.e. miRanda, TargetScan, PicTar, MicroCosm and micorT, are included. Similarly, the documented ‘miRNA–TF’ genes regulatory relationships are directly deposited into RegNetwork.

The documented ‘TF–miRNA’ regulatory relationships in TransmiR are also directly imported into RegNetwork. Then, the potential interactions between TFs and miRNA-encoding genes are predicted based on TFBS information using the similar method for potential ‘TF–gene’ interactions as described above. In such a way, the documented and putative regulatory pairs are both included in RegNetwork. For certain pairs of genes, the regulator (or target) gene in one database may be labeled as target (or regulator) gene in another database. We merged such results and thus the interactions between these pairs of genes can be bidirectional. That is, we used an ‘inclusive’ principle to deal with the inconsistency between the databases. At the same time, we also provide a link to the original databases for users to check the detailed information regarding the inconsistency and decide which result they will believe and use for a particular case. Finally, we added the degree of confidence for each of the regulatory interactions by using a three-level labeling approach (i.e. a ‘high’, ‘medium’ or ‘low’ confidence). More specifically, the experiment-validated regulations are tagged with the label ‘high confidence’, the predictions made by only one algorithm/method are tagged with ‘low confidence’, and the rest are tagged with ‘medium confidence’.

Database implementation and web user interface design

We have developed a web tool of RegNetwork for users to query and download the regulatory relationships and networks. RegNetwork is implemented in Java, JavaScript and Python together with the PostgreSQL database. All raw data ETL (Extract, Transfer and Load) are carried out with Python scripts on the back end. The frontend interface is developed using JSP and JavaScript.

Figure 4 shows the web user interface of RegNetwork. The regulatory relationship can be searched by various types of components (i.e. by TF, miRNA or gene in the regulatory networks), by databases and/or by species (human or mouse). The interface also provides users the option to query transcriptional only, post-transcriptional only or both relationships to further refine the search. It also allows users, while querying RegNetwork, to specify and constraint the original databases where the regulatory relationships are derived from. The query results can be exported as a CSV file. The users can employ some tools such as Sig2BioPax to convert the regulations into the BioPAX Level 3 format. Also, the full datasets are made available for users to download for further analyses.

Regulatory networks in human and mouse

By integrating the experimental, inferred or predicted regulatory interactions among TFs, miRNAs and genes from a variety of sources, we developed a database named RegNetwork as a comprehensive repository for genome-wide regulatory networks in human and mouse. RegNetwork contains both transcriptional and post- transcriptional regulatory relationships, and the interplays between TF/miRNA and their targets can then be easily retrieved from the database. In addition, the data source information for the regulatory relationships can also be retrieved from RegNetwork. As of June 2015, the basic statistics of the regulatory networks in RegNetwork are calculated and listed in Table 2. Specifically, the human regulatory network contains 23 079 nodes and 369 277 edges, consisting of 1456 TFs, 1904 miRNAs and 19 719 target genes; and the mouse regulatory network contains 20 738 nodes and 323 636 edges, consisting of 1328 TFs, 1290 miRNAs and 18 120 target genes. For details of how to use expression data to identify subnetworks from the background network under specific conditions, the interested reader is referred to Liu et al..

Network analysis

Real biological networks such as gene regulatory networks and protein–protein interaction networks are different from random networks in terms of certain network properties like characteristic path length and node degree distribution. Therefore, network feature analysis allows us to assess whether a network is random or not. Some network feature indices for the established regulatory network for human and mouse from RegNetwork are summarized in Table 3. Particularly, the clustering coefficients of the established regulatory networks in human and mouse are 0.118 and 0.101, respectively, which are much higher than that of random networks of a comparable size (∼). Moreover, the characteristic path lengths of the regulatory networks in human and mouse are 3.200 and 3.229, respectively, which are comparatively small, and thus suggest a quick propagation of regulatory information in a non-random manner. All other network topological properties also suggest that the established regulatory networks for human and mouse are different from random networks.

Second, the node degrees of the established networks are calculated and found to satisfy the power law distributions as shown in Figure 5. Fitting the power law model, where denotes the number of nodes and denotes the node degree, we obtain for the human regulatory network and for the mouse regulatory network. Since, our background networks are scale-free. The network parameters provide evidence that our integrated regulatory networks are different from randomly generated networks. Notice that we employ the definition of random network in. A formal and rigorous comparison between the large human/mouse networks derived from our RegNetwork and the corresponding random networks require the use of computing-intensive Monte Carlo approaches, which is beyond the score of this paper.

Interplays among TF, miRNA and gene

Different from the existing regulatory relationship databases such as TRED, RegNetwork contains both the transcriptional and post-transcriptional regulatory interactions, which allows us to investigate more complex interplays between regulators (i.e. TF and miRNA) and their target genes. Figure 6 illustrates the collected interactions from a KEGG gene set involved in the T cell signaling pathway in human, where the post-transcriptional regulatory relationships are drawn as blue lines. Since network motif is an important local property and functional block of complex network, here we identify the three-node network motifs (‘TF-miRNA-gene’) in the established regulatory networks. Figure 6 clearly suggests the combinatorial control of gene expressions mediated by TFs and miRNAs simultaneously. For instance, visually we can identify several network motifs in Figure 6, such as ‘FOS’-‘hsa-miR-569’-‘MAPK12’ and ‘JUN’-‘hsa-let-7a’-‘PAK1’, which are believed to be the major network building components and functional blocks in regulatory networks. By this simple example, we show that RegNetwork is a useful tool for querying the knowledge-based combinatorial regulatory relationships in both transcription and post-transcription. Actually, using the network motif detection algorithm, FANDOM, we can identify all the three-node motifs ‘TF-miRNA-gene’ in the human and mouse regulatory networks, respectively. Table 4 lists their occurrence frequencies and the statistical significance in the form of Z-scores. Ten types of ‘TF-miRNA-gene’ motifs are identified in the two networks. For each type of the motifs, the Z-score is calculated as the difference of its actual occurrence frequency and the average of its occurrence frequencies in 100 random networks of the same node-size, normalized by the standard deviation of these random occurrence frequencies, and the motifs with a Z-score higher than 2 are regarded as significantly enriched according to FANDOM. As shown in Table 4, ‘M1’, ‘M2’, ‘M3’, ‘M5’ and ‘M7’ are enriched in both human and mouse regulatory networks; ‘M10’ are enriched in one of them, and motifs ‘M4’, ‘M6’, ‘M8’ and ‘M9’ are not enriched in either of them. The enrichment of different types of motifs suggests a major topological and statistical change in the local network structures, which is of significant scientific interest and a promising research approach for understanding context-specific (e.g. certain disease) regulatory machineries.

Conclusion

In this article, we developed a database, RegNetwork, of the knowledge-based genome-wide regulatory networks in human and mouse by integrating various data sources. A comprehensive set of interplays among TFs, miRNAs and target genes were collected and reorganized for public access. The established regulatory networks from RegNetwork provide genome-wide regulatory interactions, which lay an initial foundation and establish a prior background network to identify or verify molecular and functional regulations in pathways or subnetworks corresponding to different phenotypes. Also, combined with high-throughput expression data under specific physiological and developmental conditions (e.g. viral infection), one can identify differential subnetworks and pathways from the background networks in RegNetwork, which will lead to novel and interesting insights into regulatory mechanisms in context-specific processes.

At the time when the current version of RegNetwork was developed, the ENCODE project published thousands of regulatory interactions in human inferred from high-throughput datasets, which contains 162 100 regulatory relationships among 119 TFs, 736 miRNAs and 15 131 genes. Most of the TFs, miRNAs and genes in ENCODE (96.5% of the regulators and 89.9% of the targets) are already included in our database. We will continue to track and regularly integrate the ENCODE regulatory relationships into our database. We also recognize the usefulness of text mining tools to identify and curate the regulatory relationships from literature, which is another direction to extend the RegNetwork. We also plan to extend the RegNetwork to include additional information such as the experimental conditions and original references for each of the regulatory relationships that are derived from. We will also extend the RegNetwork to include other organisms, such as Rattus norvegicus (rat), Drosophila melanogaster (fruit fly), Caenorhabditis elegans (worm), Escherichia coli (E. coli) and Saccharomyces cerevisiae (yeast).

Funding

National Natural Science Foundation of China (NSFC) (Grant Nos. 61572287 and 61533011 to Z.P.L.); the Shandong Provincial Natural Science Foundation of China (Grant No. ZR2015FQ001 to Z.P.L.); the Fundamental Research Funds of Shandong University (Grant No. 2014TB006 to Z.P.L); the Scientific Research Foundation for the Returned Overseas Chinese Scholars, Ministry of Education of China (to Z.P.L.); University of Rochester Center for Biodefense Immune Modeling Grant (NIH/NIAID) (HHSN272201000055C to H.W.); University of Rochester Center for AIDS Research Grant (NIH/NIAID) (P30AI078498 to H.W); NIH Grant (R01GM100788 to H.M.). Funding for open access charge: Dr. Hulin Wu's start-up fund.

Conflict of interest. None declared.

References 55

  1. 1.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  2. 2.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  3. 3.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  4. 4.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  5. 5.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  6. 6.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  7. 7.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  8. 8.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  9. 9.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  17. 17.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  19. 19.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  20. 20.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  21. 21.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  22. 22.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  24. 24.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  27. 27.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  29. 29.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  30. 30.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  33. 33.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  34. 34.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  35. 35.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  36. 36.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  37. 37.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  38. 38.
  39. 39.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

  40. 40.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

All 55 references

Cited by papers we hold 8

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.