2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) 2019
DOI: 10.1109/empdp.2019.8671629
|View full text |Cite
|
Sign up to set email alerts
|

OneGenE: Regulatory Gene Network Expansion via Distributed Volunteer Computing on BOINC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…OneGenE [15] is a method to compute ranked candidate gene lists that expands known local gene networks given gene expression data. As its predecessor NES 2 RA, OneGenE (Algorithms 1 and 3) is based on the systematic and iterative application of the skeleton function of the PC algorithm (Algorithm 2) on subsets of the input data.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…OneGenE [15] is a method to compute ranked candidate gene lists that expands known local gene networks given gene expression data. As its predecessor NES 2 RA, OneGenE (Algorithms 1 and 3) is based on the systematic and iterative application of the skeleton function of the PC algorithm (Algorithm 2) on subsets of the input data.…”
Section: Methodsmentioning
confidence: 99%
“…LGNs, by pre-computing partial results, namely single-gene NES 2 RA expansions, on the BOINC platform. Figure 1 shows the block scheme of the OneGenE architecture [15], highlighting the different platforms and the two computational stages. First, a pre-computation step: candidate expansion lists are pre-computed for each gene (or more generally transcript) of the target organism exploiting the BOINC platform.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The expansion of each gene of the Vitis vinifera genome originated from the run of the algorithms of the OneGenE system [18,38]. Each expansion procedure consisted of 2000 iterations of our C++ implementation (https://bitbucket.org/francesco-asnicar/pc-boinc/, last accessed on 16 June 2020) of the PC-algorithm skeleton procedure [39] (α = 0.05) to 29 sets of 1000 variables (genes), which included the gene to be expanded, and a random subset of 999 genes sampled without replacement.…”
Section: Computation Of Onegene Expansion Listsmentioning
confidence: 99%