The fly Drosophila melanogaster is one of the most intensively studied organisms in biology and serves as a model system for the investigation of many developmental and cellular processes common to higher eukaryotes, including humans. We have determined the nucleotide sequence of nearly all of the approximately 120-megabase euchromatic portion of the… (More)
Collections of nonredundant, full-length complementary DNA (cDNA) clones for each of the model organisms and humans will be important resources for studies of gene structure and function. We describe a general strategy for producing such collections and its implementation, which so far has generated a set of cDNAs corresponding to over 40% of the genes in… (More)
Collisions between galaxy clusters provide a test of the nongravitational forces acting on dark matter. Dark matter's lack of deceleration in the "bullet cluster" collision constrained its self-interaction cross section σ(DM)/m < 1.25 square centimeters per gram (cm(2)/g) [68% confidence limit (CL)] (σ(DM), self-interaction cross section; m, unit mass of… (More)
Artemisinin is a plant natural product produced by Artemisia annua and the active ingredient in the most effective treatment for malaria. Efforts to eradicate malaria are increasing demand for an affordable, high-quality, robust supply of artemisinin. We performed deep sequencing on the transcriptome of A. annua to identify genes and markers for fast-track… (More)
We show that the linear dependence on p of the running time of Kedlaya's point-counting algorithm in characteristic p can be reduced to p 1/2 , at least in the simplest case of an elliptic curve over the prime field.
We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coecient rings with fast roots of unity. Moreover, we prove the more explicit bound O(n logn K log n) with K = 8. We show that an optimised variant of Fürer's algorithm achieves only K =… (More)
We describe a cache-friendly version of van der Hoeven's truncated FFT and inverse truncated FFT, focusing on the case of 'large' coefficients, such as those arising in the Schönhage–Strassen algorithm for multiplication in Z[x]. We describe two implementations and examine their performance.
We analyse and drastically improve the running time of the algorithm of Mazur, Stein and Tate for computing the canonical cyclotomic p-adic height of a point on an elliptic curve E/Q, where E has good ordinary reduction at p ≥ 5.
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.