Coupling graphs, efficient algorithms and B-Cell Epitope prediction

Coupling graphs are newly introduced in this paper to meet many application needs particularly in the field of bioinformatics. A coupling graph is a two-layer graph complex, in which each node from one layer of the graph complex has at least one connection with the nodes in the other layer, and vice...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHAO, Liang, HOI, Steven C. H., LI, Zhenhua, WONG, Limsoon, NGUYEN, Hung
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2014
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/4173
https://ink.library.smu.edu.sg/context/sis_research/article/5176/viewcontent/Coupling_Graphs_2014.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-5176
record_format dspace
spelling sg-smu-ink.sis_research-51762020-04-01T01:52:25Z Coupling graphs, efficient algorithms and B-Cell Epitope prediction ZHAO, Liang HOI, Steven C. H. LI, Zhenhua WONG, Limsoon NGUYEN, Hung Coupling graphs are newly introduced in this paper to meet many application needs particularly in the field of bioinformatics. A coupling graph is a two-layer graph complex, in which each node from one layer of the graph complex has at least one connection with the nodes in the other layer, and vice versa. The coupling graph model is sufficiently powerful to capture strong and inherent associations between subgraph pairs in complicated applications. The focus of this paper is on mining algorithms of frequent coupling subgraphs and bioinformatics application. Although existing frequent subgraph mining algorithms are competent to identify frequent subgraphs from a graph database, they perform poorly on frequent coupling subgraph mining because they generate many irrelevant subgraphs. We propose a novel graph transformation technique to transform a coupling graph into a generic graph. Based on the transformed coupling graphs, existing graph mining methods are then utilized to discover frequent coupling subgraphs. We prove that the transformation is precise and complete and that the restoration is reversible. Experiments carried out on a database containing 10,511 coupling graphs show that our proposed algorithm reduces the mining time very much in comparison with the existing subgraph mining algorithms. Moreover, we demonstrate the usefulness of frequent coupling subgraphs by applying our algorithm to make accurate predictions of epitopes in antibody-antigen binding. 2014-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4173 info:doi/10.1109/TCBB.2013.136 https://ink.library.smu.edu.sg/context/sis_research/article/5176/viewcontent/Coupling_Graphs_2014.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Coupling graph epitope prediction graph mining graph transformation Biomedical Engineering and Bioengineering Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Coupling graph
epitope prediction
graph mining
graph transformation
Biomedical Engineering and Bioengineering
Databases and Information Systems
spellingShingle Coupling graph
epitope prediction
graph mining
graph transformation
Biomedical Engineering and Bioengineering
Databases and Information Systems
ZHAO, Liang
HOI, Steven C. H.
LI, Zhenhua
WONG, Limsoon
NGUYEN, Hung
Coupling graphs, efficient algorithms and B-Cell Epitope prediction
description Coupling graphs are newly introduced in this paper to meet many application needs particularly in the field of bioinformatics. A coupling graph is a two-layer graph complex, in which each node from one layer of the graph complex has at least one connection with the nodes in the other layer, and vice versa. The coupling graph model is sufficiently powerful to capture strong and inherent associations between subgraph pairs in complicated applications. The focus of this paper is on mining algorithms of frequent coupling subgraphs and bioinformatics application. Although existing frequent subgraph mining algorithms are competent to identify frequent subgraphs from a graph database, they perform poorly on frequent coupling subgraph mining because they generate many irrelevant subgraphs. We propose a novel graph transformation technique to transform a coupling graph into a generic graph. Based on the transformed coupling graphs, existing graph mining methods are then utilized to discover frequent coupling subgraphs. We prove that the transformation is precise and complete and that the restoration is reversible. Experiments carried out on a database containing 10,511 coupling graphs show that our proposed algorithm reduces the mining time very much in comparison with the existing subgraph mining algorithms. Moreover, we demonstrate the usefulness of frequent coupling subgraphs by applying our algorithm to make accurate predictions of epitopes in antibody-antigen binding.
format text
author ZHAO, Liang
HOI, Steven C. H.
LI, Zhenhua
WONG, Limsoon
NGUYEN, Hung
author_facet ZHAO, Liang
HOI, Steven C. H.
LI, Zhenhua
WONG, Limsoon
NGUYEN, Hung
author_sort ZHAO, Liang
title Coupling graphs, efficient algorithms and B-Cell Epitope prediction
title_short Coupling graphs, efficient algorithms and B-Cell Epitope prediction
title_full Coupling graphs, efficient algorithms and B-Cell Epitope prediction
title_fullStr Coupling graphs, efficient algorithms and B-Cell Epitope prediction
title_full_unstemmed Coupling graphs, efficient algorithms and B-Cell Epitope prediction
title_sort coupling graphs, efficient algorithms and b-cell epitope prediction
publisher Institutional Knowledge at Singapore Management University
publishDate 2014
url https://ink.library.smu.edu.sg/sis_research/4173
https://ink.library.smu.edu.sg/context/sis_research/article/5176/viewcontent/Coupling_Graphs_2014.pdf
_version_ 1770574393256181760