بدائل البحث:
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث), algorithm both (توسيع البحث)
python function » protein function (توسيع البحث)
where function » sphere function (توسيع البحث), gene function (توسيع البحث), wave function (توسيع البحث)
algorithms mc » algorithms hamc (توسيع البحث), algorithms _ (توسيع البحث), algorithms a (توسيع البحث)
mc function » fc function (توسيع البحث), spc function (توسيع البحث), npc function (توسيع البحث)
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث), algorithm both (توسيع البحث)
python function » protein function (توسيع البحث)
where function » sphere function (توسيع البحث), gene function (توسيع البحث), wave function (توسيع البحث)
algorithms mc » algorithms hamc (توسيع البحث), algorithms _ (توسيع البحث), algorithms a (توسيع البحث)
mc function » fc function (توسيع البحث), spc function (توسيع البحث), npc function (توسيع البحث)
-
81
Summary of WGS datasets.
منشور في 2025"…Existing mapping methods use a bioinformatic mapping-by-sequencing approach based on allelic frequency calculations that often identify large genomic regions which contain an intractable number of candidate genes for testing. Here, we describe WheresWalker, a modern mapping-by-sequencing algorithm that identifies a mutation-containing interval and then supports positional cloning to shrink the interval, which drastically reduces the number of potential candidates, allowing for extremely rapid mutation identification. …"
-
82
Oligo sequences.
منشور في 2025"…Existing mapping methods use a bioinformatic mapping-by-sequencing approach based on allelic frequency calculations that often identify large genomic regions which contain an intractable number of candidate genes for testing. Here, we describe WheresWalker, a modern mapping-by-sequencing algorithm that identifies a mutation-containing interval and then supports positional cloning to shrink the interval, which drastically reduces the number of potential candidates, allowing for extremely rapid mutation identification. …"
-
83
<i>zion</i> WGS summary.
منشور في 2025"…Existing mapping methods use a bioinformatic mapping-by-sequencing approach based on allelic frequency calculations that often identify large genomic regions which contain an intractable number of candidate genes for testing. Here, we describe WheresWalker, a modern mapping-by-sequencing algorithm that identifies a mutation-containing interval and then supports positional cloning to shrink the interval, which drastically reduces the number of potential candidates, allowing for extremely rapid mutation identification. …"
-
84
-
85
-
86
-
87
-
88
PathOlOgics_RBCs Python Scripts.zip
منشور في 2023"…<p dir="ltr">The first algorithm for segmentation and localization (see PathOlOgics_script_1; segment & localize using a pen) relied on manually tracing the borders of each cell using a digital pen tool on a big touchscreen display showing source images/patches. …"
-
89
Simulation results for average reward rate function using the UCB algorithm , where <i>A</i> = 100, <i>ℓ</i> = 20, <i>μ</i> = [0.75, …(×50), 0.5, …(×50)], and <i>T</i> = 1000, and .
منشور في 2022"…<p>Simulation results for average reward rate function using the UCB algorithm , where <i>A</i> = 100, <i>ℓ</i> = 20, <i>μ</i> = [0.75, …(×50), 0.5, …(×50)], and <i>T</i> = 1000, and .…"
-
90
-
91
Results of the application of different clustering algorithms to average functional connectivity from healthy subjects.
منشور في 2023"…<p>A) Resulting cluster inertia from applying the k-means algorithm described in the methods to empirical averaged functional connectivity from healthy subjects, with different numbers of clusters. …"
-
92
-
93
Multidomain, Automated Photopatterning of DNA-functionalized Hydrogels (MAPDH).
منشور في 2024"…<b>B)</b> Pseudocode for MAPDH in Python. The algorithm takes as input the vials that will be flowed through the patterning chamber. …"
-
94
-
95
Algorithm parameter setting.
منشور في 2023"…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…"
-
96
Algorithm parameter setting.
منشور في 2023"…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…"
-
97
-
98
Membership function of each target.
منشور في 2023"…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…"
-
99
Artificial colony algorithm flow.
منشور في 2024"…In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. …"
-
100
Pseudo-code of ABC algorithm.
منشور في 2024"…In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. …"