2019
DOI: 10.1186/s13015-019-0146-7
|View full text |Cite
|
Sign up to set email alerts
|

Differentially mutated subnetworks discovery

Abstract: Problem We study the problem of identifying differentially mutated subnetworks of a large gene–gene interaction network, that is, subnetworks that display a significant difference in mutation frequency in two sets of cancer samples. We formally define the associated computational problem and show that the problem is NP-hard. Algorithm We propose a novel and efficient algorithm, called DAMOKLE, to identify differentially mutated subnetworks given genome-wide mutation dat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 40 publications
0
6
0
Order By: Relevance
“…To evaluate the confidence of association, we set the number of permutations as 100 to compute p-values and applied a threshold of p<0.01. A second approach used DAMOKLE ( 62 ) to identify differentially mutated subnetworks of protein-protein interacting complexes, as defined by the STRING database (https://string-db.org/) ( 60 ), and with a significance threshold of p<0.05. Gene essentiality scores from the DEPMAP and TCGA DEPMAP were then associated with the differentially mutated sub-networks.…”
Section: Methodsmentioning
confidence: 99%
“…To evaluate the confidence of association, we set the number of permutations as 100 to compute p-values and applied a threshold of p<0.01. A second approach used DAMOKLE ( 62 ) to identify differentially mutated subnetworks of protein-protein interacting complexes, as defined by the STRING database (https://string-db.org/) ( 60 ), and with a significance threshold of p<0.05. Gene essentiality scores from the DEPMAP and TCGA DEPMAP were then associated with the differentially mutated sub-networks.…”
Section: Methodsmentioning
confidence: 99%
“…Morteza Chalabi Hajkarim et al (2019) [42] aim at identifying differentially mutated subnetworks of a large genegene interaction network by defining a computational problem then showing that this problem is a NP-Hard problem. The proposed method identifies subnetworks infrastructures that have a statistically significant difference in their frequency of mutation in cases where aa reasonable generative model is used as a data source.…”
Section: Literature Reviewmentioning
confidence: 99%
“…For example, finding a sub-graph within a larger graph network is an NP-hard problem (Barillot et al, 2013 [78]). Finding differentially mutated subnetworks of a larger gene-gene interaction network is likewise an NPhard problem (Lu et al, 2016 [79]; Hajkarim et al, 2019 [80]). With chaotic attractors, the computational complexity and intractability is much greater.…”
Section: Boolean Networkmentioning
confidence: 99%