نتایج جستجو برای: direct labeling

تعداد نتایج: 479609  

Journal: :Nucleic acids research 2004
Kyle Cole Vivi Truong Dale Barone Glenn McGall

Direct labeling of RNA is an expedient method for labeling large quantities (e.g. micrograms) of target RNA for microarray analysis. We have developed an efficient labeling system that uses T4 RNA ligase to attach a 3'-biotinylated donor molecule to target RNA. Microarray analyses indicate that directly labeled RNA is uniformly labeled, has higher signal intensity than comparable labeling metho...

Journal: :journal of agricultural science and technology 2013
r. changizi h. farahmand m. soltani f. darvish a. elmdoost

this study pursued the molecular identification of fish species from processed products for human consumption which, a priori, belonged to nine species. dna barcoding using direct sequencing of about 650 bp of the mitochondrial gene cytochrome oxidase subunit i (coi) revealed incorrect labeling in the three alaska pollack samples (11% of all samples). substitution of fish species constitutes se...

Journal: :journal of algorithms and computation 0
r. vasuki department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india s. suganthi department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india g. pooranam department of mathematics, dr. sivanthi aditanar college of engineering, tiruchendur-628 215, tamil nadu, india

let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defi ned by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...

Journal: :Nuclear Medicine and Molecular Imaging 2015

Journal: :Proceedings of the National Academy of Sciences 2009

Journal: :journal of algorithms and computation 0
sarah minion department of mathematics, clayton state university, morrow, georgia 30260, usa christian barrientos department of mathematics, clayton state university, morrow, georgia 30260, usa

a graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ e(g)} consists of n integers. inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of g and k2 , and the disjoint :union: of g...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید