Publications

Detailed Information

Scalable graph path discovery for biomedical linked data : 대용량 의생물학 링크드 데이터를 위한 그래프 경로 탐색

DC Field Value Language
dc.contributor.advisor김홍기-
dc.contributor.author안진현-
dc.date.accessioned2017-07-14T05:46:24Z-
dc.date.available2017-07-14T05:46:24Z-
dc.date.issued2017-02-
dc.identifier.other000000142357-
dc.identifier.urihttps://hdl.handle.net/10371/125144-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 치의과학과, 2017. 2. 김홍기.-
dc.description.abstractA drug could give rise to an adverse effect when combined with another particular drug. Addressing the underlying causes of the adverse effects is crucial for researchers to develop new drugs and for clinicians to prescribe medicine. Most existing approaches attempt to identify a set of target genes for which drugs are most effective, which provides insufficient information regarding these causes in terms of biological dynamics. Drugs should instead be considered as participants in activating a sequence of pathways that lead to some effects. I believe that the causes can better be understood by such linked pathways. Therefore, the purpose of this thesis is to develop algorithms and tools that can be used to discover a sequence of pathways that is activated by a particular drug combination. Furthermore, these algorithms are required to be scalable to manage massive biomedical Linked Data because up-to-date results of biomedical research are increasingly available in Linked Data.

My hypothesis is that for a drug combination, when a drug up-regulates particular pathways in one direction and another drug down-regulates the same pathways in an opposite direction, adverse effects may occur by the drug combination. In this regard, the problem of revealing the causes of adverse effects of drug combinations is cast into the problem of discovering paths of a sequence of linked pathways that begins and ends at the genes that the given drugs target. Therefore, the scalable graph path discovery and matching algorithms are devised such that they work with a distributed computing environment. A pathway graph model is defined to integrate diverse biomedical datasets and a visualization tool is implemented to provide biomedical researchers and clinicians with intuitive interfaces for revealing the causes of the adverse effects.

An algorithm for the shortest graph path discovery is proposed. An existing relational database approach is adapted to address the shortest graph path discovery in a distributed computing framework, in particular, Spark. The 2-hop reachability index is exploited to prune non-reachable paths during discovery computation. A vertex re-labeling technique is proposed to reduce the size of the 2-hop reachability index. Experimental results show that the proposed approach can successfully manage a large graph, which previous studies have failed to do.

The discovered shortest graph path can be transformed into a graph path query to find another similar graph path. To achieve this, a MapReduce algorithm for graph path matching, based on multi-way joins, is proposed. A signature encoding technique is devised to prune intermediate data that is not relevant to the given query. Experiments against RDF (Resource Description Framework) datasets show that SPARQL query processing is faster than the state-of-the-art approaches.

To adapt these algorithms into the problem of drug combinations causing adverse effects, a novel pathway graph model is proposed. In particular, a pathway relationship model is described
-
dc.description.abstractdirected links between pathways are established using protein–protein interactions and up/down regulations between genes. A prototype system based on a visualization framework is implemented and applied to a pathway graph that is built on the basis of several biomedical Linked Data (e.g. Reactome, KEGG, BioGrid, STRING and etc). A list of candidate drug combinations is obtained using the proposed system, which is compared with known drug-drug combinations available in DrugBank.

A scalable graph path discovery solution is proposed in this thesis. Distributed computing frameworks and several index structures are exploited to efficiently handle massive graphs. A pathway graph model is defined and a prototype system for biomedical researchers is implemented to apply the algorithms to the problem of drug combinations causing adverse effects. In future works, the solution will be generalized to address the temporal organization of signaling pathways, thereby enabling the causes of adverse effects of drug combination to be better understood.
-
dc.description.tableofcontentsI. Introduction 1
1.1 Background and Motivation 1
1.2 Contributions 4
1.2.1 Shortest Graph Path Discovery based on Reachability Index 4
1.2.2 Graph Path Matching based on Signature Encoding 5
1.2.3 Application to Biomedical Linked Data 6
1.3 Thesis Organization 6
II. Preliminaries and RelatedWork 9
2.1 Graph 9
2.2 Graph Path 10
2.3 Acyclic Transformation 11
2.4 Reachability 11
2.5 Distributed Computing Frameworks 12
2.6 RDF & SPARQL 12
2.7 SPARQL Processing Engines 14
III. Shortest Graph Path Discovery based on Reachability Index 17
3.1 Introduction 17
3.2 Space Reduction of Reachability Index 18
3.2.1 Introduction 18
3.2.2 Related Work 21
3.2.3 The Proposed Approach 24
3.2.4 Theoretical Analysis 25
3.2.5 Experimental Results 31
3.2.6 Conclusion and Future Work 33
3.3 Shortest Path Discovery 40
3.3.1 Introduction 40
3.3.2 FEM 41
3.3.3 FEM-SR 42
3.3.4 Theoretical Analysis 46
3.3.5 Experimental Results 51
3.3.6 Federated Shortest Path Discovery 53
3.4 Conclusion 55
IV. Graph Path Matching based on Signature Encoding 61
4.1 Introduction 61
4.2 Related Work 67
4.3 Limitations of MapReduce-based SPARQL engines 68
4.4 SigMR 69
4.5 Index Structure 70
4.5.1 Encoding Joined Triples 72
4.6 Index Building 76
4.7 Query Processing 83
4.8 Theoretical Analysis 88
4.8.1 Cost Model 89
4.8.2 Correctness 92
4.9 Experiments 94
4.9.1 Index Building Time and Space Requirements 95
4.9.2 Query Execution Time 98
4.9.3 Effect of Signature Encoding 100
4.9.4 Effect of the Size of Join Matrix 100
4.10 Conclusion 102
V. Application to Biomedical Linked Data 105
5.1 Introduction 105
5.2 Related Work 106
5.3 Data Model 108
5.4 CyHadoop 116
5.5 Scenario 119
5.6 Preliminary Results 120
5.7 Future Directions 121
VI. Conclusion 129
References 131
Appendix 141
초록 153
-
dc.formatapplication/pdf-
dc.format.extent8245319 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectGraph-
dc.subjectShortest Path Discovery-
dc.subjectRDF-
dc.subjectLinked Data-
dc.subjectMapReduce-
dc.subjectSpark-
dc.subject.ddc617-
dc.titleScalable graph path discovery for biomedical linked data-
dc.title.alternative대용량 의생물학 링크드 데이터를 위한 그래프 경로 탐색-
dc.typeThesis-
dc.contributor.AlternativeAuthorJinhyun Ahn-
dc.description.degreeDoctor-
dc.citation.pages156-
dc.contributor.affiliation치의학대학원 치의과학과-
dc.date.awarded2017-02-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share