LetD be an acyclic orientation of a graphG.An arc ofD is said to be dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs inD. Define dmin(G) (dmax(G)) to be theminimum (maximum) number of d(D) over all acyclic orientationsD ofG.We determine dmin(G) for an outerplanar graph G and prove that G has an acyclic orientation with exactly k dependent arcs if ...

DNA palindromes often colocalize in cancer cells with chromosomal regions that are predisposed to gene amplification. The molecular mechanisms by which palindromes can cause gene amplification are largely unknown. Using yeast as a model system, we found that hairpin-capped double-strand breaks (DSBs) occurring at the location of human Alu-quasipalindromes lead to the formation of intrachromosom...

Acquired multidrug resistance in cultured cells is often due to amplification of pgp genes, which gives rise to overproduction of P-glycoproteins that confer resistance by reducing the intracellular drug accumulation. The size of these amplicons varies between multidrug resistant cell lines and is often much larger than the gene selected for. Amplicons of the multidrug resistant Chinese hamster...

Six independently derived multidrug-resistant Chinese hamster cell lines selected with vincristine, daunorubicin, actinomycin D, or colchicine were probed by in situ hybridization techniques with the cloned cDNA, p5L-18, to chromosomally localize known or presumed amplified P-glycoprotein genes. One or two clusters of amplified genes were demonstrable in all of the highly resistant sublines and...

A new precoding strategy, which considers not only the minimum Euclidean distance but also the number of neighbors providing the distance dmin, is proposed. Firstly, a new parameterized form of Neighbor-dmin precoder is presented, where all angles containing the phase are assumed to be zero to reduce the number of difference vectors providing dmin. The optimization problem is, therefore, less c...

Different users of geospatial information have different requirements of that information. Matching information to users’ requirements demands an understanding of the ontological aspects of geospatial data. In this paper, we present an ontology-driven map generalization algorithm, called DMin, that can be tailored to particular users and users’ tasks. The level of detail in a generated map is a...

In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of “voltage graphs” and “Paley graphs in the Galois field GF (p)”, where p ∈ P and r ∈ Z. The parameters of two new classes of quantum codes are [[(2k + 2)(8k + 7), 2(8k +7k), dmin]] and [[(2k+2)(8k +9), 2(8k +9k +1), dmin]] respectively...