Identifying pathway proteins in networks using convergence

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

One of the key goals of systems biology concerns the analysis of experimental biological data available to the scientific public. New technologies are rapidly developed to observe and report whole-scale biological phenomena; however, few methods exist with the ability to produce specific, testable hypotheses from this noisy 'big' data. In this work, we propose an approach that combines the power of data-driven network theory along with knowledge-based ontology to tackle this problem. Network models are especially powerful due to their ability to display elements of interest and their relationships as internetwork structures. Additionally, ontological data actually supplements the confidence of relationships within the model without clouding critical structure identification. As such, we postulate that given a (gene/protein) marker set of interest, we can systematically identify the core of their interactions (if they are indeed working together toward a biological function), via elimination of original markers and addition of additional necessary markers. This concept, which we refer to as "convergence," harnesses the idea of "guilt-by-association" and recursion to identify whether a core of relationships exists between markers. In this study, we test graph theoretic concepts such as shortest-path, k-Nearest- Neighbor and clustering) to identify cores iteratively in data- And knowledge-based networks in the canonical yeast Pheromone Mating Response pathway. Additionally, we provide results for convergence application in virus infection, hearing loss, and Parkinson's disease. Our results indicate that if a marker set has common discrete function, this approach is able to identify that function, its interacting markers, and any new elements necessary to complete the structural core of that function. The result below find that the shortest path function is the best approach of those used, finding small target sets that contain a majority or all of the markers in the gold standard pathway. The power of this approach lies in its ability to be used in investigative studies to inform decisions concerning target selection.

Original languageEnglish (US)
Title of host publication2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013
Pages853-860
Number of pages8
DOIs
StatePublished - Nov 28 2013
Event2013 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013 - Wshington, DC, United States
Duration: Sep 22 2013Sep 25 2013

Publication series

Name2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013

Conference

Conference2013 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013
CountryUnited States
CityWshington, DC
Period9/22/139/25/13

Fingerprint

Aptitude
Proteins
Biological Phenomena
Guilt
Systems Biology
Pheromones
Virus Diseases
Hearing Loss
Cluster Analysis
Parkinson Disease
Yeasts
Technology
Circuit theory
Audition
Viruses
Yeast
Ontology
Identification (control systems)
Genes

Keywords

  • Biological networks
  • Convergence
  • Graph theory
  • Ontology

ASJC Scopus subject areas

  • Bioengineering
  • Biomedical Engineering
  • Health Informatics

Cite this

Cooper, K. M., & Ali, H. H. (2013). Identifying pathway proteins in networks using convergence. In 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013 (pp. 853-860). (2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013). https://doi.org/10.1145/2506583.2506695

Identifying pathway proteins in networks using convergence. / Cooper, Kathryn M; Ali, Hesham H.

2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013. 2013. p. 853-860 (2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cooper, KM & Ali, HH 2013, Identifying pathway proteins in networks using convergence. in 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013. 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013, pp. 853-860, 2013 4th ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013, Wshington, DC, United States, 9/22/13. https://doi.org/10.1145/2506583.2506695
Cooper KM, Ali HH. Identifying pathway proteins in networks using convergence. In 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013. 2013. p. 853-860. (2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013). https://doi.org/10.1145/2506583.2506695
Cooper, Kathryn M ; Ali, Hesham H. / Identifying pathway proteins in networks using convergence. 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013. 2013. pp. 853-860 (2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013).
@inproceedings{304c94fe60b94bf4b052351a908def6f,
title = "Identifying pathway proteins in networks using convergence",
abstract = "One of the key goals of systems biology concerns the analysis of experimental biological data available to the scientific public. New technologies are rapidly developed to observe and report whole-scale biological phenomena; however, few methods exist with the ability to produce specific, testable hypotheses from this noisy 'big' data. In this work, we propose an approach that combines the power of data-driven network theory along with knowledge-based ontology to tackle this problem. Network models are especially powerful due to their ability to display elements of interest and their relationships as internetwork structures. Additionally, ontological data actually supplements the confidence of relationships within the model without clouding critical structure identification. As such, we postulate that given a (gene/protein) marker set of interest, we can systematically identify the core of their interactions (if they are indeed working together toward a biological function), via elimination of original markers and addition of additional necessary markers. This concept, which we refer to as {"}convergence,{"} harnesses the idea of {"}guilt-by-association{"} and recursion to identify whether a core of relationships exists between markers. In this study, we test graph theoretic concepts such as shortest-path, k-Nearest- Neighbor and clustering) to identify cores iteratively in data- And knowledge-based networks in the canonical yeast Pheromone Mating Response pathway. Additionally, we provide results for convergence application in virus infection, hearing loss, and Parkinson's disease. Our results indicate that if a marker set has common discrete function, this approach is able to identify that function, its interacting markers, and any new elements necessary to complete the structural core of that function. The result below find that the shortest path function is the best approach of those used, finding small target sets that contain a majority or all of the markers in the gold standard pathway. The power of this approach lies in its ability to be used in investigative studies to inform decisions concerning target selection.",
keywords = "Biological networks, Convergence, Graph theory, Ontology",
author = "Cooper, {Kathryn M} and Ali, {Hesham H}",
year = "2013",
month = "11",
day = "28",
doi = "10.1145/2506583.2506695",
language = "English (US)",
isbn = "9781450324342",
series = "2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013",
pages = "853--860",
booktitle = "2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013",

}

TY - GEN

T1 - Identifying pathway proteins in networks using convergence

AU - Cooper, Kathryn M

AU - Ali, Hesham H

PY - 2013/11/28

Y1 - 2013/11/28

N2 - One of the key goals of systems biology concerns the analysis of experimental biological data available to the scientific public. New technologies are rapidly developed to observe and report whole-scale biological phenomena; however, few methods exist with the ability to produce specific, testable hypotheses from this noisy 'big' data. In this work, we propose an approach that combines the power of data-driven network theory along with knowledge-based ontology to tackle this problem. Network models are especially powerful due to their ability to display elements of interest and their relationships as internetwork structures. Additionally, ontological data actually supplements the confidence of relationships within the model without clouding critical structure identification. As such, we postulate that given a (gene/protein) marker set of interest, we can systematically identify the core of their interactions (if they are indeed working together toward a biological function), via elimination of original markers and addition of additional necessary markers. This concept, which we refer to as "convergence," harnesses the idea of "guilt-by-association" and recursion to identify whether a core of relationships exists between markers. In this study, we test graph theoretic concepts such as shortest-path, k-Nearest- Neighbor and clustering) to identify cores iteratively in data- And knowledge-based networks in the canonical yeast Pheromone Mating Response pathway. Additionally, we provide results for convergence application in virus infection, hearing loss, and Parkinson's disease. Our results indicate that if a marker set has common discrete function, this approach is able to identify that function, its interacting markers, and any new elements necessary to complete the structural core of that function. The result below find that the shortest path function is the best approach of those used, finding small target sets that contain a majority or all of the markers in the gold standard pathway. The power of this approach lies in its ability to be used in investigative studies to inform decisions concerning target selection.

AB - One of the key goals of systems biology concerns the analysis of experimental biological data available to the scientific public. New technologies are rapidly developed to observe and report whole-scale biological phenomena; however, few methods exist with the ability to produce specific, testable hypotheses from this noisy 'big' data. In this work, we propose an approach that combines the power of data-driven network theory along with knowledge-based ontology to tackle this problem. Network models are especially powerful due to their ability to display elements of interest and their relationships as internetwork structures. Additionally, ontological data actually supplements the confidence of relationships within the model without clouding critical structure identification. As such, we postulate that given a (gene/protein) marker set of interest, we can systematically identify the core of their interactions (if they are indeed working together toward a biological function), via elimination of original markers and addition of additional necessary markers. This concept, which we refer to as "convergence," harnesses the idea of "guilt-by-association" and recursion to identify whether a core of relationships exists between markers. In this study, we test graph theoretic concepts such as shortest-path, k-Nearest- Neighbor and clustering) to identify cores iteratively in data- And knowledge-based networks in the canonical yeast Pheromone Mating Response pathway. Additionally, we provide results for convergence application in virus infection, hearing loss, and Parkinson's disease. Our results indicate that if a marker set has common discrete function, this approach is able to identify that function, its interacting markers, and any new elements necessary to complete the structural core of that function. The result below find that the shortest path function is the best approach of those used, finding small target sets that contain a majority or all of the markers in the gold standard pathway. The power of this approach lies in its ability to be used in investigative studies to inform decisions concerning target selection.

KW - Biological networks

KW - Convergence

KW - Graph theory

KW - Ontology

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

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

U2 - 10.1145/2506583.2506695

DO - 10.1145/2506583.2506695

M3 - Conference contribution

AN - SCOPUS:84888192825

SN - 9781450324342

T3 - 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013

SP - 853

EP - 860

BT - 2013 ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013

ER -