Fully fault tolerant quantum computation with non-deterministic gates

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded, meanwhile the rate of unknown errors should not exceed 2 in 10^4 operations.Comment: 5 pages, 3 fig

On the existence of impurity bound excitons in one-dimensional systems with zero range interactions

We consider a three-body one-dimensional Schr\"odinger operator with zero range potentials, which models a positive impurity with charge $\kappa > 0$ interacting with an exciton. We study the existence of discrete eigenvalues as $\kappa$ is varied. On one hand, we show that for sufficiently small $\kappa$ there exists a unique bound state whose binding energy behaves like $\kappa^4$, and we explicitly compute its leading coefficient. On the other hand, if $\kappa$ is larger than some critical value then the system has no bound states

Uniqueness of Lagrangian Self-Expanders

We show that zero-Maslov class Lagrangian self-expanders in C^n which are asymptotic to a pair of planes intersecting transversely are locally unique if n>2 and unique if n=2.Comment: 32 page

Oncogenic K-Ras suppresses IP₃-dependent Ca²⁺ release through remodeling of IP₃Rs isoform composition and ER luminal Ca²⁺ levels in colorectal cancer cell lines

The GTPase Ras is a molecular switch engaged downstream of G-protein coupled receptors and receptor tyrosine inases that controls multiple cell fate-determining signalling athways. Ras signalling is frequently deregulated in cancer underlying associated changes in cell phenotype. Although Ca2+ signalling pathways control some overlapping functions with Ras, and altered Ca2+ signalling pathways are emerging as important players in oncogenic transformation, how Ca2+ signalling is remodelled during transformation and whether it has a causal role remains unclear. We have investigated Ca2+ signalling in two human colorectal cancer cell lines and their isogenic derivatives in which the mutated K-Ras allele (G13D) has been deleted by homologous recombination. We show that agonist-induced Ca2+ release from intracellular stores is enhanced by loss of K-RasG13D through an increase in the ER store content and a modification of IP3R subtype abundance. Consistently, uptake of Ca2+ into mitochondria and sensitivity to apoptosis was enhanced as a result of KRasG13D loss. These results suggest that suppression of Ca2+ signalling is a common response to naturally occurring levels of K-RasG13D that contributes to a survival advantage during oncogenic transformation

BamView: visualizing and interpretation of next-generation sequencing read alignments.

So-called next-generation sequencing (NGS) has provided the ability to sequence on a massive scale at low cost, enabling biologists to perform powerful experiments and gain insight into biological processes. BamView has been developed to visualize and analyse sequence reads from NGS platforms, which have been aligned to a reference sequence. It is a desktop application for browsing the aligned or mapped reads [Ruffalo, M, LaFramboise, T, Koyutürk, M. Comparative analysis of algorithms for next-generation sequencing read alignment. Bioinformatics 2011;27:2790-6] at different levels of magnification, from nucleotide level, where the base qualities can be seen, to genome or chromosome level where overall coverage is shown. To enable in-depth investigation of NGS data, various views are provided that can be configured to highlight interesting aspects of the data. Multiple read alignment files can be overlaid to compare results from different experiments, and filters can be applied to facilitate the interpretation of the aligned reads. As well as being a standalone application it can be used as an integrated part of the Artemis genome browser, BamView allows the user to study NGS data in the context of the sequence and annotation of the reference genome. Single nucleotide polymorphism (SNP) density and candidate SNP sites can be highlighted and investigated, and read-pair information can be used to discover large structural insertions and deletions. The application will also calculate simple analyses of the read mapping, including reporting the read counts and reads per kilobase per million mapped reads (RPKM) for genes selected by the user

Circlator: automated circularization of genome assemblies using long sequencing reads

The assembly of DNA sequence data is undergoing a renaissance thanks to emerging technologies capable of producing reads tens of kilobases long. Assembling complete bacterial and small eukaryotic genomes is now possible, but the final step of circularizing sequences remains unsolved. Here we present Circlator, the first tool to automate assembly circularization and produce accurate linear representations of circular sequences. Using Pacific Biosciences and Oxford Nanopore data, Circlator correctly circularized 26 of 27 circularizable sequences, comprising 11 chromosomes and 12 plasmids from bacteria, the apicoplast and mitochondrion of Plasmodium falciparum and a human mitochondrion. Circlator is available at http://sanger-pathogens.github.io/circlator/

From single steps to mass migration: the problem of scale in the movement ecology of the Serengeti wildebeest

A central question in ecology is how to link processes that occur over different scales. The daily interactions of individual organisms ultimately determine community dynamics, population fluctuations and the functioning of entire ecosystems. Observations of these multiscale ecological processes are constrained by various technological, biological or logistical issues, and there are often vast discrepancies between the scale at which observation is possible and the scale of the question of interest. Animal movement is characterized by processes that act over multiple spatial and temporal scales. Second-by-second decisions accumulate to produce annual movement patterns. Individuals influence, and are influenced by, collective movement decisions, which then govern the spatial distribution of populations and the connectivity of meta-populations. While the field of movement ecology is experiencing unprecedented growth in the availability of movement data, there remain challenges in integrating observations with questions of ecological interest. In this article, we present the major challenges of addressing these issues within the context of the Serengeti wildebeest migration, a keystone ecological phenomena that crosses multiple scales of space, time and biological complexity. This article is part of the theme issue ’Collective movement ecology’

Synchronized planarity with applications to constrained planarity problems

We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. Synchronized Planarity then asks whether the graph admits a crossing-free embedding into the plane such that the orders of edges around synchronized vertices are consistent. We show, on the one hand, that Synchronized Planarity can be solved in quadratic time, and, on the other hand, that it serves as a powerful modeling language that lets us easily formulate several constrained planarity problems as instances of Synchronized Planarity. In particular, this lets us solve Clustered Planarity in quadratic time, where the most efficient previously known algorithm has an upper bound of O(n⁸)

Synchronized Planarity with Applications to Constrained Planarity Problems

We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. Synchronized Planarity then asks whether the graph admits a crossing-free embedding into the plane such that the orders of edges around synchronized vertices are consistent. We show, on the one hand, that Synchronized Planarity can be solved in quadratic time, and, on the other hand, that it serves as a powerful modeling language that lets us easily formulate several constrained planarity problems as instances of Synchronized Planarity. In particular, this lets us solve Clustered Planarity in quadratic time, where the most efficient previously known algorithm has an upper bound of $O(n^8)$