2017 IEEE Third International Conference on Big Data Computing Service and Applications (BigDataService) 2017
DOI: 10.1109/bigdataservice.2017.39
|View full text |Cite
|
Sign up to set email alerts
|

Graph-Theory Based Simplification Techniques for Efficient Biological Network Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…Among the 495 genes, 190 genes (coloured in red in Figure 8) were reported in the String database, and 41 interactions were matched. The simplified sub-components that maximise interaction coefficients of the connectedcomponents were analysed (Ko et al, 2017) for further analysis, as shown in Figure 9. Two gene regulations, shown as lines in red, are in accordance with the report of the String database.…”
Section: Experimental Results With Simulation Datamentioning
confidence: 99%
“…Among the 495 genes, 190 genes (coloured in red in Figure 8) were reported in the String database, and 41 interactions were matched. The simplified sub-components that maximise interaction coefficients of the connectedcomponents were analysed (Ko et al, 2017) for further analysis, as shown in Figure 9. Two gene regulations, shown as lines in red, are in accordance with the report of the String database.…”
Section: Experimental Results With Simulation Datamentioning
confidence: 99%
“…Among the 495 genes, 190 genes (coloured in red in Figure 8) were reported in the String database, and 41 interactions were matched. The simplified sub-components that maximise interaction coefficients of the connected-components were analysed (Ko et al, 2017) for further analysis, as shown in Figure 9. Two gene regulations, shown as lines in red, are in accordance with the report of the String database.…”
Section: Human Brain Data For Psychiatric Diseasesmentioning
confidence: 99%
“…In our proposed approach, after obtaining possible docked poses of fragments, a graph theory algorithm is applied to align a complete ligand with the binding poses of its composing fragments. Graph theory-based methods have been adopted in various biological and bioinformatics studies previously, including metabolic pathway analysis [35,36], protein flexibility predictions [37], protein side chain predictions [38], secondary structure motif comparisons [39], calcium binding site predictions [40] and more. The application of graph theory in the current work has been inspired by earlier studies using graph theory to find maximum common substructures between two structures [41][42][43][44].…”
Section: Introductionmentioning
confidence: 99%