@article{1039,
abstract = {Molecular cooling techniques face the hurdle of dissipating translational as well as internal energy in the presence of a rich electronic, vibrational, and rotational energy spectrum. In our experiment, we create a translationally ultracold, dense quantum gas of molecules bound by more than 1000 wave numbers in the electronic ground state. Specifically, we stimulate with 80% efficiency, a two-photon transfer of molecules associated on a Feshbach resonance from a Bose-Einstein condensate of cesium atoms. In the process, the initial loose, long-range electrostatic bond of the Feshbach molecule is coherently transformed into a tight chemical bond. We demonstrate coherence of the transfer in a Ramsey-type experiment and show that the molecular sample is not heated during the transfer. Our results show that the preparation of a quantum gas of molecules in specific rovibrational states is possible and that the creation of a Bose-Einstein condensate of molecules in their rovibronic ground state is within reach.},
author = {Danzl, Johann G and Haller, Elmar and Gustavsson, Mattias and Mark, Manfred and Hart, Russell and Bouloufa, Nadia and Dulieu, Olivier and Ritsch, Helmut and Nägerl, Hanns},
journal = {Science},
number = {5892},
pages = {1062 -- 1066},
publisher = {American Association for the Advancement of Science},
title = {{Quantum gas of deeply bound ground state molecules}},
doi = {10.1126/science.1159909},
volume = {321},
year = {2008},
}
@article{965,
abstract = {We give many examples of applying Bogoliubov's forest formula to iterative solutions of various nonlinear equations. The same formula describes an extremely wide class of objects, from an ordinary quadratic equation to renormalization in quantum field theory.},
author = {Morozov, Alexei Y and Maksym Serbyn},
journal = {Theoretical and Mathematical Physics},
number = {2},
pages = {270 -- 293},
publisher = {Elsevier},
title = {{Nonlinear algebra and Bogoliubov's recursion}},
doi = {10.1007/s11232-008-0026-7},
volume = {154},
year = {2008},
}
@article{3734,
abstract = {Gene expression levels fluctuate even under constant external conditions. Much emphasis has usually been placed on the components of this noise that are due to randomness in transcription and translation. Here we focus on the role of noise associated with the inputs to transcriptional regulation; in particular, we analyze the effects of random arrival times and binding of transcription factors to their target sites along the genome. This contribution to the total noise sets a fundamental physical limit to the reliability of genetic control, and has clear signatures, but we show that these are easily obscured by experimental limitations and even by conventional methods for plotting the variance vs. mean expression level. We argue that simple, universal models of noise dominated by transcription and translation are inconsistent with the embedding of gene expression in a network of regulatory interactions. Analysis of recent experiments on transcriptional control in the early Drosophila embryo shows that these results are quantitatively consistent with the predicted signatures of input noise, and we discuss the experiments needed to test the importance of input noise more generally.},
author = {Gasper Tkacik and Gregor, Thomas and Bialek, William S},
journal = {PLoS One},
number = {7},
publisher = {Public Library of Science},
title = {{The role of input noise in transcriptional regulation}},
doi = {10.1371/journal.pone.0002774},
volume = {3},
year = {2008},
}
@article{3740,
abstract = {In the simplest view of transcriptional regulation, the expression of a gene is turned on or off by changes in the concentration of a transcription factor (TF). We use recent data on noise levels in gene expression to show that it should be possible to transmit much more than just one regulatory bit. Realizing this optimal information capacity would require that the dynamic range of TF concentrations used by the cell, the input/output relation of the regulatory module, and the noise in gene expression satisfy certain matching relations, which we derive. These results provide parameter-free, quantitative predictions connecting independently measurable quantities. Although we have considered only the simplified problem of a single gene responding to a single TF, we find that these predictions are in surprisingly good agreement with recent experiments on the Bicoid/Hunchback system in the early Drosophila embryo and that this system achieves approximately 90% of its theoretical maximum information transmission.},
author = {Gasper Tkacik and Callan,Curtis G and Bialek, William S},
journal = {PNAS},
number = {34},
pages = {12265 -- 12270},
publisher = {National Academy of Sciences},
title = {{Information flow and optimization in transcriptional regulation}},
doi = {10.1073/pnas.0806077105},
volume = {105},
year = {2008},
}
@article{3744,
abstract = {It is widely acknowledged that detailed timing of action potentials is used to encode information, for example, in auditory pathways; however, the computational tools required to analyze encoding through timing are still in their infancy. We present a simple example of encoding, based on a recent model of time-frequency analysis, in which units fire action potentials when a certain condition is met, but the timing of the action potential depends also on other features of the stimulus. We show that, as a result, spike-triggered averages are smoothed so much that they do not represent the true features of the encoding. Inspired by this example, we present a simple method, differential reverse correlations, that can separate an analysis of what causes a neuron to spike, and what controls its timing. We analyze with this method the leaky integrate-and-fire neuron and show the method accurately reconstructs the model's kernel.},
author = {Gasper Tkacik and Magnasco, Marcelo O},
journal = {Biosystems},
number = {1-2},
pages = {90 -- 100},
publisher = {Elsevier},
title = {{Decoding spike timing: The differential reverse-correlation method}},
doi = {10.1016/j.biosystems.2008.04.011},
volume = {93},
year = {2008},
}
@article{3751,
abstract = {Revealing the spectrum of combinatorial regulation of transcription at individual promoters is essential for understanding the complex structure of biological networks. However, the computations represented by the integration of various molecular signals at complex promoters are difficult to decipher in the absence of simple cis regulatory codes. Here we synthetically shuffle the regulatory architecture-operator sequences binding activators and repressors-of a canonical bacterial promoter. The resulting library of complex promoters allows for rapid exploration of promoter encoded logic regulation. Among all possible logic functions, NOR and ANDN promoter encoded logics predominate. A simple transcriptional cis regulatory code determines both logics, establishing a straightforward map between promoter structure and logic phenotype. The regulatory code is determined solely by the type of transcriptional regulation combinations: two repressors generate a NOR: NOT (a OR b) whereas a repressor and an activator generate an ANDN: a AND NOT b. Three-input versions of both logics, having an additional repressor as an input, are also present in the library. The resulting complex promoters cover a wide dynamic range of transcriptional strengths. Synthetic promoter shuffling represents a fast and efficient method for exploring the spectrum of complex regulatory functions that can be encoded by complex promoters. From an engineering point of view, synthetic promoter shuffling enables the experimental testing of the functional properties of complex promoters that cannot necessarily be inferred ab initio from the known properties of the individual genetic components. Synthetic promoter shuffling may provide a useful experimental tool for studying naturally occurring promoter shuffling.},
author = {Kinkhabwala, Ali and Guet, Calin C},
journal = {PLoS One},
number = {4},
publisher = {Public Library of Science},
title = {{Uncovering cis regulatory codes using synthetic promoter shuffling}},
doi = {10.1371/journal.pone.0002030},
volume = {3},
year = {2008},
}
@article{3822,
abstract = {Dentate gyrus granule cells transmit action potentials (APs) along their unmyelinated mossy fibre axons to the CA3 region. Although the initiation and propagation of APs are fundamental steps during neural computation, little is known about the site of AP initiation and the speed of propagation in mossy fibre axons. To address these questions, we performed simultaneous somatic and axonal whole-cell recordings from granule cells in acute hippocampal slices of adult mice at approximately 23 degrees C. Injection of short current pulses or synaptic stimulation evoked axonal and somatic APs with similar amplitudes. By contrast, the time course was significantly different, as axonal APs had a higher maximal rate of rise (464 +/- 30 V s(-1) in the axon versus 297 +/- 12 V s(-1) in the soma, mean +/- s.e.m.). Furthermore, analysis of latencies between the axonal and somatic signals showed that APs were initiated in the proximal axon at approximately 20-30 mum distance from the soma, and propagated orthodromically with a velocity of 0.24 m s(-1). Qualitatively similar results were obtained at a recording temperature of approximately 34 degrees C. Modelling of AP propagation in detailed cable models of granule cells suggested that a approximately 4 times higher Na(+) channel density ( approximately 1000 pS mum(-2)) in the axon might account for both the higher rate of rise of axonal APs and the robust AP initiation in the proximal mossy fibre axon. This may be of critical importance to separate dendritic integration of thousands of synaptic inputs from the generation and transmission of a common AP output.},
author = {Schmidt-Hieber, Christoph and Peter Jonas and Bischofberger, Josef},
journal = {Journal of Physiology},
number = {7},
pages = {1849 -- 57},
publisher = {Wiley-Blackwell},
title = {{Action potential initiation and propagation in hippocampal mossy fibre axons}},
doi = {10.1113/jphysiol.2007.150151 },
volume = {586},
year = {2008},
}
@article{3825,
abstract = {Fast-spiking parvalbumin-expressing basket cells (BCs) represent a major type of inhibitory interneuron in the hippocampus. These cells inhibit principal cells in a temporally precise manner and are involved in the generation of network oscillations. Although BCs show a unique expression profile of Ca(2+)-permeable receptors, Ca(2+)-binding proteins and Ca(2+)-dependent signalling molecules, physiological Ca(2+) signalling in these interneurons has not been investigated. To study action potential (AP)-induced dendritic Ca(2+) influx and buffering, we combined whole-cell patch-clamp recordings with ratiometric Ca(2+) imaging from the proximal apical dendrites of rigorously identified BCs in acute slices, using the high-affinity Ca(2+) indicator fura-2 or the low-affinity dye fura-FF. Single APs evoked dendritic Ca(2+) transients with small amplitude. Bursts of APs evoked Ca(2+) transients with amplitudes that increased linearly with AP number. Analysis of Ca(2+) transients under steady-state conditions with different fura-2 concentrations and during loading with 200 microm fura-2 indicated that the endogenous Ca(2+)-binding ratio was approximately 200 (kappa(S) = 202 +/- 26 for the loading experiments). The peak amplitude of the Ca(2+) transients measured directly with 100 microm fura-FF was 39 nm AP(-1). At approximately 23 degrees C, the decay time constant of the Ca(2+) transients was 390 ms, corresponding to an extrusion rate of approximately 600 s(-1). At 34 degrees C, the decay time constant was 203 ms and the corresponding extrusion rate was approximately 1100 s(-1). At both temperatures, continuous theta-burst activity with three to five APs per theta cycle, as occurs in vivo during exploration, led to a moderate increase in the global Ca(2+) concentration that was proportional to AP number, whereas more intense stimulation was required to reach micromolar Ca(2+) concentrations and to shift Ca(2+) signalling into a non-linear regime. In conclusion, dentate gyrus BCs show a high endogenous Ca(2+)-binding ratio, a small AP-induced dendritic Ca(2+) influx, and a relatively slow Ca(2+) extrusion. These specific buffering properties of BCs will sharpen the time course of local Ca(2+) signals, while prolonging the decay of global Ca(2+) signals.},
author = {Aponte, Yexica and Bischofberger, Josef and Peter Jonas},
journal = {Journal of Physiology},
number = {8},
pages = {2061 -- 75},
publisher = {Wiley-Blackwell},
title = {{Efficient Ca(2+) buffering in fast-spiking basket cells of rat hippocampus}},
doi = {10.1113/jphysiol.2007.147298},
volume = {586},
year = {2008},
}
@inproceedings{3878,
abstract = {We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing “reset” action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies.},
author = {Krishnendu Chatterjee and de Alfaro, Luca and Majumdar, Ritankar S},
pages = {91 -- 106},
publisher = {Springer},
title = {{The complexity of coverage}},
doi = {10.1007/978-3-540-89330-1_7},
volume = {5356},
year = {2008},
}
@inproceedings{4384,
abstract = {Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memory. We show that, under certain conditions, the verification problem can be reduced to a finite-state problem, and we illustrate the use of the method by proving the correctness of several STMs, including two-phase locking, DSTM, TL2, and optimistic concurrency control. The safety properties we consider include strict serializability and opacity; the liveness properties include obstruction freedom, livelock freedom, and wait freedom.
Our main contribution lies in the structure of the proofs, which are largely automated and not restricted to the STMs mentioned above. In a first step we show that every STM that enjoys certain structural properties either violates a safety or liveness requirement on some program with two threads and two shared variables, or satisfies the requirement on all programs. In the second step we use a model checker to prove the requirement for the STM applied to a most general program with two threads and two variables. In the safety case, the model checker constructs a simulation relation between two carefully constructed finite-state transition systems, one representing the given STM applied to a most general program, and the other representing a most liberal safe STM applied to the same program. In the liveness case, the model checker analyzes fairness conditions on the given STM transition system.},
author = {Guerraoui, Rachid and Thomas Henzinger and Jobstmann, Barbara and Vasu Singh},
pages = {372 -- 382},
publisher = {ACM},
title = {{Model checking transactional memories}},
doi = {10.1145/1375581.1375626},
year = {2008},
}
@article{3037,
author = {Feraru, Elena and Friml, Jirí},
journal = {Plant Physiology},
number = {4},
pages = {1553 -- 1559},
publisher = {American Society of Plant Biologists},
title = {{PIN polar targeting}},
doi = {10.1104/pp.108.121756},
volume = {147},
year = {2008},
}
@article{3307,
abstract = {A complete mitochondrial (mt) genome sequence was reconstructed from a 38,000 year-old Neandertal individual with 8341 mtDNA sequences identified among 4.8 Gb of DNA generated from ∼0.3 g of bone. Analysis of the assembled sequence unequivocally establishes that the Neandertal mtDNA falls outside the variation of extant human mtDNAs, and allows an estimate of the divergence date between the two mtDNA lineages of 660,000 ± 140,000 years. Of the 13 proteins encoded in the mtDNA, subunit 2 of cytochrome c oxidase of the mitochondrial electron transport chain has experienced the largest number of amino acid substitutions in human ancestors since the separation from Neandertals. There is evidence that purifying selection in the Neandertal mtDNA was reduced compared with other primate lineages, suggesting that the effective population size of Neandertals was small.},
author = {Green, Richard E and Malaspinas, Anna-Sapfo and Krause, Johannes and Briggs, Adrian W and Johnson, Philip L and Caroline Uhler and Meyer, Matthias and Good, Jeffrey M and Maricic, Tomislav and Stenzel, Udo and Prüfer, Kay and Siebauer, Michael F and Burbano, Hernän A and Ronan, Michael T and Rothberg, Jonathan M and Egholm, Michael and Rudan, Pavao and Brajković, Dejana and Kućan, Željko and Gušić, Ivan and Wikström, Mårten K and Laakkonen, Liisa J and Kelso, Janet F and Slatkin, Montgomery and Pääbo, Svante H},
journal = {Cell},
pages = {416 -- 426},
publisher = {Cell Press},
title = {{A complete neandertal mitochondrial genome sequence determined by highhhroughput sequencing}},
doi = {10.1016/j.cell.2008.06.021},
volume = {134},
year = {2008},
}
@article{3435,
abstract = {We develop a new method for estimating effective population sizes, Ne, and selection coefficients, s, from time-series data of allele frequencies sampled from a single diallelic locus. The method is based on calculating transition probabilities, using a numerical solution of the diffusion process, and assuming independent binomial sampling from this diffusion process at each time point. We apply the method in two example applications. First, we estimate selection coefficients acting on the CCR5-Δ32 mutation on the basis of published samples of contemporary and ancient human DNA. We show that the data are compatible with the assumption of s = 0, although moderate amounts of selection acting on this mutation cannot be excluded. In our second example, we estimate the selection coefficient acting on a mutation segregating in an experimental phage population. We show that the selection coefficient acting on this mutation is ~0.43.},
author = {Jonathan Bollback and York, Thomas L and Nielsen, Rasmus},
journal = {Genetics},
number = {1},
pages = {497 -- 502},
publisher = {Genetics Society of America},
title = {{Estimation of 2Nes From Temporal Allele Frequency Data}},
doi = {10.1534/genetics.107.085019},
volume = {179},
year = {2008},
}
@inproceedings{3504,
abstract = {Simulation and bisimulation metrics for stochastic systems provide a quantitative gen- eralization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative μ-calculus and related probabilistic logics.
We present algorithms for computing the metrics on Markov decision processes (MDPs), turn- based stochastic games, and concurrent games. For turn-based games and MDPs, we provide a polynomial-time algorithm based on linear programming for the computation of the one-step metric distance between states. The algorithm improves on the previously known exponential-time algo- rithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known bound for Markov chains. For the bisimulation kernel of the metric, which corresponds to probabilistic bisimulation, our algorithm works in time O(n4) for both turn-based games and MDPs; improving the previously best known O(n9 · log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be accomplished via a reduction to the theory of real closed fields, involving a
formula with three quantifier alternations, yielding O(|G|O(|G|5)) time complexity, improving the previously known reduction with O(|G|O(|G|7)) time complexity. These algorithms can be iterated
to approximate the metrics using binary search.},
author = {Chatterjee, Krishnendu and De Alfaro, Luca and Majumdar, Ritankar and Raman, Vishwanath},
pages = {107 -- 118},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Algorithms for game metrics}},
doi = {10.4230/LIPIcs.FSTTCS.2008.1745},
volume = {2},
year = {2008},
}
@article{9457,
abstract = {Eukaryotic chromatin is separated into functional domains differentiated by posttranslational histone modifications, histone variants, and DNA methylation1–6. Methylation is associated with repression of transcriptional initiation in plants and animals, and is frequently found in transposable elements. Proper methylation patterns are critical for eukaryotic development4,5, and aberrant methylation-induced silencing of tumor suppressor genes is a common feature of human cancer7. In contrast to methylation, the histone variant H2A.Z is preferentially deposited by the Swr1 ATPase complex near 5′ ends of genes where it promotes transcriptional competence8–20. How DNA methylation and H2A.Z influence transcription remains largely unknown. Here we show that in the plant Arabidopsis thaliana, regions of DNA methylation are quantitatively deficient in H2A.Z. Exclusion of H2A.Z is seen at sites of DNA methylation in the bodies of actively transcribed genes and in methylated transposons. Mutation of the MET1 DNA methyltransferase, which causes both losses and gains of DNA methylation4,5, engenders opposite changes in H2A.Z deposition, while mutation of the PIE1 subunit of the Swr1 complex that deposits H2A.Z17 leads to genome-wide hypermethylation. Our findings indicate that DNA methylation can influence chromatin structure and effect gene silencing by excluding H2A.Z, and that H2A.Z protects genes from DNA methylation.},
author = {ZILBERMAN, Daniel and Coleman-Derr, Devin and Ballinger, Tracy and Henikoff, Steven},
issn = {1476-4687},
journal = {Nature},
keywords = {Multidisciplinary},
number = {7218},
pages = {125--129},
publisher = {Springer Nature},
title = {{Histone H2A.Z and DNA methylation are mutually antagonistic chromatin marks}},
doi = {10.1038/nature07324},
volume = {456},
year = {2008},
}
@article{2367,
abstract = {It was recently shown by Hansen that the Wigner-Yanase entropy is, for general states of quantum systems, not subadditive with respect to decomposition into two subsystems, although this property is known to hold for pure states. We investigate the question whether the weaker property of subadditivity for pure states with respect to decomposition into more than two subsystems holds. This property would have interesting applications in quantum chemistry. We show, however, that it does not hold in general, and provide a counterexample.},
author = {Robert Seiringer},
journal = {Letters in Mathematical Physics},
number = {3},
pages = {285 -- 288},
publisher = {Springer},
title = {{On the failure of subadditivity of the Wigner-Yanase entropy}},
doi = {10.1007/s11005-007-0159-x},
volume = {80},
year = {2007},
}
@article{2370,
abstract = {After recalling briefly the connection between spontaneous symmetry breaking and off-diagonal long-range order for models of magnets a general proof of spontaneous breaking of gauge symmetry as a consequence of Bose-Einstein condensation is presented. The proof is based on a rigorous validation of Bogoliubov's c-number substitution for the k = 0 mode operator α0.},
author = {Lieb, Élliott H and Robert Seiringer and Yngvason, Jakob},
journal = {Reports on Mathematical Physics},
number = {3},
pages = {389 -- 399},
publisher = {Elsevier},
title = {{Bose-Einstein condensation and spontaneous symmetry breaking}},
doi = {10.1016/S0034-4877(07)80074-7},
volume = {59},
year = {2007},
}
@article{2371,
abstract = {We give a proof of stability of relativistic matter with magnetic fields all the way up to the critical value of the nuclear charge Zα = 2/π.},
author = {Frank, Rupert L and Lieb, Élliott H and Robert Seiringer},
journal = {Communications in Mathematical Physics},
number = {2},
pages = {479 -- 489},
publisher = {Springer},
title = {{Stability of relativistic matter with magnetic fields for nuclear charges up to the critical value}},
doi = {10.1007/s00220-007-0307-2},
volume = {275},
year = {2007},
}
@article{2372,
abstract = {The increasing interest in the Müller density-matrix-functional theory has led us to a systematic mathematical investigation of its properties. This functional is similar to the Hartree-Fock (HF) functional, but with a modified exchange term in which the square of the density matrix γ(x, x′) is replaced by the square of γ1 2 (x, x′). After an extensive introductory discussion of density-matrix-functional theory we show, among other things, that this functional is convex (unlike the HF functional) and that energy minimizing γ 's have unique densities ρ(r), which is a physically desirable property often absent in HF theory. We show that minimizers exist if N≤Z, and derive various properties of the minimal energy and the corresponding minimizers. We also give a precise statement about the equation for the orbitals of γ, which is more complex than for HF theory. We state some open mathematical questions about the theory together with conjectured solutions.},
author = {Frank, Rupert L and Lieb, Élliott H and Robert Seiringer and Siedentop, Heinz K},
journal = {Physical Review A - Atomic, Molecular, and Optical Physics},
number = {5},
publisher = {American Physical Society},
title = {{Müller's exchange-correlation energy in density-matrix-functional theory}},
doi = {10.1103/PhysRevA.76.052517},
volume = {76},
year = {2007},
}
@article{2373,
abstract = {For the BCS equation with local two-body interaction λV(x), we give a rigorous analysis of the asymptotic behavior of the critical temperature as γ"0. We derive necessary and sufficient conditions onV(x) for the existence of a nontrivial solution for all values of γ>0.},
author = {Frank, Rupert L and Hainzl, Christian and Naboko, Serguei N and Robert Seiringer},
journal = {Journal of Geometric Analysis},
number = {4},
pages = {559 -- 567},
publisher = {Springer},
title = {{The critical temperature for the BCS equation at weak coupling}},
doi = {10.1007/BF02937429},
volume = {17},
year = {2007},
}