2020
DOI: 10.1093/bib/bbaa372
|View full text |Cite
|
Sign up to set email alerts
|

idenPC-CAP: Identify protein complexes from weighted RNA-protein heterogeneous interaction networks using co-assemble partner relation

Abstract: Protein complexes play important roles in most cellular processes. The available genome-wide protein–protein interaction (PPI) data make it possible for computational methods identifying protein complexes from PPI networks. However, PPI datasets usually contain a large ratio of false positive noise. Moreover, different types of biomolecules in a living cell cooperate to form a union interaction network. Because previous computational methods focus only on PPIs ignoring other types of biomolecule interactions, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 73 publications
0
12
0
Order By: Relevance
“…In our experiments, we primarily used an identity matrix as feature embedding. Moreover, we also tried a custom feature matrix, which was built using the RNA-RNA interaction networks and RNA-protein interaction networks [24]. For the node classification task, the adjacency matrix and feature matrix were required as input.…”
Section: ) Explicit Node Featuresmentioning
confidence: 99%
See 2 more Smart Citations
“…In our experiments, we primarily used an identity matrix as feature embedding. Moreover, we also tried a custom feature matrix, which was built using the RNA-RNA interaction networks and RNA-protein interaction networks [24]. For the node classification task, the adjacency matrix and feature matrix were required as input.…”
Section: ) Explicit Node Featuresmentioning
confidence: 99%
“…The results of this feature learning algorithm are provided in Table 2. Results for other methods are obtained from [24]. The number of epochs was 400, in this case, and a hidden layer sizes 512 were selected for this process with Adam as optimizer.…”
Section: B Representation Learning Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…Approaches based on statistics, relying on the employment of statistical concepts for clustering proteins, e.g. how many shared neighbors pair of proteins have, and on notions of referential attachments for module members with other elements within the module; this includes SL [23], idenPC-MIIP [24], idenPC-CAP [25] and Farutin [2]. 5.…”
Section: Local Search Approaches Based On Cost Focusing On the Extraction Of Modules From Interaction Graphsmentioning
confidence: 99%
“…Apart from this, we have also tried a custom feature matrix. The RNA-RNA interaction networks and RNA-protein interaction networks [49] were used to build the feature matrix. For the node classification task, the adjacency matrix and feature matrix are required as input.…”
Section: Explicit Node Featuresmentioning
confidence: 99%