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

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

Journal: :Chemical communications 2010
Po Wang Zhibin Mai Zong Dai Xiaoyong Zou

A rapid, convenient and accurate method for the assessment of DNA methylation status is presented based on the direct electrocatalytic oxidation of DNA bases without any bisulfite conversion, PCR amplification or labeling procedures.

Journal: :Chemical communications 2013
Kyoungsook Park Juyeon Jung Jieun Son So Hyun Kim Bong Hyun Chung

A simple, rapid, and efficient live cell surface labeling method has been developed that uses a direct conjugation between Sortase A expressed transiently at the cell surface and Sortase A specific binding peptide.

Journal: :bulletin of the iranian mathematical society 2013
ch. adiga c. k. subbaraya a. s. shrikanth m. a. sriraj

let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

1999
Gunnar W. Klau Petra Mutzel

Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering. We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in...

Journal: :transactions on combinatorics 2015
b. gayathri k. amuthavalli

‎a $(p‎,‎q)$ graph $g$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎v‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $e$ by $f^*(uv) =‎ ‎leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a‎ ‎bijection from $e$ to ${2k - ‎‎‎1‎, ‎2k‎ + ‎1‎, ‎2k‎ + ‎3‎, ‎ldots‎, ‎2‎ ‎k‎ + ‎2q‎ - ‎3}$‎. ‎a graph that admits $k$...

Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...

Journal: :Yakugaku zasshi : Journal of the Pharmaceutical Society of Japan 2007
Yutaka Sadakane

Photoaffinity labeling enables the direct probing of a target protein through a covalent bond between a ligand and its binding protein. We used carbene-generating phenyldiazirine as a photophore because practical examinations had shown that the phenyldiazirine functioned as the powerful barb on the hook. This review describes improvements of synthetic strategies of the photoaffinity ligands bea...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1982
S Eriksson I W Caras D W Martin

The protein M1 subunit of ribonucleotide reductase contains at least two allosteric nucleotide binding sites that control the capacity of the enzyme to reduce ribonucleotides to the deoxyribonucleotides required for DNA synthesis. Direct photoaffinity labeling of partially purified protein M1 from mouse T-lymphoma (S49) cells was observed after UV irradiation in the presence of dTTP at 0 degree...

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

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