نتایج جستجو برای: labeling index
تعداد نتایج: 450923 فیلتر نتایج به سال:
Cell proliferation in prostate cancer patients with lymph node metastasis: a marker for progression.
The biological aggressiveness of lymph node-positive prostate cancer is closely linked to cancer volume in nodal metastases. We evaluated MIB-1 (Ki-67) labeling index and bcl-2 expression in primary cancer and matched nodal metastases from 138 node-positive patients treated with radical prostatectomy and bilateral pelvic lymphadenectomy between 1987 and 1992 at the Mayo Clinic. One hundred twen...
For a graph G = (V,E) and a binary labeling f : V (G) → Z2, let vf (i) = |f−1(i)|. The labling f is said to be friendly if |vf (1)−vf (0)| ≤ 1. Any vertex labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)|. Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly verte...
Italico rats were injected with thymidine-(3)H 6 hr after the end of 300 hr of intermittent cold treatment. This plan of experiment ensured replacement in the adrenal medulla of lost DNA which is specifically sensitive to cold treatment and has a labeling index sufficiently high for statistical evaluation. The labeling index in the adrenal medulla decreases to one-half of the initial value with...
Cell suspensions of tumor or normal bone marrow were incubated in vitro with control media (supplemented Ham's F-10 medium or autologous, pretreatment plasma) and with autologous, posttreatment plasma containing chemotherapeutic agents or their metabolites (treated plasma). Drug-specific perturbation of tumor cell DNA synthesis, as measured by the thymidine labeling index, occurred in treated p...
Let G = (V,E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f : E → Z2 defined by f(xy) = f(x) + f(y) for each xy ∈ E. For i ∈ Z2, let vf (i) = |f−1(i)| and ef(i) = |(f+)−1(i)|. A labeling f is called friendly if |vf (1) − vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = ef (1) − ef(0). The set {if(G) | f is a...
Rectal mucosal proliferation has been shown to be increased in patients with neoplastic lesions of the large bowel and may serve as a marker of risk for colorectal malignancy. We conducted analyses to determine reliability and components of variability that might suggest optimal analysis strategies for studies of proliferation. Endoscopic pinch biopsies were obtained from 17 adult patients, lab...
For a graph G = (V,E) and a binary labeling (coloring) f : V (G) → Z2, let vf (i) = |f−1(i)|. f is said to be friendly if |vf (1) − vf (0)| ≤ 1. The labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)| ∀xy ∈ E(G). Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly ...
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} defined 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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید