Results 121 to 130 of about 2,699,353 (198)

Primer design through submodular function estimation. [PDF]

open access: yesBioinformatics
Chen Y   +6 more
europepmc   +1 more source

Which submodular functions are expressible using binary submodular functions?

open access: yes, 2016
Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been devised to minimise such functions. The time complexity of the fastest known general algorithm for submodular function minimisation (SFM) is O(n^6+n^5L), where n is the number of variables and L is the time required to evaluate ...
Živný, S, Jeavons, P
openaire   +2 more sources

Budget-Aware Routing for Long Clinical Text. [PDF]

open access: yesFind ACL ACL
Qureshi K, Martin G, Peng Y.
europepmc   +1 more source

Link-based influence maximization in networks of health promotion professionals. [PDF]

open access: yesPLoS One, 2021
Oostenbroek MHW   +4 more
europepmc   +1 more source

Probing transcription factor subsets in gene regulatory networks. [PDF]

open access: yesAlgorithms Mol Biol
Geis L   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy