To the Editors: Robust and reversible biomarkers are needed for the successful completion of phase II prevention trials, an area where Fabian and colleagues have made enormous contributions. One potential marker is cell proliferation, measured by Ki-67 labeling; Khan et al. present data obtained by random periareolar fine-needle aspiration in 147 women at high-risk, which they interpret as prov...

A rapid autoradiographic technique for measuring the [3H]thymidine-labeling index of human solid tumors has been adapted to assess the effect of anticancer drugs in vitro. The drugs tested were present unchanged or as metabolites in serum obtained from patients immediately post-treatment. In 15 patients, the drugs tested in vitro were also given in vivo. Tumor-labeling index fell significantly ...

Centrifugal elutriation was used to separate human acute leukemia cells into proliferative and quiescent subpopulations. Ten bone marrow specimens and 5 peripheral blood specimens were subjected to centrifugal elutriations. From each patient, leukemic cell subpopulations were obtained for which the [3H]thymidine labeling index differed by 10- to 30-fold. In 6 of the marrow specimens and in 2 of...

Any vertex labeling f : V → {0, 1} of the graph G = (V,E) induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) if and only if f(u) = f(v). The balance index set of G is defined as {|f ∗−1(0)− f ∗−1(1)| ∣∣ |f−1(0) − f−1(1)| ≤ 1}. In this paper, we propose a new and easier approach to find the balance index set of a graph. This new method makes it possible to determine the b...

The labeling index was estimated in human tumor biop sies with a new method in which antinucleoside antibody and immunoperoxidase staining are used. Excellent agree ment of the [3H]thymidine autoradiography labeling index and the antinucleoside immunoreactivity labeling index was obtained in cell aspirates from solid tumor and fluid specimens taken before radiation or chemotherapy as well as in...

Let G be a graph with vertex set V(G) and edge set E(G), and let A be an abelian group. A labeling f : V(G) ....... A induces a edge labeling r : E{G) ....... A defined by r(xy) = f(x) + f(y) for each xy E E. For each i E A, let vJ(i) card{v E V(G) : f(v) i} and eJ(i) card{e E E(G) : r(e) i}. Let c(J) {leJ(i) eJ(j)1 : = = (i,j) E A x A}. A labeling f of a graph G is said to be A-friendly if IVJ...