SEQUOIA: significance enhanced network querying through context-sensitive random walk and minimization of network conductance. Academic Article uri icon


  • BACKGROUND: Network querying algorithms provide computational means to identify conserved network modules in large-scale biological networks that are similar to known functional modules, such as pathways or molecular complexes. Two main challenges for network querying algorithms are the high computational complexity of detecting potential isomorphism between the query and the target graphs and ensuring the biological significance of the query results. RESULTS: In this paper, we propose SEQUOIA, a novel network querying algorithm that effectively addresses these issues by utilizing a context-sensitive random walk (CSRW) model for network comparison and minimizing the network conductance of potential matches in the target network. The CSRW model, inspired by the pair hidden Markov model (pair-HMM) that has been widely used for sequence comparison and alignment, can accurately assess the node-to-node correspondence between different graphs by accounting for node insertions and deletions. The proposed algorithm identifies high-scoring network regions based on the CSRW scores, which are subsequently extended by maximally reducing the network conductance of the identified subnetworks. CONCLUSIONS: Performance assessment based on real PPI networks and known molecular complexes show that SEQUOIA outperforms existing methods and clearly enhances the biological significance of the query results. The source code and datasets can be downloaded from .

published proceedings

  • BMC Syst Biol

altmetric score

  • 0.5

author list (cited authors)

  • Jeong, H., & Yoon, B.

citation count

  • 6

complete list of authors

  • Jeong, Hyundoo||Yoon, Byung-Jun

publication date

  • January 2017