Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
python function » protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
python function » protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
-
461
Feature selection results.
Published 2025“…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
-
462
ANOVA test for feature selection.
Published 2025“…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
-
463
Wilcoxon test results for optimization.
Published 2025“…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
-
464
Classification performance of ML and DL models.
Published 2025“…We applied this hybrid strategy to a Radial Basis Function Network (RBFN), and validated its performance improvements through extensive experiments, including ANOVA and Wilcoxon tests for both feature selection and optimization phases. …”
-
465
Skipping frames and interpolating skeletons with a spline achieves similar accuracy and faster computational time.
Published 2025“…(C) Computation time per input frame for the different models as a function of worm number. Tierpsy only uses CPU computation while Omnipose uses GPU and CPU because we use Tierpsy’s skeletonization algorithm to convert segmented regions to skeletons. …”
-
466
PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach
Published 2025“…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
-
467
PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach
Published 2025“…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
-
468
PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach
Published 2025“…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
-
469
PhyCysID: Plant Cystatin Protein Prediction by an Artificial Intelligence Approach
Published 2025“…As a case study, a curated dataset of phytocystatin sequences from the UniProt database was used to evaluate the algorithm’s performance. The PhyCysID web server enables rapid classification of both individual and batch-submitted sequences in less than 15 s, providing high-throughput analysis for an accurate identification of phytocystatin class and function. …”
-
470
Structure and parameters of pipeline network.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
471
Experimental parameter combinations.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
472
Experimental results.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
473
Data sources for figures and tables.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
474
Fault events.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
475
-
476
-
477
-
478
-
479
-
480
TNP-TMA BC biomarker panels.
Published 2025“…Existing computational methods overlook both cell population heterogeneity across modalities and spatial information, which are critical for effectively completing this task. …”