<p>(a) shows the runtime of the five biological data sets. (b) shows the speedup of cd40 and enolase data sets.</p
Abstract. This paper presents a parallel version for the Propagation Algorithm which belongs to the ...
Sequencing metrics for two biological replicate libraries created with the protocol V1 [7] and two b...
<p>K-means: k-means clustering; AP: Affinity Propagation clustering; SSAP: Semi-supervised Affinity ...
BACKGROUNDS: Recent explosion of biological data brings a great challenge for the traditional cluste...
Backgrounds: Recent explosion of biological data brings a great challenge for the traditional cluste...
He number of compute nodes used in the analysis. The bar graphs at the bottom of each plot illustrat...
<p>Shown are the results for (red), (green) and (blue). The horizontal dashed line shows the full...
<p>Computation time of the OSEM algorithm (in seconds) and speedup by the GPU implementation based o...
LDhat is a Linux-based package written in C-language, used for analysis and calculation of recombina...
<p>(a) Speedup curves when 50% genes were filtered out at data preprocessing stage. (b) Speedup curv...
<p>Dataset A consists of 67,748 DNA sequences with average length of 41 Kb and dataset B is the huma...
<p>Performance comparison of eight algorithms on four yeast PPI datasets using MIPS as the test set....
We present a general method for analyzing the runtime of parallel evolutionary algorithms with spati...
An example field of view imaged over 10 hours (200 time points, 360 cells at the last time point) wa...
<p>Performance comparison of eight algorithms on four yeast PPI datasets using SGD as the test set.<...
Abstract. This paper presents a parallel version for the Propagation Algorithm which belongs to the ...
Sequencing metrics for two biological replicate libraries created with the protocol V1 [7] and two b...
<p>K-means: k-means clustering; AP: Affinity Propagation clustering; SSAP: Semi-supervised Affinity ...
BACKGROUNDS: Recent explosion of biological data brings a great challenge for the traditional cluste...
Backgrounds: Recent explosion of biological data brings a great challenge for the traditional cluste...
He number of compute nodes used in the analysis. The bar graphs at the bottom of each plot illustrat...
<p>Shown are the results for (red), (green) and (blue). The horizontal dashed line shows the full...
<p>Computation time of the OSEM algorithm (in seconds) and speedup by the GPU implementation based o...
LDhat is a Linux-based package written in C-language, used for analysis and calculation of recombina...
<p>(a) Speedup curves when 50% genes were filtered out at data preprocessing stage. (b) Speedup curv...
<p>Dataset A consists of 67,748 DNA sequences with average length of 41 Kb and dataset B is the huma...
<p>Performance comparison of eight algorithms on four yeast PPI datasets using MIPS as the test set....
We present a general method for analyzing the runtime of parallel evolutionary algorithms with spati...
An example field of view imaged over 10 hours (200 time points, 360 cells at the last time point) wa...
<p>Performance comparison of eight algorithms on four yeast PPI datasets using SGD as the test set.<...
Abstract. This paper presents a parallel version for the Propagation Algorithm which belongs to the ...
Sequencing metrics for two biological replicate libraries created with the protocol V1 [7] and two b...
<p>K-means: k-means clustering; AP: Affinity Propagation clustering; SSAP: Semi-supervised Affinity ...
DOI
Add to ORKG