Querying KEGG pathways in logic

Authors:
Kazi Zakia Sultana;Anupam Bhattacharjee;Hasan Jamil
Affiliations:
Department of Computer Science, Wayne State University, USA;Department of Computer Science, Wayne State University, USA;Department of Computer Science, Wayne State University, USA
Venue:
International Journal of Data Mining and Bioinformatics
Year:
2014

Citing 9
Cited 0

XSB as an efficient deductive database engine

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
XSB: A System for Effciently Computing WFS

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Performance Evaluation of the VF Graph Matching Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
SAGA: a subgraph matching tool for biological graphs

Bioinformatics
PathCase

Bioinformatics
On-the-Fly Integration and Ad Hoc Querying of Life Sciences Databases Using LifeDB

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
A Novel Knowledge Representation Framework for Computing Sub-Graph Isomorphic Queries in Interaction Network Databases

ICTAI '09 Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence
QNet: a tool for querying protein interaction networks

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology

Quantified Score

Hi-index	0.00

Visualization

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.