Algorithms for effective querying of compound graph-based pathway databases.

ABSTRACT:

Background

Graph-based pathway ontologies and databases are widely used to represent data about cellular processes. This representation makes it possible to programmatically integrate cellular networks and to investigate them using the well-understood concepts of graph theory in order to predict their structural and dynamic properties. An extension of this graph representation, namely hierarchically structured or compound graphs, in which a member of a biological network may recursively contain a sub-network of a somehow logically similar group of biological objects, provides many additional benefits for analysis of biological pathways, including reduction of complexity by decomposition into distinct components or modules. In this regard, it is essential to effectively query such i

SUBMITTER: Dogrusoz U 

PROVIDER: S-EPMC2784781 | biostudies-literature | 2009 Nov

REPOSITORIES: biostudies-literature