Querying KEGG Pathways in Logic
Document Type
Article
Publication Date
2-24-2014
Abstract
Understanding the interaction patterns among biological entities in a pathway can potentially reveal the role of the entities in biological systems. Although considerable effort has been contributed to this direction, querying biological pathways remained relatively unexplored. Querying is principally different in which we retrieve pathways satisfying a given property in terms of its topology, or constituents. One such property is subnetwork matching using various constituent parameters. In this paper, we introduce a logic based framework for querying biological pathways using a novel and generic subgraph isomorphism computation technique. We develop a graphical interface called IsoKEGG to facilitate flexible querying of KEGG pathways based on isomorphic pathway topologies as well as matching any combination of node names, types, and edges. It allows editing KGML represented query pathways and returns all isomorphic patterns in KEGG pathways satisfying a given query condition for further analysis.
DOI
10.1504/IJDMB.2014.057772
Montclair State University Digital Commons Citation
Sultana, Kazi Zakia; Bhattacharjee, Anupam; and Jamil, Hasan, "Querying KEGG Pathways in Logic" (2014). Department of Computer Science Faculty Scholarship and Creative Works. 499.
https://digitalcommons.montclair.edu/compusci-facpubs/499