2016
DOI: 10.1016/j.procs.2016.07.309
|View full text |Cite
|
Sign up to set email alerts
|

Protein Complex Detection in PPI Network by Identifying Mutually Exclusive Protein-protein Interactions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…It has been observed that proteins within a complex are functionally similar 14 , 32 , 33 . For understanding the biological roles and functions of proteins, functional similarity is a more informative measure compared to the structural and sequence similarity.…”
Section: Resultsmentioning
confidence: 99%
“…It has been observed that proteins within a complex are functionally similar 14 , 32 , 33 . For understanding the biological roles and functions of proteins, functional similarity is a more informative measure compared to the structural and sequence similarity.…”
Section: Resultsmentioning
confidence: 99%
“…The densely connected regions in the core network were predicted using module analysis using Molecular Cluster Detection (MCODE) 4.1, a Cytoscape plug-in. The local neighbourhood density of weighted nodes was used to identify the network's heavily linked areas [22]. All of the parameters were kept constant, including the degree threshold (2), node score threshold (0.2), k-core threshold (2) and network max depth (100).…”
Section: Network Cluster Analysismentioning
confidence: 99%
“…1) A local neighborhood density search approach, focusing on the discovery of dense subgraphs inside the input network, including MCODE [7], DPClus [6], ProRank [8], [9], ProRank+ [10], CMC [11], PROCOMOSS [12] and PEWCC [13], NCMine [14], Core&Peel [15], SPICi [16] and non-cooperative sequential game [17]. 2) Local search approaches based on cost, focusing on the extraction of modules from interaction graphs through the partition of the graphs into linked subgraphs employing cost functions for the guidance of searches towards the optimal partition, including RNSC [18], ModuLand [19], and STM [20].…”
Section: Introductionmentioning
confidence: 99%