Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
101
-
102
-
103
-
104
-
105
Variants that passed the permuted p-value cut-off in the meta-analysis of GWAS.
Published 2024Subjects: -
106
-
107
Number of samples in each cluster carrying the 9 SNPs shared by the high-risk lineage only.
Published 2024Subjects: -
108
-
109
-
110
-
111
Dataset of networks used in assessing the Troika algorithm for clique partitioning and community detection
Published 2025“…Each network is provided in .gml format or .pkl format which can be read into a networkX graph object using standard functions from the networkX library in Python. …”
-
112
Search Algorithms and Loss Functions for Bayesian Clustering
Published 2022“…<p>We propose a randomized greedy search algorithm to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. …”
-
113
-
114
-
115
-
116
-
117
Comparison of deconvolution and optimization algorithms on a batch of data.
Published 2021“…Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”
-
118
-
119
-
120