Querying KEGG pathways in logic

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.

[1]  Jignesh M. Patel,et al.  SAGA: a subgraph matching tool for biological graphs , 2007, Bioinform..

[2]  Hasan M. Jamil A Novel Knowledge Representation Framework for Computing Sub-Graph Isomorphic Queries in Interaction Network Databases , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[3]  Yoshihiro Yamanishi,et al.  KEGG for linking genomes to life and the environment , 2007, Nucleic Acids Res..

[4]  D. Warren,et al.  Xsb -a System for Eeciently Computing Well Founded Semantics , 1997 .

[5]  Gultekin Özsoyoglu,et al.  PathCase: pathways database system , 2008, Bioinform..

[6]  Hubert Hackl,et al.  PathwayExplorer: web service for visualizing high-throughput expression data on biological pathways , 2005, Nucleic Acids Res..

[7]  Miguel Calejo InterProlog: Towards a Declarative Embedding of Logic Programming in Java , 2004, JELIA.

[8]  Shazzad Hosain,et al.  On-the-Fly Integration and Ad Hoc Querying of Life Sciences Databases Using LifeDB , 2009, DEXA.

[9]  Dennis Shasha,et al.  GraphFind: enhancing graph searching by low support data mining techniques , 2008, BMC Bioinformatics.

[10]  中尾 光輝,et al.  KEGG(Kyoto Encyclopedia of Genes and Genomes)〔和文〕 (特集 ゲノム医学の現在と未来--基礎と臨床) -- (データベース) , 2000 .

[11]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[12]  Juliana Freire,et al.  XSB: A System for Effciently Computing WFS , 1997, LPNMR.

[13]  Roded Sharan,et al.  Torque: topology-free querying of protein interaction networks , 2009, Nucleic Acids Res..

[14]  Roded Sharan,et al.  QNet: A Tool for Querying Protein Interaction Networks , 2007, RECOMB.

[15]  Dennis Shasha,et al.  GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.

[16]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[17]  Yves Deville,et al.  The aMAZE LightBench: a web interface to a relational database of cellular processes , 2004, Nucleic Acids Res..

[18]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[19]  Padhraic Smyth,et al.  Analysis and Visualization of Network Data using JUNG , 2005 .