Search alternatives:
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
using function » using functional (Expand Search), sine function (Expand Search), waning function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
using function » using functional (Expand Search), sine function (Expand Search), waning function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
-
1
-
2
-
3
EFGs: A Complete and Accurate Implementation of Ertl’s Functional Group Detection Algorithm in RDKit
Published 2025“…In medicinal chemistry, they are the basis for analyzing ligand–biomacromolecule interactions. Ertl’s algorithm is an approach to extract functional groups in arbitrary organic molecules that does not depend on predefined libraries of functional groups. …”
-
4
-
5
-
6
Algorithm of the brightness scale calibration experiment.
Published 2024“…<p>In the algorithm, the following variables were used: “I” denotes the current luminous intensity of the reference diode, “inc” denotes the current difference between reference and target diode luminous intensity; “cnt” is the current number of performed trials, while “correct” is a counter of correct answers in cnt trials, both of them are counted separately for every settings of I and inc. …”
-
7
Gillespie algorithm simulation parameters.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
8
-
9
-
10
-
11
-
12
Comparison of deconvolution and optimization algorithms on a batch of data.
Published 2021“…Output is given by the vascular response, measured as the change in speed of red blood cells flowing inside a capillary proximal to the recorded neuronal activation (in yellow, right panel). 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). …”
-
13
-
14
-
15
-
16
-
17
-
18
-
19
Statistical results of various algorithms.
Published 2025“…Furthermore, inspired by the grey wolf optimization algorithm, use 3 excellent particle surround strategies instead of the original random selecting particles. …”
-
20
Images of partial benchmark functions.
Published 2025“…Furthermore, inspired by the grey wolf optimization algorithm, use 3 excellent particle surround strategies instead of the original random selecting particles. …”