Extraction of SV40 T-antigen from lysates of transformed cells

AbstractSubcellular fractions from SV-40 transformed hamster lens cells, prepared by chemical extractions, were tested for the presence of T-antigen by immunoautoradiography. Most of the T-antigen was present in the nucleus and was resistant to extraction by 2 M NaCl, indicating an association with the nuclear matrix. Another part of the T-antigen was, under certain conditions, resistant to extraction of the cells with a nonionic detergent. This T-antigen could be solubilized by Ca2+ at low temperature, conditions that also cause a specific depolymerization of microtubules

Complexity of scheduling multiprocessor tasks with prespecified processor allocations

We investigate the computational complexity of scheduling multiprocessor tasks with prespecified processor allocations. We consider two criteria: minimizing schedule length and minimizing the sum of the task completion times. In addition, we investigate the complexity of problems when precedence constraints or release dates are involved

Approximating rings of integers in number fields

Wetensch. publicatieFaculteit der Wiskunde en Natuurwetenschappe

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed. Moreover, using a weaker notion of approximation, we show the existence of a fully polynomial-time approximation scheme for the problem of maximizing or minimizing an arbitrary polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.Comment: 16 pages, 4 figures; to appear in Mathematical Programmin

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

Dual origins of dairy cattle farming : evidence from a comprehensive survey of European Y-Chromosomal variation

Background - Diversity patterns of livestock species are informative to the history of agriculture and indicate uniqueness of breeds as relevant for conservation. So far, most studies on cattle have focused on mitochondrial and autosomal DNA variation. Previous studies of Y-chromosomal variation, with limited breed panels, identified two Bos taurus (taurine) haplogroups (Y1 and Y2; both composed of several haplotypes) and one Bos indicus (indicine/zebu) haplogroup (Y3), as well as a strong phylogeographic structuring of paternal lineages. Methodology and Principal Findings - Haplogroup data were collected for 2087 animals from 138 breeds. For 111 breeds, these were resolved further by genotyping microsatellites INRA189 (10 alleles) and BM861 (2 alleles). European cattle carry exclusively taurine haplotypes, with the zebu Y-chromosomes having appreciable frequencies in Southwest Asian populations. Y1 is predominant in northern and north-western Europe, but is also observed in several Iberian breeds, as well as in Southwest Asia. A single Y1 haplotype is predominant in north-central Europe and a single Y2 haplotype in central Europe. In contrast, we found both Y1 and Y2 haplotypes in Britain, the Nordic region and Russia, with the highest Y-chromosomal diversity seen in the Iberian Peninsula. Conclusions - We propose that the homogeneous Y1 and Y2 regions reflect founder effects associated with the development and expansion of two groups of dairy cattle, the pied or red breeds from the North Sea and Baltic coasts and the spotted, yellow or brown breeds from Switzerland, respectively. The present Y1-Y2 contrast in central Europe coincides with historic, linguistic, religious and cultural boundaries