1,919 research outputs found

    Slow nucleic acid unzipping kinetics from sequence-defined barriers

    Full text link
    Recent experiments on unzipping of RNA helix-loop structures by force have shown that about 40-base molecules can undergo kinetic transitions between two well-defined `open' and `closed' states, on a timescale = 1 sec [Liphardt et al., Science 297, 733-737 (2001)]. Using a simple dynamical model, we show that these phenomena result from the slow kinetics of crossing large free energy barriers which separate the open and closed conformations. The dependence of barriers on sequence along the helix, and on the size of the loop(s) is analyzed. Some DNAs and RNAs sequences that could show dynamics on different time scales, or three(or more)-state unzipping, are proposed.Comment: 8 pages Revtex, including 4 figure

    Unzipping Dynamics of Long DNAs

    Full text link
    The two strands of the DNA double helix can be `unzipped' by application of 15 pN force. We analyze the dynamics of unzipping and rezipping, for the case where the molecule ends are separated and re-approached at constant velocity. For unzipping of 50 kilobase DNAs at less than about 1000 bases per second, thermal equilibrium-based theory applies. However, for higher unzipping velocities, rotational viscous drag creates a buildup of elastic torque to levels above kBT in the dsDNA region, causing the unzipping force to be well above or well below the equilibrium unzipping force during respectively unzipping and rezipping, in accord with recent experimental results of Thomen et al. [Phys. Rev. Lett. 88, 248102 (2002)]. Our analysis includes the effect of sequence on unzipping and rezipping, and the transient delay in buildup of the unzipping force due to the approach to the steady state.Comment: 15 pages Revtex file including 9 figure

    Investing Retirement Wealth: A Life-Cycle Model

    Get PDF
    If household portfolios are constrained by borrowing and short-sales restrictions asset markets, then alternative retirement savings systems may affect household welfare by relaxing these constraints. This paper uses a calibrated partial-equilibrium model of optimal life-cycle portfolio choice to explore the empirical relevance of these issues. In a benchmark case, we find ex-ante welfare gains equivalent to a 3.7% increase in consumption from the investment of half of retirement wealth in the equity market. The main channel through which these gains are realized is that the higher average return on equities permits a lower Social Security tax rate on younger households, which helps households smooth their consumption over the life cycle. There is a smaller welfare gain of 0.5% of consumption when Social Security tax rates are held constant. We also find that realistic heterogeneity of risk aversion and labor income risk can strongly affect optimal portfolio choice over the life cycle, which provides one argument for a privatized Social Security system with an element of personal portfolio choice.

    Low energy neutrino scattering measurements at future Spallation Source facilities

    Full text link
    In the future several Spallation Source facilities will be available worldwide. Spallation Sources produce large amount of neutrinos from decay-at-rest muons and thus can be well adapted to accommodate state-of-the-art neutrino experiments. In this paper low energy neutrino scattering experiments that can be performed at such facilities are reviewed. Estimation of expected event rates are given for several nuclei, electrons and protons at a detector located close to the source. A neutrino program at Spallation Sources comprises neutrino-nucleus cross section measurements relevant for neutrino and core-collapse supernova physics, electroweak tests and lepton-flavor violation searches.Comment: 12 pages, 4 figures, 5 table

    The dynamics of proving uncolourability of large random graphs I. Symmetric Colouring Heuristic

    Full text link
    We study the dynamics of a backtracking procedure capable of proving uncolourability of graphs, and calculate its average running time T for sparse random graphs, as a function of the average degree c and the number of vertices N. The analysis is carried out by mapping the history of the search process onto an out-of-equilibrium (multi-dimensional) surface growth problem. The growth exponent of the average running time is quantitatively predicted, in agreement with simulations.Comment: 5 figure

    Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms

    Full text link
    Stochastic local search algorithms are frequently used to numerically solve hard combinatorial optimization or decision problems. We give numerical and approximate analytical descriptions of the dynamics of such algorithms applied to random satisfiability problems. We find two different dynamical regimes, depending on the number of constraints per variable: For low constraintness, the problems are solved efficiently, i.e. in linear time. For higher constraintness, the solution times become exponential. We observe that the dynamical behavior is characterized by a fast equilibration and fluctuations around this equilibrium. If the algorithm runs long enough, an exponentially rare fluctuation towards a solution appears.Comment: 21 pages, 18 figures, revised version, to app. in PRE (2003

    Beyond inverse Ising model: structure of the analytical solution for a class of inverse problems

    Full text link
    I consider the problem of deriving couplings of a statistical model from measured correlations, a task which generalizes the well-known inverse Ising problem. After reminding that such problem can be mapped on the one of expressing the entropy of a system as a function of its corresponding observables, I show the conditions under which this can be done without resorting to iterative algorithms. I find that inverse problems are local (the inverse Fisher information is sparse) whenever the corresponding models have a factorized form, and the entropy can be split in a sum of small cluster contributions. I illustrate these ideas through two examples (the Ising model on a tree and the one-dimensional periodic chain with arbitrary order interaction) and support the results with numerical simulations. The extension of these methods to more general scenarios is finally discussed.Comment: 15 pages, 6 figure

    Heart applications of 4D flow

    Get PDF
    Four-dimensional (4D) flow sequences are an innovative type of MR sequences based upon phase contrast (PC) sequences which are a type of application of Angio-MRI together with the Time of Flight (TOF) sequences and Contrast-Enhanced Magnetic Resonance Acquisition (CE-MRA). They share the basic principles of PC, but unlike PC sequences, 4D flow has velocity encoding along all three flow directions and three-dimensional (3D) anatomic coverage. They guarantee the analysis of flow with multiplanarity on a post-processing level, which is a unique feature among MR sequences. Furthermore, this technique provides a completely new level to the in vivo flow analysis as it allows measurements in never studied districts such as intracranial applications or some parts of the heart never studied with echo-color-doppler, which is its sonographic equivalent. Furthermore, this technique provides a completely new level to the in vivo flow analysis as it allows accurate measurement of the flows in different districts (e.g., intracranial, cardiac) that are usually studied with echo-color-doppler, which is its sonographic equivalent. Of note, the technique has proved to be affected by less inter and intra-observer variability in several application. 4D-flow basic principles, advantages, limitations, common pitfalls and artefacts are described. This review will outline the basis of the formation of PC image, the construction of a 4D-flow and the huge impact the technique is having on the cardiovascular non-invasive examination. It will be then studied how this technique has had a huge impact on cardiovascular examinations especially on a central heart level
    corecore