Showing 1 - 20 results of 3,198 for search '(( algorithm from function ) OR ( algorithm b function ))', query time: 0.36s Refine Results
  1. 1
  2. 2

    Linear-regression-based algorithms succeed at identifying the correct functional groups in synthetic data, and multi-group algorithms recover more information. by Yuanchen Zhao (12905580)

    Published 2024
    “…<p>(A), (B) Algorithm performance, evaluated over 50 simulated datasets generated as described in <a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012590#pcbi.1012590.g001" target="_blank">Fig 1</a> with <i>N</i> = 3 true groups, 900 samples and 10% simulated measurement noise. …”
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions. by Yuanchen Zhao (12905580)

    Published 2024
    “…The panels highlight that the task of identifying a predictive coarsening of an ecosystem (B) is distinct from the task of predicting the function well (A), and for small or noisy datasets, the former is best accomplished by a simpler method. …”
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    A framework for improving localisation prediction algorithms. by Sven B. Gould (12237287)

    Published 2024
    “…One can expect that the combination of multi-dimensional parameters from evolutionary biology, cell biology and molecular biology on evolutionary diverse species will significantly improve the next generation of machine leaning algorithms that serve localisation (and function) predictions.…”
  16. 16

    (a) Radar chart of these algorithms (23 Benchmark functions), (b) The sorting diagram of these algorithms (23 Benchmark functions). by Yu Liu (6938)

    Published 2025
    “…<p>(a) Radar chart of these algorithms (23 Benchmark functions), (b) The sorting diagram of these algorithms (23 Benchmark functions).…”
  17. 17

    PATH has state-of-the-art performance versus previous binding affinity prediction algorithms. by Yuxi Long (11024307)

    Published 2025
    “…The benchmarked algorithms include physics-based and deep learning algorithms from the famous AutoDock framework (scoring function of AutoDock4 implemented in the AutoDockFR package [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref068" target="_blank">68</a>,<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref077" target="_blank">77</a>], Vinardo [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref069" target="_blank">69</a>], GNINA [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref070" target="_blank">70</a>]), empirical (AA-Score [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref071" target="_blank">71</a>]), knowledge-based (SMoG2016 [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref072" target="_blank">72</a>]), and deep learning-based scoring functions (OnionNet [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref073" target="_blank">73</a>], PLANET [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1013216#pcbi.1013216.ref074" target="_blank">74</a>]). …”
  18. 18
  19. 19
  20. 20

    Functions in nhppp. by Thomas A. Trikalinos (5785877)

    Published 2024
    “…We developed it to facilitate the sampling of event times in discrete event and statistical simulations. The package’s functions are based on three algorithms that provably sample from a target NHPPP: the time-transformation of a homogeneous Poisson process (of intensity one) via the inverse of the integrated intensity function; the generation of a Poisson number of order statistics from a fixed density function; and the thinning of a majorizing NHPPP via an acceptance-rejection scheme. …”