نتایج جستجو برای: poly o anisidine
تعداد نتایج: 629789 فیلتر نتایج به سال:
margarine contains a higher level of unsaturated and trans-fatty acids (tfa) than butter. the aim of this study was to investigate the physicochemical properties of these products in iranian market during storage. physicochemical analyses included fatty acid composition, peroxide and anisidine values, slip melting point (smp), color, chlorophyll content, solid fat content (sfc) and texture anal...
Antiviral activity of polynucleotides: poly 2′-o-ethyladenylic acid and poly 2′-o-ethyluridylic acid
The title europium(III) carboxyl-ate, [Eu(3)(C(8)H(7)O(2))(9)](n), has three independent Eu atoms, two of which are eight-coordinate in a square-anti-prismatic coordination geometry, whereas the third is nine-coordinate in a tricapped trigonal-prismatic coordination geometry. The metal atoms are linked by two bidentate and seven tridentate methyl-benzoate groups into a linear chain running alon...
Immune attri t ion may occur in association with severe chronic infections and neoplastic diseases (1). Mechanisms o f immunodeficiency in these disorders have not been elucidated precisely. During inf lammatory states, activated neutrophils release toxic oxygen species into the extracellular envi ronment (2). T h e oxygen products can damage the DNA of adjacent cells (3). T h e accumulation of...
The Sp diastereomer of thymidine 5'-O-(1-thiotriphosphate) was polymerized by avian myeloblastosis virus reverse transcriptase using poly(A) . d(pT)10 as template-primer. Degradation of the template poly(A) by alkaline hydrolysis and isolation by gel chromatography gave a single-stranded poly(d(p(S)T)), a polymer of thymidine 5'-phosphorothioate. To determine the configuration of the phosphorot...
For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(n k). We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.
At present, most of the important computational problems—be they decision, search, or optimization problems—are known to satisfy one of the following two criteria: 1. The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small enough to guarantee that the problem can be tackled efficiently in practice. In particular, the decision ve...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید