@article{11121,
  abstract     = {In metazoa, the nuclear envelope breaks down and reforms during each cell cycle. Nuclear pore complexes (NPCs), which serve as channels for transport between the nucleus and cytoplasm1, assemble into the reforming nuclear envelope in a sequential process involving association of a subset of NPC proteins, nucleoporins, with chromatin followed by the formation of a closed nuclear envelope fenestrated by NPCs2,3,4,5,6,7. How chromatin recruitment of nucleoporins and NPC assembly are regulated is unknown. Here we demonstrate that RanGTP production is required to dissociate nucleoporins Nup107, Nup153 and Nup358 from Importin β, to target them to chromatin and to induce association between separate NPC subcomplexes. Additionally, either an excess of RanGTP or removal of Importin β induces formation of NPC-containing membrane structures—annulate lamellae—both in vitro in the absence of chromatin and in vivo. Annulate lamellae formation is strongly and specifically inhibited by an excess of Importin β. The data demonstrate that RanGTP triggers distinct steps of NPC assembly, and suggest a mechanism for the spatial restriction of NPC assembly to the surface of chromatin.},
  author       = {Walther, Tobias C. and Askjaer, Peter and Gentzel, Marc and Habermann, Anja and Griffiths, Gareth and Wilm, Matthias and Mattaj, Iain W. and HETZER, Martin W},
  issn         = {1476-4687},
  journal      = {Nature},
  keywords     = {Multidisciplinary},
  number       = {6949},
  pages        = {689--694},
  publisher    = {Springer Nature},
  title        = {{RanGTP mediates nuclear pore complex assembly}},
  doi          = {10.1038/nature01898},
  volume       = {424},
  year         = {2003},
}

@article{11122,
  abstract     = {Nuclear pore complexes (NPCs) are large multiprotein assemblies that allow traffic between the cytoplasm and the nucleus. During mitosis in higher eukaryotes, the Nuclear Envelope (NE) breaks down and NPCs disassemble. How NPCs reassemble and incorporate into the NE upon mitotic exit is poorly understood. We demonstrate a function for the conserved Nup107-160 complex in this process. Partial in vivo depletion of Nup133 or Nup107 via RNAi in HeLa cells resulted in reduced levels of multiple nucleoporins and decreased NPC density in the NE. Immunodepletion of the entire Nup107-160 complex from in vitro nuclear assembly reactions produced nuclei with a continuous NE but no NPCs. This phenotype was reversible only if Nup107-160 complex was readded before closed NE formation. Depletion also prevented association of FG-repeat nucleoporins with chromatin. We propose a stepwise model in which postmitotic NPC assembly initiates on chromatin via early recruitment of the Nup107-160 complex.},
  author       = {Walther, Tobias C. and Alves, Annabelle and Pickersgill, Helen and Loı̈odice, Isabelle and HETZER, Martin W and Galy, Vincent and Hülsmann, Bastian B. and Köcher, Thomas and Wilm, Matthias and Allen, Terry and Mattaj, Iain W. and Doye, Valérie},
  issn         = {0092-8674},
  journal      = {Cell},
  keywords     = {General Biochemistry, Genetics and Molecular Biology},
  number       = {2},
  pages        = {195--206},
  publisher    = {Elsevier},
  title        = {{The conserved Nup107-160 complex is critical for nuclear pore complex assembly}},
  doi          = {10.1016/s0092-8674(03)00235-6},
  volume       = {113},
  year         = {2003},
}

@article{11764,
  abstract     = {In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.},
  author       = {Goel, Ashish and Henzinger, Monika H and Plotkin, Serge and Tardos, Eva},
  issn         = {0196-6774},
  journal      = {Journal of Algorithms},
  number       = {2},
  pages        = {314--332},
  publisher    = {Elsevier},
  title        = {{Scheduling data transfers in a network and the set scheduling problem}},
  doi          = {10.1016/s0196-6774(03)00054-3},
  volume       = {48},
  year         = {2003},
}

@article{11766,
  abstract     = {This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an -factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmic-competitive algorithm is possible on general network topologies (Lower bounds for on-line graph problems with application to on-line circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 531–540) and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies (Making commitments in the face of uncertainity: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519–530). We prove the same lower bound for meshes.},
  author       = {Henzinger, Monika H and Leonardi, Stefano},
  issn         = {0022-0000},
  journal      = {Journal of Computer and System Sciences},
  number       = {3},
  pages        = {567--611},
  publisher    = {Elsevier},
  title        = {{Scheduling multicasts on unit-capacity trees and meshes}},
  doi          = {10.1016/s0022-0000(03)00043-6},
  volume       = {66},
  year         = {2003},
}

@article{847,
  abstract     = {The accumulation of genome-wide information on single nucleotide polymorphisms in humans provides an unprecedented opportunity to detect the evolutionary forces responsible for heterogeneity of the level of genetic variability across loci. Previous studies have shown that history of recombination events has produced long haplotype blocks in the human genome, which contribute to this heterogeneity. Other factors, however, such as natural selection or the heterogeneity of mutation rates across loci, may also lead to heterogeneity of genetic variability. We compared synonymous and non-synonymous variability within human genes with their divergence from murine orthologs. We separately analyzed the non-synonymous variants predicted to damage protein structure or function and the variants predicted to be functionally benign. The predictions were based on comparative sequence analysis and, in some cases, on the analysis of protein structure. A strong correlation between non-synonymous, benign variability and non-synonymous human-mouse divergence suggests that selection played an important role in shaping the pattern of variability in coding regions of human genes. However, the lack of correlation between deleterious variability and evolutionary divergence shows that a substantial proportion of the observed non-synonymous single-nucleotide polymorphisms reduces fitness and never reaches fixation. Evolutionary and medical implications of the impact of selection on human polymorphisms are discussed.},
  author       = {Sunyaev, Shamil R and Fyodor Kondrashov and Bork, Peer and Ramensky, Vasily},
  journal      = {Human Molecular Genetics},
  number       = {24},
  pages        = {3325 -- 3330},
  publisher    = {Oxford University Press},
  title        = {{Impact of selection, mutation rate and genetic drift on human genetic variation}},
  doi          = {10.1093/hmg/ddg359},
  volume       = {12},
  year         = {2003},
}

@article{8519,
  author       = {Kaloshin, Vadim},
  issn         = {0020-9910},
  journal      = {Inventiones mathematicae},
  keywords     = {General Mathematics},
  number       = {3},
  pages        = {451--512},
  publisher    = {Springer Nature},
  title        = {{The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles}},
  doi          = {10.1007/s00222-002-0244-9},
  volume       = {151},
  year         = {2003},
}

@article{876,
  abstract     = {Alternative splicing is thought to be a major source of functional diversity in animal proteins. We analyzed the evolutionary conservation of proteins encoded by alternatively spliced genes and predicted the ancestral state for 73 cases of alternative splicing (25 insertions and 48 deletions). The amino acid sequences of most of the inserts in proteins produced by alternative splicing are as conserved as the surrounding sequences. Thus, alternative splicing often creates novel isoforms by the insertion of new, functional protein sequences that probably originated from noncoding sequences of introns.},
  author       = {Fyodor Kondrashov and Koonin, Eugene V},
  journal      = {Trends in Genetics},
  number       = {3},
  pages        = {115 -- 119},
  publisher    = {Elsevier},
  title        = {{Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences}},
  doi          = {10.1016/S0168-9525(02)00029-X},
  volume       = {19},
  year         = {2003},
}

@article{166,
  abstract     = {For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.},
  author       = {Browning, Timothy D and Swarbick Jones, M},
  journal      = {Proceedings of the Bonn session in analytic number theory and diophantine equations},
  publisher    = {Mathematisches Institut der Universität Bonn},
  title        = {{Counting rational points on del Pezzo surfaces of degree 5}},
  volume       = {360},
  year         = {2003},
}

@article{1959,
  abstract     = {The molecular organization of bacterial NADH: ubiquinone oxidoreductase (complex I or NDH-1) is not established, apart from a rough separation into dehydrogenase, connecting and membrane domains. In this work, complex I was purified from Escherichia coli and fragmented by replacing dodecylmaltoside with other detergents. Exchange into decyl maltoside led to the removal of the hydrophobic subunit NuoL from the otherwise intact complex. Diheptanoyl phosphocholine led to the loss of NuoL and NuoM subunits, whereas other subunits remained in the complex. The presence of N,N-dimethyldodecylamine N-oxide or Triton X-100 led to further disruption of the membrane domain into fragments containing NuoL/M/N, NuoA/K/N, and NuoH/J subunits. Among the hydrophilic subunits, NuoCD was most readily dissociated from the complex, whereas NuoB was partially dissociated from the peripheral arm assembly in N,N-dimethyldodecylamine N-oxide. A model of subunit arrangement in bacterial complex I based on these data is proposed. Subunits NuoL and NuoM, which are homologous to antiporters and are implicated in proton pumping, are located at the distal end of the membrane arm, spatially separated from the redox centers of the peripheral arm. This is consistent with proposals that the mechanism of proton pumping by complex I is likely to involve long range conformational changes.},
  author       = {Holt, Peter J and Morgan, David J and Leonid Sazanov},
  journal      = {Journal of Biological Chemistry},
  number       = {44},
  pages        = {43114 -- 43120},
  publisher    = {American Society for Biochemistry and Molecular Biology},
  title        = {{The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping}},
  doi          = {10.1074/jbc.M308247200},
  volume       = {278},
  year         = {2003},
}

@article{1960,
  abstract     = {NADH-ubiquinone oxidoreductase (complex I or NDH-1) was purified from the BL21 strain of Escherichia coli using an improved procedure. The complex was effectively stabilized by addition of divalent cations and lipids, making the preparation suitable for structural studies. The ubiquinone reductase activity of the enzyme was fully restored by addition of native E. coli lipids. Two different two-dimensional crystal forms, with p2 and p3 symmetry, were obtained using lipids containing native E. coli extracts. Analysis of the crystals showed that they are formed by fully intact complex I in an L-shaped conformation. Activity assays and single particle analysis indicated that complex I maintains this structure in detergent solution and does not adopt a different conformation in the active state. Thus, we provide the first experimental evidence that complex I from E. coli has an L-shape in a lipid bilayer and confirm that this is also the case for the active enzyme in solution. This suggests strongly that bacterial complex I exists in an L-shaped conformation in vivo. Our results also indicate that native lipids play an important role in the activation, stabilization and, as a consequence, crystallization of purified complex I from E. coli.},
  author       = {Leonid Sazanov and Carroll, Joe D and Holt, Peter J and Toime, Laurence J and Fearnley, Ian M},
  journal      = {Journal of Biological Chemistry},
  number       = {21},
  pages        = {19483 -- 19491},
  publisher    = {American Society for Biochemistry and Molecular Biology},
  title        = {{A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I)}},
  doi          = {10.1074/jbc.M208959200},
  volume       = {278},
  year         = {2003},
}

@article{205,
  author       = {Timothy Browning},
  journal      = {Acta Arithmetica},
  number       = {3},
  pages        = {275 -- 295},
  publisher    = {Instytut Matematyczny},
  title        = {{Counting rational points on cubic and quartic surfaces}},
  doi          = {10.4064/aa108-3-7},
  volume       = {108},
  year         = {2003},
}

@article{206,
  abstract     = {Let T ⊂ ℙ 4 be a non-singular threefold of degree at least four. Then we show that the number of points in T(ℚ), with height at most B, is o(B 3) or B → ∞.},
  author       = {Timothy Browning},
  journal      = {Quarterly Journal of Mathematics},
  number       = {1},
  pages        = {33 -- 39},
  publisher    = {Unknown},
  title        = {{A note on the distribution of rational points on threefolds}},
  doi          = {10.1093/qjmath/54.1.33},
  volume       = {54},
  year         = {2003},
}

@article{207,
  author       = {Browning, Timothy D},
  journal      = {Mathematical Proceedings of the Cambridge Philosophical Society},
  number       = {3},
  pages        = {385 -- 395},
  publisher    = {Cambridge University Press},
  title        = {{Sums of four biquadrates}},
  doi          = {10.1017/S0305004102006382},
  volume       = {134},
  year         = {2003},
}

@article{208,
  abstract     = {For any ε > 0 and any diagonal quadratic form Q ∈ ℤ[x 1, x 2, x 3, x 4] with a square-free discriminant of modulus Δ Q ≠ 0, we establish the uniform estimate ≪ε B 3/2+ε + B 2+ε/Δ Q 1/6 for the number of rational points of height at most B lying in the projective surface Q = 0.},
  author       = {Timothy Browning},
  journal      = {Quarterly Journal of Mathematics},
  number       = {1},
  pages        = {11 -- 31},
  publisher    = {Oxford University Press},
  title        = {{Counting rational points on diagonal quadratic surfaces}},
  doi          = {10.1093/qjmath/54.1.11},
  volume       = {54},
  year         = {2003},
}

@inproceedings{2337,
  author       = {Lieb, Élliott H and Robert Seiringer},
  editor       = {Karpeshina, Yulia and Weikard, Rudi and Zeng, Yanni},
  pages        = {239 -- 250},
  publisher    = {American Mathematical Society},
  title        = {{Bose-Einstein condensation of dilute gases in traps }},
  doi          = {10.1090/conm/327/05818},
  volume       = {327},
  year         = {2003},
}

@article{2354,
  abstract     = {We investigate the ground state properties of a gas of interacting particles confined in an external potential in three dimensions and subject to rotation around an axis of symmetry. We consider the Gross-Pitaevskii (GP) limit of a dilute gas. Analysing both the absolute and the bosonic ground states of the system, we show, in particular, their different behaviour for a certain range of parameters. This parameter range is determined by the question whether the rotational symmetry in the minimizer of the GP functional is broken or not. For the absolute ground state, we prove that in the GP limit a modified GP functional depending on density matrices correctly describes the energy and reduced density matrices, independent of symmetry breaking. For the bosonic ground state this holds true if and only if the symmetry is unbroken.},
  author       = {Robert Seiringer},
  journal      = {Journal of Physics A: Mathematical and Theoretical},
  number       = {37},
  pages        = {9755 -- 9778},
  publisher    = {IOP Publishing Ltd.},
  title        = {{Ground state asymptotics of a dilute, rotating gas}},
  doi          = {10.1088/0305-4470/36/37/312},
  volume       = {36},
  year         = {2003},
}

@article{2357,
  abstract     = {The classic Poincaré inequality bounds the L q-norm of a function f in a bounded domain Ω ⊂ ℝ n in terms of some L p-norm of its gradient in Ω. We generalize this in two ways: In the first generalization we remove a set Τ from Ω and concentrate our attention on Λ = Ω \ Τ. This new domain might not even be connected and hence no Poincaré inequality can generally hold for it, or if it does hold it might have a very bad constant. This is so even if the volume of Τ is arbitrarily small. A Poincaré inequality does hold, however, if one makes the additional assumption that f has a finite L p gradient norm on the whole of Ω, not just on Λ. The important point is that the Poincaré inequality thus obtained bounds the L q-norm of f in terms of the L p gradient norm on Λ (not Ω) plus an additional term that goes to zero as the volume of Τ goes to zero. This error term depends on Τ only through its volume. Apart from this additive error term, the constant in the inequality remains that of the 'nice' domain Ω. In the second generalization we are given a vector field A and replace ∇ by ∇ + iA(x) (geometrically, a connection on a U(1) bundle). Unlike the A = 0 case, the infimum of ∥(∇ + iA)f∥ p over all f with a given ∥f∥ q is in general not zero. This permits an improvement of the inequality by the addition of a term whose sharp value we derive. We describe some open problems that arise from these generalizations.},
  author       = {Lieb, Élliott H and Robert Seiringer and Yngvason, Jakob},
  journal      = {Annals of Mathematics},
  number       = {3},
  pages        = {1067 -- 1080},
  publisher    = {Princeton University Press},
  title        = {{Poincaré inequalities in punctured domains}},
  doi          = {10.4007/annals.2003.158.1067 },
  volume       = {158},
  year         = {2003},
}

@article{2358,
  abstract     = {A study was conducted on the one-dimensional (1D) bosons in three-dimensional (3D) traps. A rigorous analysis was carried out on the parameter regions in which various types of 1D or 3D behavior occurred in the ground state. The four parameter regions include density, transverse, longitudinal dimensions and scattering length.},
  author       = {Lieb, Élliott H and Robert Seiringer and Yngvason, Jakob},
  journal      = {Physical Review Letters},
  number       = {15},
  pages        = {1504011 -- 1504014},
  publisher    = {American Physical Society},
  title        = {{One-dimensional Bosons in three-dimensional traps}},
  doi          = {10.1103/PhysRevLett.91.150401},
  volume       = {91},
  year         = {2003},
}

@phdthesis{2414,
  author       = {Uli Wagner},
  publisher    = {ETH Zurich},
  title        = {{On k-Sets and Their Applications}},
  doi          = {10.3929/ethz-a-004708408},
  year         = {2003},
}

@inproceedings{2422,
  abstract     = {We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n.},
  author       = {Uli Wagner},
  pages        = {583 -- 588},
  publisher    = {SIAM},
  title        = {{On the rectilinear crossing number of complete graphs}},
  year         = {2003},
}