Sentence examples for elementary set of from inspiring English sources
To address this challenge, we recently developed a computational methodology that allows us to capture an elementary set of responses that describe the trajectory of systemic inflammation in human blood leukocytes when exposed to endotoxin stimulus [24], [25].
Multiple, intricate DNA methylation machineries mediate and maintain DNA methylation in plants and vertebrates, whereas DNA methylation in Drosophila melanogaster (Drosophila) appears to involve only an elementary set of factors [5], [6], [7].
Although other databases exist that provide information related to intra- and intergenic miRNAs (12 15), some tools don't appear to be frequently updated (14), contain only an elementary set of information related to intragenic miRNAs and their host genes (13 , 15 and/or their usage is complex and requires in-depth bioinformatics skills (12).
(22) Doubtful change region - formed by elementary sets of U ij partially contained in X i or X j.
Negative region of X in A - formed by the elementary sets of U that have no elements in X: text{neg};(X) = U - A_{text{sup}}(X).
(10) Doubtful region of X in A - also called the boundary of X, formed by the elementary sets of U that belong to the upper approximation, but do not belong to the lower approximation.
Besides, based on a rough classification of set X⊆U, we can identify the following regions in approximation space A=(U,R): Positive region of X in A - formed by the union of all elementary sets of U fully contained in X: text{pos}, X) = A_{text{inf}}left(Xright). (9) Negative region of X in A - formed by the elementary sets of U that have no elements in X: text{neg};(X) = U - A_{text{sup}}(X).
Positive region of X in A - formed by the union of all elementary sets of U fully contained in X: text{pos}, X) = A_{text{inf}}left(Xright). (9).
Upper approximation of X in A - formed by the union of all elementary sets of A having a nonempty intersection with X, i.e., the smallest definable set in A containing X: A_{text{sup}}(X) = left{x in U | [x]_{R} cap X neq emptysetright}.
Lower approximation of X in A - formed by the union of all elementary sets of A fully contained in X, i.e., the largest definable set in A contained in X: A_{text{inf}}(X) = left{x in U | [x]_{R} subseteq Xright}.
(7) Upper approximation of X in A - formed by the union of all elementary sets of A having a nonempty intersection with X, i.e., the smallest definable set in A containing X: A_{text{sup}}(X) = left{x in U | [x]_{R} cap X neq emptysetright}.
