GIVE: portable genome browsers for personal websites.

Growing popularity and diversity of genomic data demand portable and versatile genome browsers. Here, we present an open source programming library called GIVE that facilitates the creation of personalized genome browsers without requiring a system administrator. By inserting HTML tags, one can add to a personal webpage interactive visualization of multiple types of genomics data, including genome annotation, "linear" quantitative data, and genome interaction data. GIVE includes a graphical interface called HUG (HTML Universal Generator) that automatically generates HTML code for displaying user chosen data, which can be copy-pasted into user's personal website or saved and shared with collaborators. GIVE is available at: https://www.givengine.org/

Adding control to arbitrary unknown quantum operations

While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control qubits to arbitrary quantum operations-a requirement in many quantum algorithms, simulations and metrology. The technique is independent of how the operation is done, does not require knowledge of what the operation is, and largely separates the problems of how to implement a quantum operation in the laboratory and how to add a control. We demonstrate an entanglement-based version in a photonic system, realizing a range of different two-qubit gates with high fidelity.Comment: 9 pages, 8 figure

The Naming Game in Social Networks: Community Formation and Consensus Engineering

We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.Comment: The original publication is available at http://www.springerlink.com/content/70370l311m1u0ng3

Enhanced Avidity Maturation of Antibody to Human Immunodeficiency Virus Envelope: DNA Vaccination with gp120-C3d Fusion Proteins

DNA vaccination can elicit both humoral and cellular immune responses and can confer protection against several pathogens. However, DNA vaccines expressing the envelope (Env) protein of human immunodeficiency virus (HIV) have been relatively ineffective at generating high titer, long-lasting, neutralizing antibodies in a variety of animal models. In this study, we report that fusion of Env and the complement component, C3d, in a DNA vaccine, enhances the titers of antibody to Env. Plasmids were generated that expressed a secreted form of Env (sgp120) from three isolates of HIV and these same forms fused to three tandem copies of the murine homologue of C3d (sgp120-3C3d). Analyses of titers and avidity maturation of the raised antibody indicated that immunizations with each of the sgp120-3C3d-expressing DNAs accelerated both the onset and the avidity maturation of antibody to Env. Originally published AIDS Research and Human Retroviruses, Vol. 17, No. 9, June 200

Calculating Unknown Eigenvalues with a Quantum Algorithm

Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct the algorithm. We have implemented the complete quantum phase estimation algorithm for a single qubit unitary in which the answer is calculated by the algorithm. We use a new approach to implementing the controlled-unitary operations that lie at the heart of the majority of quantum algorithms that is more efficient and does not require the eigenvalues of the unitary to be known. These results point the way to efficient quantum simulations and quantum metrology applications in the near term, and to factoring large numbers in the longer term. This approach is architecture independent and thus can be used in other physical implementations

Experimental realisation of Shor's quantum factoring algorithm using qubit recycling

Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the international effort to realise a quantum computer. However, due to the substantial resource requirement, to date, there have been only four small-scale demonstrations. Here we address this resource demand and demonstrate a scalable version of Shor's algorithm in which the n qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol. Encoding the work register in higher-dimensional states, we implement a two-photon compiled algorithm to factor N=21. The algorithmic output is distinguishable from noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor's algorithm by harnessing scalable resource reductions applicable to all physical architectures.Comment: 7 pages, 3 figure

Plasmodium knowlesi Genome Sequences from Clinical Isolates Reveal Extensive Genomic Dimorphism.

Plasmodium knowlesi is a newly described zoonosis that causes malaria in the human population that can be severe and fatal. The study of P. knowlesi parasites from human clinical isolates is relatively new and, in order to obtain maximum information from patient sample collections, we explored the possibility of generating P. knowlesi genome sequences from archived clinical isolates. Our patient sample collection consisted of frozen whole blood samples that contained excessive human DNA contamination and, in that form, were not suitable for parasite genome sequencing. We developed a method to reduce the amount of human DNA in the thawed blood samples in preparation for high throughput parasite genome sequencing using Illumina HiSeq and MiSeq sequencing platforms. Seven of fifteen samples processed had sufficiently pure P. knowlesi DNA for whole genome sequencing. The reads were mapped to the P. knowlesi H strain reference genome and an average mapping of 90% was obtained. Genes with low coverage were removed leaving 4623 genes for subsequent analyses. Previously we identified a DNA sequence dimorphism on a small fragment of the P. knowlesi normocyte binding protein xa gene on chromosome 14. We used the genome data to assemble full-length Pknbpxa sequences and discovered that the dimorphism extended along the gene. An in-house algorithm was developed to detect SNP sites co-associating with the dimorphism. More than half of the P. knowlesi genome was dimorphic, involving genes on all chromosomes and suggesting that two distinct types of P. knowlesi infect the human population in Sarawak, Malaysian Borneo. We use P. knowlesi clinical samples to demonstrate that Plasmodium DNA from archived patient samples can produce high quality genome data. We show that analyses, of even small numbers of difficult clinical malaria isolates, can generate comprehensive genomic information that will improve our understanding of malaria parasite diversity and pathobiology

Cytokinesis in bloodstream stage Trypanosoma brucei requires a family of katanins and spastin

Microtubule severing enzymes regulate microtubule dynamics in a wide range of organisms and are implicated in important cell cycle processes such as mitotic spindle assembly and disassembly, chromosome movement and cytokinesis. Here we explore the function of several microtubule severing enzyme homologues, the katanins (KAT80, KAT60a, KAT60b and KAT60c), spastin (SPA) and fidgetin (FID) in the bloodstream stage of the African trypanosome parasite, Trypanosoma brucei. The trypanosome cytoskeleton is microtubule based and remains assembled throughout the cell cycle, necessitating its remodelling during cytokinesis. Using RNA interference to deplete individual proteins, we show that the trypanosome katanin and spastin homologues are non-redundant and essential for bloodstream form proliferation. Further, cell cycle analysis revealed that these proteins play essential but discrete roles in cytokinesis. The KAT60 proteins each appear to be important during the early stages of cytokinesis, while downregulation of KAT80 specifically inhibited furrow ingression and SPA depletion prevented completion of abscission. In contrast, RNA interference of FID did not result in any discernible effects. We propose that the stable microtubule cytoskeleton of T. brucei necessitates the coordinated action of a family of katanins and spastin to bring about the cytoskeletal remodelling necessary to complete cell divisio

Involvement of Noradrenergic Neurotransmission in the Stress- but not Cocaine-Induced Reinstatement of Extinguished Cocaine-Induced Conditioned Place Preference in Mice: Role for β-2 Adrenergic Receptors

The responsiveness of central noradrenergic systems to stressors and cocaine poses norepinephrine as a potential common mechanism through which drug re-exposure and stressful stimuli promote relapse. This study investigated the role of noradrenergic systems in the reinstatement of extinguished cocaine-induced conditioned place preference by cocaine and stress in male C57BL/6 mice. Cocaine- (15 mg/kg, i.p.) induced conditioned place preference was extinguished by repeated exposure to the apparatus in the absence of drug and reestablished by a cocaine challenge (15 mg/kg), exposure to a stressor (6-min forced swim (FS); 20–25°C water), or administration of the α-2 adrenergic receptor (AR) antagonists yohimbine (2 mg/kg, i.p.) or BRL44408 (5, 10 mg/kg, i.p.). To investigate the role of ARs, mice were administered the nonselective β-AR antagonist, propranolol (5, 10 mg/kg, i.p.), the α-1 AR antagonist, prazosin (1, 2 mg/kg, i.p.), or the α-2 AR agonist, clonidine (0.03, 0.3 mg/kg, i.p.) before reinstatement testing. Clonidine, prazosin, and propranolol failed to block cocaine-induced reinstatement. The low (0.03 mg/kg) but not high (0.3 mg/kg) clonidine dose fully blocked FS-induced reinstatement but not reinstatement by yohimbine. Propranolol, but not prazosin, blocked reinstatement by both yohimbine and FS, suggesting the involvement of β-ARs. The β-2 AR antagonist ICI-118551 (1 mg/kg, i.p.), but not the β-1 AR antagonist betaxolol (10 mg/kg, i.p.), also blocked FS-induced reinstatement. These findings suggest that stress-induced reinstatement requires noradrenergic signaling through β-2 ARs and that cocaine-induced reinstatement does not require AR activation, even though stimulation of central noradrenergic neurotransmission is sufficient to reinstate

Experimental measurement-based quantum computing beyond the cluster-state model

The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled universal resource state. For years, clusters states have been the only known universal resources. Surprisingly, a novel framework namely quantum computation in correlation space has opened new routes to implement measurement-based quantum computation based on quantum states possessing entanglement properties different from cluster states. Here we report an experimental demonstration of every building block of such a model. With a four-qubit and a six-qubit state as distinct from cluster states, we have realized a universal set of single-qubit rotations, two-qubit entangling gates and further Deutsch's algorithm. Besides being of fundamental interest, our experiment proves in-principle the feasibility of universal measurement-based quantum computation without using cluster states, which represents a new approach towards the realization of a quantum computer.Comment: 26 pages, final version, comments welcom