CNetQ: Network querying tool based on conditional random fields

  • Last updated: June 22, 2016


A large amount of biomolecular network data for multiple species have been generated by high-throughput experimental techniques, including undirected and directed networks such as protein-protein interaction networks, gene regulatory networks and metabolic networks. There are many conserved functionally similar modules and pathways among multiple biomolecular networks in different species, therefore, it is important to analyze the similarity between the biomolecular networks. Network querying approaches can efficiently discover the similar subnetworks among different species. However, many existing methods only partially solve this problem. A novel approach for network querying problem based on conditional random fields (CRF) model is proposed, which can handle both undirected and directed networks, acyclic and cyclic networks, and any number of insertions/deletions. The CRF method is fast and can query pathways in a large network in seconds using a PC.



R package#

The network querying method has been implemented as function net_query in R package Corbi, which can be found at:

Web service#

The online version of CNetQ is available at

Matlab code and data#

The Matlab code and data used in the paper published in Bioinformatics (2011): Note: The Matlab code is provided here only for record and test purposes, and not recommended for productive use since the code is not fully tuned and optimized. The users are suggested to use the R package provided above since it is more efficient in terms of both running time and memory usage.
Category: Supplementary Software

Add new attachment

Only authorized users are allowed to upload new attachments.

List of attachments

Kind Attachment Name Size Version Date Modified Author Change note
code.7z 77.8 kB 3 30-Sep-2011 17:40 LingyunWu Modification to use UGM instead of CRFall
data.7z 239.3 kB 2 27-Aug-2011 14:27 LingyunWu
« This page (revision-16) was last changed on 22-Jun-2016 23:11 by LingyunWu