Using Neo4j for mining protein graphs: a case study

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10323526" target="_blank" >RIV/00216208:11320/16:10323526 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1109/DEXA.2015.59" target="_blank" >http://dx.doi.org/10.1109/DEXA.2015.59</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/DEXA.2015.59" target="_blank" >10.1109/DEXA.2015.59</a>

Result language

angličtina

Original language name

Using Neo4j for mining protein graphs: a case study

Original language description

Using graph databases becomes increasingly popular in domains where data can be modeled as a set of connected objects. Graph databases enable to query such data using graph-based queries in a relatively simple manner in comparison to the classical relational databases. In this paper, we show how one of the most popular graph databases, Neo4j, can be applied to the bioinformatics problem of protein-protein interface (PPI) identification. The goal of the PPI identification task is, given a protein structure, to identify amino acids which are responsible for binding of the structure to other proteins. Each protein structure consists of a set of amino acid molecules which can be conceived as a graph and multitude of methods for analysis of such protein graphs have been established. We introduce here a knowledge-based approach which can enhance the quality of these methods by utilizing existing protein structure knowledge stored in the Protein Data Bank (PDB). We show how to transform information about protein complexes from PDB into Neo4j where they can be stored as a set of independent protein graphs. The resulting graph database contains about 14 millions labeled nodes and 38 millions edges. In the PPI identification phase, this database is queried using exact subgraph matching and the results are aggregated to improve an existing PPI identification method. We show the pros and cons of using Neo4j for such endeavor with respect to the size of the database and complexity of the queries in comparison to using a relational database (Microsoft SQL Server). We conclude that using Neo4j is a viable option for specific, rather small, subgraph query types. However, we have encountered performance limitations, especially for larger query graphs in terms of number of edges.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GP14-29032P" target="_blank" >GP14-29032P: Efficient chemical space exploration using multi-objective optimization</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

2015 26th International Workshop on Database and Expert Systems Applications (DEXA)

ISBN

978-1-4673-7581-8

ISSN

1529-4188

e-ISSN

—

Number of pages

5

Pages from-to

230-234

Publisher name

IEEE

Place of publication

Los Alamitos, CA

Event location

Valencia

Event date

Sep 1, 2015

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—