Targeting of DNA polymerase to the adenovirus origin of DNA replication by interaction with nuclear factor I.

Efficient initiation by the DNA polymerase of adenovirus type 2 requires nuclear factor I (NFI), a cellular sequence-specific transcription factor. Three functions of NFI--dimerization, DNA binding, and activation of DNA replication--are colocalized within the N-terminal portion of the protein. To define more precisely the role of NFI in viral DNA replication, a series of site-directed mutations within the N-terminal domain have been generated, thus allowing the separation of all three functions contained within this region. Impairment of the dimerization function prevents sequence-specific DNA binding and in turn abolishes the NFI-mediated activation of DNA replication. NFI DNA-binding activity, although necessary, is not sufficient to activate the initiation of adenovirus replication. A distinct class of NFI mutations that abolish the recruitment of the viral DNA polymerase to the origin also prevent the activation of replication. Thus, a direct interaction of NFI with the viral DNA polymerase complex is required to form a stable and active preinitiation complex on the origin and is responsible for the activation of replication by NFI.

Clinical, polysomnographic and genome-wide association analyses of narcolepsy with cataplexy: a European Narcolepsy Network study.

The aim of this study was to describe the clinical and PSG characteristics of narcolepsy with cataplexy and their genetic predisposition by using the retrospective patient database of the European Narcolepsy Network (EU-NN). We have analysed retrospective data of 1099 patients with narcolepsy diagnosed according to International Classification of Sleep Disorders-2. Demographic and clinical characteristics, polysomnography and multiple sleep latency test data, hypocretin-1 levels, and genome-wide genotypes were available. We found a significantly lower age at sleepiness onset (men versus women: 23.74 ± 12.43 versus 21.49 ± 11.83, P = 0.003) and longer diagnostic delay in women (men versus women: 13.82 ± 13.79 versus 15.62 ± 14.94, P = 0.044). The mean diagnostic delay was 14.63 ± 14.31 years, and longer delay was associated with higher body mass index. The best predictors of short diagnostic delay were young age at diagnosis, cataplexy as the first symptom and higher frequency of cataplexy attacks. The mean multiple sleep latency negatively correlated with Epworth Sleepiness Scale (ESS) and with the number of sleep-onset rapid eye movement periods (SOREMPs), but none of the polysomnographic variables was associated with subjective or objective measures of sleepiness. Variant rs2859998 in UBXN2B gene showed a strong association (P = 1.28E-07) with the age at onset of excessive daytime sleepiness, and rs12425451 near the transcription factor TEAD4 (P = 1.97E-07) with the age at onset of cataplexy. Altogether, our results indicate that the diagnostic delay remains extremely long, age and gender substantially affect symptoms, and that a genetic predisposition affects the age at onset of symptoms.

ParA2, a Vibrio cholerae chromosome partitioning protein, forms left-handed helical filaments on DNA.

Most bacterial chromosomes contain homologs of plasmid partitioning (par) loci. These loci encode ATPases called ParA that are thought to contribute to the mechanical force required for chromosome and plasmid segregation. In Vibrio cholerae, the chromosome II (chrII) par locus is essential for chrII segregation. Here, we found that purified ParA2 had ATPase activities comparable to other ParA homologs, but, unlike many other ParA homologs, did not form high molecular weight complexes in the presence of ATP alone. Instead, formation of high molecular weight ParA2 polymers required DNA. Electron microscopy and three-dimensional reconstruction revealed that ParA2 formed bipolar helical filaments on double-stranded DNA in a sequence-independent manner. These filaments had a distinct change in pitch when ParA2 was polymerized in the presence of ATP versus in the absence of a nucleotide cofactor. Fitting a crystal structure of a ParA protein into our filament reconstruction showed how a dimer of ParA2 binds the DNA. The filaments formed with ATP are left-handed, but surprisingly these filaments exert no topological changes on the right-handed B-DNA to which they are bound. The stoichiometry of binding is one dimer for every eight base pairs, and this determines the geometry of the ParA2 filaments with 4.4 dimers per 120 A pitch left-handed turn. Our findings will be critical for understanding how ParA proteins function in plasmid and chromosome segregation.

Iowa Communications Network Performance Report, FY 2007

Agency Performance Report

PhD Students’ Research Group Social Capital in Two Countries: A Clustering Approach with Duocentred Network Measures

The article examines the structure of the collaboration networks of research groups where Slovenian and Spanish PhD students are pursuing their doctorate. The units of analysis are student-supervisor dyads. We use duocentred networks, a novel network structure appropriate for networks which are centred around a dyad. A cluster analysis reveals three typical clusters of research groups. Those which are large and belong to several institutions are labelled under a bridging social capital label. Those which are small, centred in a single institution but have high cohesion are labelled as bonding social capital. Those which are small and with low cohesion are called weak social capital groups. Academic performance of both PhD students and supervisors are highest in bridging groups and lowest in weak groups. Other variables are also found to differ according to the type of research group. At the end, some recommendations regarding academic and research policy are drawn

GacA-controlled activation of promoters for small RNA genes in Pseudomonas fluorescens.

The Gac/Rsm signal transduction pathway positively regulates secondary metabolism, production of extracellular enzymes, and biocontrol properties of Pseudomonas fluorescens CHA0 via the expression of three noncoding small RNAs, termed RsmX, RsmY, and RsmZ. The architecture and function of the rsmY and rsmZ promoters were studied in vivo. A conserved palindromic upstream activating sequence (UAS) was found to be necessary but not sufficient for rsmY and rsmZ expression and for activation by the response regulator GacA. A poorly conserved linker region located between the UAS and the -10 promoter sequence was also essential for GacA-dependent rsmY and rsmZ expression, suggesting a need for auxiliary transcription factors. One such factor involved in the activation of the rsmZ promoter was identified as the PsrA protein, previously recognized as an activator of the rpoS gene and a repressor of fatty acid degradation. Furthermore, the integration host factor (IHF) protein was found to bind with high affinity to the rsmZ promoter region in vitro, suggesting that DNA bending contributes to the regulated expression of rsmZ. In an rsmXYZ triple mutant, the expression of rsmY and rsmZ was elevated above that found in the wild type. This negative feedback loop appears to involve the translational regulators RsmA and RsmE, whose activity is antagonized by RsmXYZ, and several hypothetical DNA-binding proteins. This highly complex network controls the expression of the three small RNAs in response to cell physiology and cell population densities.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

Abnormal cortical network activation in human amnesia: A high-resolution evoked potential study.

Little is known about how human amnesia affects the activation of cortical networks during memory processing. In this study, we recorded high-density evoked potentials in 12 healthy control subjects and 11 amnesic patients with various types of brain damage affecting the medial temporal lobes, diencephalic structures, or both. Subjects performed a continuous recognition task composed of meaningful designs. Using whole-scalp spatiotemporal mapping techniques, we found that, during the first 200 ms following picture presentation, map configuration of amnesics and controls were indistinguishable. Beyond this period, processing significantly differed. Between 200 and 350 ms, amnesic patients expressed different topographical maps than controls in response to new and repeated pictures. From 350 to 550 ms, healthy subjects showed modulation of the same maps in response to new and repeated items. In amnesics, by contrast, presentation of repeated items induced different maps, indicating distinct cortical processing of new and old information. The study indicates that cortical mechanisms underlying memory formation and re-activation in amnesia fundamentally differ from normal memory processing.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

Diabetes mellitus and cancer risk in a network of case-control studies.

Diabetes has been associated to the risk of a few cancer sites, though quantification of this association in various populations remains open to discussion. We analyzed the relation between diabetes and the risk of various cancers in an integrated series of case-control studies conducted in Italy and Switzerland between 1991 and 2009. The studies included 1,468 oral and pharyngeal, 505 esophageal, 230 gastric, 2,390 colorectal, 185 liver, 326 pancreatic, 852 laryngeal, 3,034 breast, 607 endometrial, 1,031 ovarian, 1,294 prostate, and 767 renal cell cancer cases and 12,060 hospital controls. The multivariate odds ratios (OR) for subjects with diabetes as compared to those without-adjusted for major identified confounding factors for the cancers considered through logistic regression models-were significantly elevated for cancers of the oral cavity/pharynx (OR = 1.58), esophagus (OR = 2.52), colorectum (OR = 1.23), liver (OR = 3.52), pancreas (OR = 3.32), postmenopausal breast (OR = 1.76), and endometrium (OR = 1.70). For cancers of the oral cavity, esophagus, colorectum, liver, and postmenopausal breast, the excess risk persisted over 10 yr since diagnosis of diabetes. Our data confirm and further quantify the association of diabetes with colorectal, liver, pancreatic, postmenopausal breast, and endometrial cancer and suggest forthe first time that diabetes may also increase the risk of oral/pharyngeal and esophageal cancer. [Table: see text] [Table: see text].

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.