Results 241 to 250 of about 389,835 (287)
Two-stage cluster sampling to assess SARS-CoV-2 seroprevalence without pre-enumeration: An example from Madagascar. [PDF]
Lorenz E +21 more
europepmc +1 more source
Molecular LEGION: incalculably large coverage of chemical space around the NLRP3 target. [PDF]
Zagribelnyy B +11 more
europepmc +1 more source
Circulating tumor cells (CTCs) enumeration and machine-learning based diagnostic biomarkers for breast cancer detection. [PDF]
Liu CY +13 more
europepmc +1 more source
Clinical and translational roles of circulating tumor cells in non-small cell and small cell lung cancer: a narrative review. [PDF]
Liu W +8 more
europepmc +1 more source
Counting Spinal Phylogenetic Networks. [PDF]
Francis A, Hendriksen M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Enumeration Degrees and Enumerability of Familes
Journal of Logic and Computation, 2009We study the enumerability of families relative to the enumeration degrees. It is shown that if a family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable (c.e). On the another hand, we will find a non-c.e. family which is e-reducible to all non-zero e-degree.
openaire +3 more sources
American Journal of Clinical Pathology, 1978
A correlation of the enumeration of platelets in peripheral smears with platelet counts performed by a direct method is presented. A ratio of 1 platelet per oil-immersion field for every 21,000 platelets of the chamber count indicates the normal average range of platelets to be approximately 7--21 per oil-immersion field.
A P, Abbey, R R, Belliveau
openaire +2 more sources
A correlation of the enumeration of platelets in peripheral smears with platelet counts performed by a direct method is presented. A ratio of 1 platelet per oil-immersion field for every 21,000 platelets of the chamber count indicates the normal average range of platelets to be approximately 7--21 per oil-immersion field.
A P, Abbey, R R, Belliveau
openaire +2 more sources
Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Strong Reducibilities of Enumerations and Partial Enumerated Algebras
Mathematical Logic Quarterly, 1988Let \(\nu_ 1\) and \(\nu_ 2\) be two enumerations of a set S and consider the total (respectively, partial) functions from S to S. If all such \(\nu_ 1\)-computable functions are \(\nu_ 2\)-computable and if there is a recursive function that maps each \(\nu_ 1\)-index of a \(\nu_ 1\)- computable function to a \(\nu_ 2\)-index of that function, then \(\
openaire +2 more sources

