A high throughput lentivirus sieving assay identifies neutralization resistant Envelope sequences and predicts in vivo sieving

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Sieving Algorithms Block Sieving Algorithms

Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...

متن کامل

Sieving in Function Fields

We present the rst implementation of sieving techniques in the context of function elds. More precisely, we compute in class groups of quadratic congruence function elds by combining the Algorithm of Hafner and McCurley with sieving ideas known from factoring. We apply our methods to compute generators and relations of the Jacobian variety of hyperelliptic curves over nite elds.

متن کامل

A Dedicated Sieving Hardware

We describe a hardware device for supporting the sieving step in integer factoring algorithms like the quadratic sieve or the number field sieve. In analogy to Bernstein’s proposal for speeding up the linear algebra step, we rely on a mesh of very simple processing units. Manufacturing the device at moderate cost with current hardware technology on standard wafers with 200 mm or 300 mm diameter...

متن کامل

The cyclic sieving phenomenon

The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...

متن کامل

Cyclic Sieving and Cluster Multicomplexes

Reiner, Stanton, and White [10] proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu [2] generalized these results to Cartan-Killing types other than A by means of actions of deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky [6]. The ReinerStanton-White and Eu-Fu results were proven using direct counting arguments. We give rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Immunological Methods

سال: 2019

ISSN: 0022-1759

DOI: 10.1016/j.jim.2018.10.013