Estimating Protein-Protein Interaction Network Similarity through Sampling

Please enable javascript in your browser.

Naseri, Shervin | 2021

304 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 54487 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Beigy, Hamid
Abstract:
In examining protein-protein interaction networks, we often encounter similar and repetitive schemes. Examination of these designs, which often appear in the form of motifs and similar patterns, reveals important information such as the type of protein linkage and many of the internal similarities between these networks. The ability to recognize these similarities plays an important role in identifying the function of genes, recognizing the relationships between diseases, and making drugs. We know that exact algorithms for examining subgraph isomorphism are np-hard and time-consuming and infeasible in large networks; Therefore, in practice, approximate and heuristic algorithms are used and usually local and topological or biological criteria are used to examine the similarity. In this thesis is we have provided a method based on sampling to estimate the similarity between the graphs of protein-protein interactions which is more stable with smaller sample count compared to similar previous method
Keywords:
Protein-Protein Interaction ; Estimation ; Topological Features ; Graph Similarity ; Sampling ; Approximate Algorithm

No TOC