Showing 101 - 120 results of 5,137 for search '(( algorithm python function ) OR ((( algorithm co function ) OR ( algorithm its function ))))', query time: 0.63s Refine Results
  1. 101
  2. 102
  3. 103
  4. 104
  5. 105

    Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics by Paolo Cifani (1575613)

    Published 2021
    “…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”
  6. 106

    Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics by Paolo Cifani (1575613)

    Published 2021
    “…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”
  7. 107
  8. 108

    The ALO algorithm optimization flowchart. by Wenjing Wang (181404)

    Published 2024
    “…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
  9. 109

    The IALO algorithm solution flowchart. by Wenjing Wang (181404)

    Published 2024
    “…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
  10. 110
  11. 111
  12. 112

    Algorithm of the main experiment targeted to measure the perceptual point spread function (pPSF) treating patients visual system including its optics, physiology and psychology as an integrated imaging system, and patient’s perceptions as its output signal. by Krzysztof Petelczyc (3954203)

    Published 2024
    “…<p>In the algorithm, the following variables were used: “Ic” denotes the intensity of the central diode (Ic = 40 cd); “DIST(i)” is a randomly sorted list of “D” angular stimuli positions distributed equally as a function of distance from 0.24° to 7.67° from the central point (D = 10), while “i” is an index corresponding to the current distance of a probe diode (“d”); “N” denotes the number of trials for each stimuli position (N = 20); “s” denotes the perceptual brightness value transformed to diode luminous intensity by an array “I(s)” corresponds to the table “scale (level)” determined by the algorithm presented in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0306331#pone.0306331.g003" target="_blank">Fig 3</a>; “cnt” is a counter of trials for the current probe diode’s distance, array threshold (d), and slope (d), i.e., it denotes the intensity of the single point of the pPSF and its uncertainty. …”
  13. 113

    Benchmarking functions. by Guilin Yang (583364)

    Published 2024
    “…Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. …”
  14. 114
  15. 115
  16. 116

    Revisiting the “satisfaction of spatial restraints” approach of MODELLER for protein homology modeling by Giacomo Janson (8138517)

    Published 2019
    “…This program implements the “modeling by satisfaction of spatial restraints” strategy and its core algorithm has not been altered significantly since the early 1990s. …”
  17. 117

    Efficient algorithms to discover alterations with complementary functional association in cancer by Rebecca Sarto Basso (6728921)

    Published 2019
    “…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”
  18. 118
  19. 119
  20. 120