Querying KEGG pathways in logic

Kazi Zakia Sultana, Anupam Bhattacharjee, Hasan Jamil

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1-21
Number of pages21
JournalInternational Journal of Data Mining and Bioinformatics
Volume9
Issue number1
DOIs
StatePublished - 24 Feb 2014

Fingerprint

Names
Topology
interaction pattern
Biological systems
Direction compound

Keywords

  • Graph matching
  • Logic based system
  • Lookup queries
  • Pathways
  • Query language
  • Subgraph isomorphism
  • Visual interface

Cite this

Sultana, Kazi Zakia ; Bhattacharjee, Anupam ; Jamil, Hasan. / Querying KEGG pathways in logic. In: International Journal of Data Mining and Bioinformatics. 2014 ; Vol. 9, No. 1. pp. 1-21.
@article{f6a46d8a9be24929b82fb4bba483829f,
title = "Querying KEGG pathways in logic",
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.",
keywords = "Graph matching, Logic based system, Lookup queries, Pathways, Query language, Subgraph isomorphism, Visual interface",
author = "Sultana, {Kazi Zakia} and Anupam Bhattacharjee and Hasan Jamil",
year = "2014",
month = "2",
day = "24",
doi = "10.1504/IJDMB.2014.057772",
language = "English",
volume = "9",
pages = "1--21",
journal = "International Journal of Data Mining and Bioinformatics",
issn = "1748-5673",
publisher = "Inderscience Enterprises Ltd.",
number = "1",

}

Querying KEGG pathways in logic. / Sultana, Kazi Zakia; Bhattacharjee, Anupam; Jamil, Hasan.

In: International Journal of Data Mining and Bioinformatics, Vol. 9, No. 1, 24.02.2014, p. 1-21.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Querying KEGG pathways in logic

AU - Sultana, Kazi Zakia

AU - Bhattacharjee, Anupam

AU - Jamil, Hasan

PY - 2014/2/24

Y1 - 2014/2/24

N2 - 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.

AB - 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.

KW - Graph matching

KW - Logic based system

KW - Lookup queries

KW - Pathways

KW - Query language

KW - Subgraph isomorphism

KW - Visual interface

UR - http://www.scopus.com/inward/record.url?scp=84894141511&partnerID=8YFLogxK

U2 - 10.1504/IJDMB.2014.057772

DO - 10.1504/IJDMB.2014.057772

M3 - Article

C2 - 24783405

AN - SCOPUS:84894141511

VL - 9

SP - 1

EP - 21

JO - International Journal of Data Mining and Bioinformatics

JF - International Journal of Data Mining and Bioinformatics

SN - 1748-5673

IS - 1

ER -