[{"publication_status":"published","month":"03","abstract":[{"lang":"eng","text":"Tripartite G-protein-coupled receptors (GPCRs) represent one of the largest groups of signal transducers, transmitting signals from hormones, neuropeptides, odorants, food and light. Ligand-bound receptors catalyse GDP/GTP exchange on the G-protein α-subunit (Gα), leading to α-GTP separation from the βγ subunits and pathway activation. Activating mutations in the receptors or G proteins underlie many human diseases, including some cancers, dwarfism and premature puberty. Regulators of G-protein signalling (RGS proteins) are known to modulate the level and duration of ligand-induced signalling by accelerating the intrinsic GTPase activity of the Gα subunit, and thus reformation of the inactive GDP-bound Gα. Here we find that even in the absence of receptor, mutation of the RGS family member Sst2 (refs 6-9) permits spontaneous activation of the G-protein-coupled mating pathway in Saccharomyces cerevisiae at levels normally seen only in the presence of ligand. Our work demonstrates the occurence of spontaneous tripartite G-protein signalling in vivo and identifies a requirement for RGS proteins in preventing such receptor-independent activation."}],"_id":"3150","issue":"3","extern":1,"page":"231 - 235","date_updated":"2021-01-12T07:41:24Z","date_created":"2018-12-11T12:01:41Z","quality_controlled":0,"date_published":"2003-03-01T00:00:00Z","intvolume":"         5","volume":5,"type":"journal_article","day":"01","author":[{"id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","last_name":"Siekhaus","full_name":"Daria Siekhaus","orcid":"0000-0001-8323-8353"},{"full_name":"Drubin, David G","first_name":"David","last_name":"Drubin"}],"citation":{"mla":"Siekhaus, Daria E., and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” <i>Nature Cell Biology</i>, vol. 5, no. 3, Nature Publishing Group, 2003, pp. 231–35, doi:<a href=\"https://doi.org/10.1038/ncb941\">10.1038/ncb941</a>.","chicago":"Siekhaus, Daria E, and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/ncb941\">https://doi.org/10.1038/ncb941</a>.","ieee":"D. E. Siekhaus and D. Drubin, “Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant,” <i>Nature Cell Biology</i>, vol. 5, no. 3. Nature Publishing Group, pp. 231–235, 2003.","apa":"Siekhaus, D. E., &#38; Drubin, D. (2003). Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb941\">https://doi.org/10.1038/ncb941</a>","short":"D.E. Siekhaus, D. Drubin, Nature Cell Biology 5 (2003) 231–235.","ama":"Siekhaus DE, Drubin D. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. <i>Nature Cell Biology</i>. 2003;5(3):231-235. doi:<a href=\"https://doi.org/10.1038/ncb941\">10.1038/ncb941</a>","ista":"Siekhaus DE, Drubin D. 2003. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 5(3), 231–235."},"doi":"10.1038/ncb941","publisher":"Nature Publishing Group","year":"2003","title":"Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant","status":"public","publication":"Nature Cell Biology","publist_id":"3544"},{"publist_id":"3545","year":"2003","title":"Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development","publication":"Genetics","status":"public","citation":{"ista":"Rayburn L, Gooding H, Choksi S, Maloney D, Kidd A, Siekhaus DE, Bender M. 2003. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 163(1), 227–237.","ama":"Rayburn L, Gooding H, Choksi S, et al. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. <i>Genetics</i>. 2003;163(1):227-237.","short":"L. Rayburn, H. Gooding, S. Choksi, D. Maloney, A. Kidd, D.E. Siekhaus, M. Bender, Genetics 163 (2003) 227–237.","apa":"Rayburn, L., Gooding, H., Choksi, S., Maloney, D., Kidd, A., Siekhaus, D. E., &#38; Bender, M. (2003). Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. <i>Genetics</i>. Genetics Society of America.","ieee":"L. Rayburn <i>et al.</i>, “Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development,” <i>Genetics</i>, vol. 163, no. 1. Genetics Society of America, pp. 227–237, 2003.","chicago":"Rayburn, Lowell, Holly Gooding, Semil Choksi, Dhea Maloney, Ambrose Kidd, Daria E Siekhaus, and Michael Bender. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” <i>Genetics</i>. Genetics Society of America, 2003.","mla":"Rayburn, Lowell, et al. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” <i>Genetics</i>, vol. 163, no. 1, Genetics Society of America, 2003, pp. 227–37."},"publisher":"Genetics Society of America","author":[{"full_name":"Rayburn, Lowell Y","first_name":"Lowell","last_name":"Rayburn"},{"full_name":"Gooding, Holly C","last_name":"Gooding","first_name":"Holly"},{"full_name":"Choksi, Semil P","last_name":"Choksi","first_name":"Semil"},{"last_name":"Maloney","first_name":"Dhea","full_name":"Maloney, Dhea"},{"full_name":"Kidd, Ambrose R","first_name":"Ambrose","last_name":"Kidd"},{"orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","last_name":"Siekhaus","full_name":"Daria Siekhaus"},{"full_name":"Bender, Michael","first_name":"Michael","last_name":"Bender"}],"day":"01","type":"journal_article","intvolume":"       163","volume":163,"date_created":"2018-12-11T12:01:41Z","date_published":"2003-01-01T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T07:41:25Z","page":"227 - 237","extern":1,"issue":"1","_id":"3151","abstract":[{"lang":"eng","text":"Biosynthesis of most peptide hormones and neuropeptides requires proteolytic excision of the active peptide from inactive proprotein precursors, an activity carried out by subtilisin-like proprotein convertases (SPCs) in constitutive or regulated secretory pathways. The Drosophila amontillado (amon) gene encodes a homolog of the mammalian PC2 protein, an SPC that functions in the regulated secretory pathway in neuroendocrine tissues. We have identified amon mutants by isolating ethylmethanesulfonate (EMS)-induced lethal and visible mutations that define two complementation groups in the amon interval at 97D1 of the third chromosome. DNA sequencing identified the amon complementation group and the DNA sequence change for each of the nine amon alleles isolated. amon mutants display partial embryonic lethality, are defective in larval growth, and arrest during the first to second instar larval molt. Mutant larvae can be rescued by heat-shock-induced expression of the amon protein. Rescued larvae arrest at the subsequent larval molt, suggesting that amon is also required for the second to third instar larval molt. Our data indicate that the amon proprotein convertase is required during embryogenesis and larval development in Drosophila and support the hypothesis that AMON acts to proteolytically process peptide hormones that regulate hatching, larval growth, and larval ecdysis."}],"month":"01","publication_status":"published"},{"date_published":"2003-09-30T00:00:00Z","date_created":"2018-12-11T12:01:48Z","quality_controlled":0,"volume":1,"intvolume":"         1","extern":1,"page":"26 - 33","date_updated":"2021-01-12T07:41:33Z","publication_status":"published","abstract":[{"lang":"eng","text":"Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry."}],"month":"09","_id":"3170","publist_id":"3511","publisher":"IEEE","doi":"10.1109/ICCV.2003.1238310","citation":{"ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. <i>Computing Geodesics and Minimal Surfaces via Graph Cuts</i>. Vol. 1, IEEE, 2003, pp. 26–33, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">10.1109/ICCV.2003.1238310</a>.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238310\">https://doi.org/10.1109/ICCV.2003.1238310</a>","ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33."},"status":"public","year":"2003","title":"Computing geodesics and minimal surfaces via graph cuts","author":[{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov"}],"type":"conference","conference":{"name":"ICCV: International Conference on Computer Vision"},"day":"30"},{"type":"conference","conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"day":"26","alternative_title":["LNCS"],"author":[{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"},{"full_name":"Gortler, Steven","first_name":"Steven","last_name":"Gortler"}],"publisher":"Springer","citation":{"ieee":"V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.","apa":"Kolmogorov, V., Zabih, R., &#38; Gortler, S. (2003). Generalized multi camera scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>","chicago":"Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">https://doi.org/10.1007/978-3-540-45063-4_32</a>.","mla":"Kolmogorov, Vladimir, et al. <i>Generalized Multi Camera Scene Reconstruction Using Graph Cuts</i>. Vol. 2683, Springer, 2003, pp. 501–16, doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>.","ista":"Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS, vol. 2683, 501–516.","ama":"Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:<a href=\"https://doi.org/10.1007/978-3-540-45063-4_32\">10.1007/978-3-540-45063-4_32</a>","short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516."},"doi":"10.1007/978-3-540-45063-4_32","year":"2003","status":"public","title":"Generalized multi camera scene reconstruction using graph cuts","publist_id":"3512","month":"06","abstract":[{"text":"Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included. ","lang":"eng"}],"publication_status":"published","_id":"3171","extern":1,"page":"501 - 516","date_updated":"2021-01-12T07:41:34Z","date_published":"2003-06-26T00:00:00Z","date_created":"2018-12-11T12:01:48Z","quality_controlled":0,"volume":2683,"intvolume":"      2683"},{"intvolume":"         2","volume":2,"date_created":"2018-12-11T12:01:49Z","quality_controlled":0,"date_published":"2003-09-30T00:00:00Z","date_updated":"2021-01-12T07:41:35Z","page":"1033 - 1040","extern":1,"_id":"3174","abstract":[{"text":"We address visual correspondence problems without assuming that scene points have similar intensities in different views. This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using 'a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information.","lang":"eng"}],"month":"09","publication_status":"published","publist_id":"3510","title":"Visual correspondence using energy minimization and mutual information","status":"public","year":"2003","publisher":"IEEE","citation":{"short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.","ista":"Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization and mutual information. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.","ama":"Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>","apa":"Kim, J., Kolmogorov, V., &#38; Zabih, R. (2003). Visual correspondence using energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>","ieee":"J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040.","mla":"Kim, Junhwan, et al. <i>Visual Correspondence Using Energy Minimization and Mutual Information</i>. Vol. 2, IEEE, 2003, pp. 1033–40, doi:<a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">10.1109/ICCV.2003.1238463</a>.","chicago":"Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. <a href=\"https://doi.org/10.1109/ICCV.2003.1238463\">https://doi.org/10.1109/ICCV.2003.1238463</a>."},"doi":"10.1109/ICCV.2003.1238463","author":[{"first_name":"Junhwan","last_name":"Kim","full_name":"Kim, Junhwan"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"}],"day":"30","conference":{"name":"ICCV: International Conference on Computer Vision"},"type":"conference"},{"publist_id":"3472","year":"2003","publication":"Journal of Computer and System Sciences","status":"public","title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","publisher":"Elsevier","citation":{"chicago":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>.","mla":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>.","ieee":"K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems,” <i>Journal of Computer and System Sciences</i>, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.","apa":"Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">https://doi.org/10.1016/S0022-0000(03)00078-3</a>","ama":"Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. <i>Journal of Computer and System Sciences</i>. 2003;67(4):757-771. doi:<a href=\"https://doi.org/10.1016/S0022-0000(03)00078-3\">10.1016/S0022-0000(03)00078-3</a>","ista":"Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.","short":"K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771."},"doi":"10.1016/S0022-0000(03)00078-3","author":[{"orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"day":"01","type":"journal_article","volume":67,"intvolume":"        67","date_created":"2018-12-11T12:02:01Z","quality_controlled":0,"date_published":"2003-12-01T00:00:00Z","date_updated":"2021-01-12T07:41:49Z","extern":1,"issue":"4","page":"757 - 771","_id":"3209","abstract":[{"text":"We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences.","lang":"eng"}],"month":"12","publication_status":"published"},{"doi":"10.1007/3-540-39200-9_34","citation":{"ama":"Maurer U, Pietrzak KZ. The security of many round Luby Rackoff pseudo random permutations. In: Vol 2656. Springer; 2003:544-561. doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>","ista":"Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656, 544–561.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “The Security of Many Round Luby Rackoff Pseudo Random Permutations,” 2656:544–61. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. <i>The Security of Many Round Luby Rackoff Pseudo Random Permutations</i>. Vol. 2656, Springer, 2003, pp. 544–61, doi:<a href=\"https://doi.org/10.1007/3-540-39200-9_34\">10.1007/3-540-39200-9_34</a>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2003). The security of many round Luby Rackoff pseudo random permutations (Vol. 2656, pp. 544–561). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/3-540-39200-9_34\">https://doi.org/10.1007/3-540-39200-9_34</a>","ieee":"U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561."},"publisher":"Springer","year":"2003","title":"The security of many round Luby Rackoff pseudo random permutations","status":"public","publist_id":"3473","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"type":"conference","day":"04","alternative_title":["LNCS"],"author":[{"full_name":"Maurer, Ueli M","last_name":"Maurer","first_name":"Ueli"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"extern":1,"page":"544 - 561","date_updated":"2021-01-12T07:41:49Z","date_created":"2018-12-11T12:02:02Z","date_published":"2003-06-04T00:00:00Z","quality_controlled":0,"volume":2656,"intvolume":"      2656","month":"06","abstract":[{"text":"Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c &lt; α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. ","lang":"eng"}],"publication_status":"published","_id":"3210"},{"publication":"Nature","citation":{"chicago":"Walther, Tobias C., Peter Askjaer, Marc Gentzel, Anja Habermann, Gareth Griffiths, Matthias Wilm, Iain W. Mattaj, and Martin Hetzer. “RanGTP Mediates Nuclear Pore Complex Assembly.” <i>Nature</i>. Springer Nature, 2003. <a href=\"https://doi.org/10.1038/nature01898\">https://doi.org/10.1038/nature01898</a>.","mla":"Walther, Tobias C., et al. “RanGTP Mediates Nuclear Pore Complex Assembly.” <i>Nature</i>, vol. 424, no. 6949, Springer Nature, 2003, pp. 689–94, doi:<a href=\"https://doi.org/10.1038/nature01898\">10.1038/nature01898</a>.","apa":"Walther, T. C., Askjaer, P., Gentzel, M., Habermann, A., Griffiths, G., Wilm, M., … Hetzer, M. (2003). RanGTP mediates nuclear pore complex assembly. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nature01898\">https://doi.org/10.1038/nature01898</a>","ieee":"T. C. Walther <i>et al.</i>, “RanGTP mediates nuclear pore complex assembly,” <i>Nature</i>, vol. 424, no. 6949. Springer Nature, pp. 689–694, 2003.","ista":"Walther TC, Askjaer P, Gentzel M, Habermann A, Griffiths G, Wilm M, Mattaj IW, Hetzer M. 2003. RanGTP mediates nuclear pore complex assembly. Nature. 424(6949), 689–694.","ama":"Walther TC, Askjaer P, Gentzel M, et al. RanGTP mediates nuclear pore complex assembly. <i>Nature</i>. 2003;424(6949):689-694. doi:<a href=\"https://doi.org/10.1038/nature01898\">10.1038/nature01898</a>","short":"T.C. Walther, P. Askjaer, M. Gentzel, A. Habermann, G. Griffiths, M. Wilm, I.W. Mattaj, M. Hetzer, Nature 424 (2003) 689–694."},"keyword":["Multidisciplinary"],"day":"30","scopus_import":"1","pmid":1,"extern":"1","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","intvolume":"       424","volume":424,"date_created":"2022-04-07T07:57:02Z","abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","status":"public","title":"RanGTP mediates nuclear pore complex assembly","year":"2003","doi":"10.1038/nature01898","publisher":"Springer Nature","oa_version":"None","type":"journal_article","author":[{"last_name":"Walther","first_name":"Tobias C.","full_name":"Walther, Tobias C."},{"full_name":"Askjaer, Peter","first_name":"Peter","last_name":"Askjaer"},{"first_name":"Marc","last_name":"Gentzel","full_name":"Gentzel, Marc"},{"full_name":"Habermann, Anja","first_name":"Anja","last_name":"Habermann"},{"full_name":"Griffiths, Gareth","first_name":"Gareth","last_name":"Griffiths"},{"last_name":"Wilm","first_name":"Matthias","full_name":"Wilm, Matthias"},{"full_name":"Mattaj, Iain W.","first_name":"Iain W.","last_name":"Mattaj"},{"orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"article_type":"original","external_id":{"pmid":["12894213"]},"date_updated":"2022-07-18T08:57:40Z","issue":"6949","page":"689-694","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2003-07-30T00:00:00Z","_id":"11121","month":"07","article_processing_charge":"No","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]}},{"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","intvolume":"       113","volume":113,"date_created":"2022-04-07T07:57:10Z","extern":"1","pmid":1,"publication_status":"published","abstract":[{"lang":"eng","text":"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."}],"publication":"Cell","citation":{"ama":"Walther TC, Alves A, Pickersgill H, et al. The conserved Nup107-160 complex is critical for nuclear pore complex assembly. <i>Cell</i>. 2003;113(2):195-206. doi:<a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">10.1016/s0092-8674(03)00235-6</a>","ista":"Walther TC, Alves A, Pickersgill H, Loı̈odice I, Hetzer M, Galy V, Hülsmann BB, Köcher T, Wilm M, Allen T, Mattaj IW, Doye V. 2003. The conserved Nup107-160 complex is critical for nuclear pore complex assembly. Cell. 113(2), 195–206.","short":"T.C. Walther, A. Alves, H. Pickersgill, I. Loı̈odice, M. Hetzer, V. Galy, B.B. Hülsmann, T. Köcher, M. Wilm, T. Allen, I.W. Mattaj, V. Doye, Cell 113 (2003) 195–206.","apa":"Walther, T. C., Alves, A., Pickersgill, H., Loı̈odice, I., Hetzer, M., Galy, V., … Doye, V. (2003). The conserved Nup107-160 complex is critical for nuclear pore complex assembly. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">https://doi.org/10.1016/s0092-8674(03)00235-6</a>","ieee":"T. C. Walther <i>et al.</i>, “The conserved Nup107-160 complex is critical for nuclear pore complex assembly,” <i>Cell</i>, vol. 113, no. 2. Elsevier, pp. 195–206, 2003.","chicago":"Walther, Tobias C., Annabelle Alves, Helen Pickersgill, Isabelle Loı̈odice, Martin Hetzer, Vincent Galy, Bastian B. Hülsmann, et al. “The Conserved Nup107-160 Complex Is Critical for Nuclear Pore Complex Assembly.” <i>Cell</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">https://doi.org/10.1016/s0092-8674(03)00235-6</a>.","mla":"Walther, Tobias C., et al. “The Conserved Nup107-160 Complex Is Critical for Nuclear Pore Complex Assembly.” <i>Cell</i>, vol. 113, no. 2, Elsevier, 2003, pp. 195–206, doi:<a href=\"https://doi.org/10.1016/s0092-8674(03)00235-6\">10.1016/s0092-8674(03)00235-6</a>."},"keyword":["General Biochemistry","Genetics and Molecular Biology"],"day":"17","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2003-04-17T00:00:00Z","quality_controlled":"1","article_type":"original","date_updated":"2022-07-18T08:57:42Z","external_id":{"pmid":["12705868"]},"issue":"2","page":"195-206","publication_identifier":{"issn":["0092-8674"]},"_id":"11122","month":"04","article_processing_charge":"No","oa_version":"Published Version","status":"public","title":"The conserved Nup107-160 complex is critical for nuclear pore complex assembly","year":"2003","doi":"10.1016/s0092-8674(03)00235-6","publisher":"Elsevier","author":[{"full_name":"Walther, Tobias C.","first_name":"Tobias C.","last_name":"Walther"},{"last_name":"Alves","first_name":"Annabelle","full_name":"Alves, Annabelle"},{"last_name":"Pickersgill","first_name":"Helen","full_name":"Pickersgill, Helen"},{"first_name":"Isabelle","last_name":"Loı̈odice","full_name":"Loı̈odice, Isabelle"},{"orcid":"0000-0002-2111-992X","last_name":"HETZER","first_name":"Martin W","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"},{"first_name":"Vincent","last_name":"Galy","full_name":"Galy, Vincent"},{"first_name":"Bastian B.","last_name":"Hülsmann","full_name":"Hülsmann, Bastian B."},{"full_name":"Köcher, Thomas","last_name":"Köcher","first_name":"Thomas"},{"full_name":"Wilm, Matthias","first_name":"Matthias","last_name":"Wilm"},{"last_name":"Allen","first_name":"Terry","full_name":"Allen, Terry"},{"first_name":"Iain W.","last_name":"Mattaj","full_name":"Mattaj, Iain W."},{"first_name":"Valérie","last_name":"Doye","full_name":"Doye, Valérie"}],"type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"volume":48,"intvolume":"        48","date_published":"2003-09-01T00:00:00Z","quality_controlled":"1","date_created":"2022-08-08T12:09:32Z","article_type":"original","date_updated":"2022-09-12T09:45:06Z","page":"314-332","issue":"2","extern":"1","publication_identifier":{"issn":["0196-6774"]},"_id":"11764","month":"09","abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","article_processing_charge":"No","oa_version":"None","publication":"Journal of Algorithms","title":"Scheduling data transfers in a network and the set scheduling problem","status":"public","year":"2003","citation":{"ieee":"A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” <i>Journal of Algorithms</i>, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.","apa":"Goel, A., Henzinger, M. H., Plotkin, S., &#38; Tardos, E. (2003). Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>","mla":"Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>, vol. 48, no. 2, Elsevier, 2003, pp. 314–32, doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>.","chicago":"Goel, Ashish, Monika H Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” <i>Journal of Algorithms</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">https://doi.org/10.1016/s0196-6774(03)00054-3</a>.","short":"A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, Journal of Algorithms 48 (2003) 314–332.","ista":"Goel A, Henzinger MH, Plotkin S, Tardos E. 2003. Scheduling data transfers in a network and the set scheduling problem. Journal of Algorithms. 48(2), 314–332.","ama":"Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem. <i>Journal of Algorithms</i>. 2003;48(2):314-332. doi:<a href=\"https://doi.org/10.1016/s0196-6774(03)00054-3\">10.1016/s0196-6774(03)00054-3</a>"},"doi":"10.1016/s0196-6774(03)00054-3","publisher":"Elsevier","author":[{"full_name":"Goel, Ashish","last_name":"Goel","first_name":"Ashish"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Plotkin","first_name":"Serge","full_name":"Plotkin, Serge"},{"full_name":"Tardos, Eva","last_name":"Tardos","first_name":"Eva"}],"scopus_import":"1","day":"01","type":"journal_article"},{"author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/S0022-0000(03)00043-6"}],"type":"journal_article","oa_version":"Published Version","doi":"10.1016/s0022-0000(03)00043-6","publisher":"Elsevier","title":"Scheduling multicasts on unit-capacity trees and meshes","year":"2003","status":"public","publication_identifier":{"issn":["0022-0000"]},"month":"05","article_processing_charge":"No","_id":"11766","quality_controlled":"1","date_published":"2003-05-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"3","page":"567-611","article_type":"original","date_updated":"2023-02-10T08:03:31Z","day":"01","scopus_import":"1","oa":1,"citation":{"apa":"Henzinger, M. H., &#38; Leonardi, S. (2003). Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>","ieee":"M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.","mla":"Henzinger, Monika H., and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3, Elsevier, 2003, pp. 567–611, doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>.","chicago":"Henzinger, Monika H, and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>.","short":"M.H. Henzinger, S. Leonardi, Journal of Computer and System Sciences 66 (2003) 567–611.","ista":"Henzinger MH, Leonardi S. 2003. Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. 66(3), 567–611.","ama":"Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. 2003;66(3):567-611. doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>"},"publication":"Journal of Computer and System Sciences","abstract":[{"text":"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.","lang":"eng"}],"publication_status":"published","date_created":"2022-08-08T12:24:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":66,"intvolume":"        66","extern":"1"},{"author":[{"full_name":"Sunyaev, Shamil R","first_name":"Shamil","last_name":"Sunyaev"},{"orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov","last_name":"Kondrashov","first_name":"Fyodor"},{"last_name":"Bork","first_name":"Peer","full_name":"Bork, Peer"},{"first_name":"Vasily","last_name":"Ramensky","full_name":"Ramensky, Vasily"}],"type":"journal_article","day":"15","publist_id":"6803","publisher":"Oxford University Press","doi":"10.1093/hmg/ddg359","citation":{"apa":"Sunyaev, S., Kondrashov, F., Bork, P., &#38; Ramensky, V. (2003). Impact of selection, mutation rate and genetic drift on human genetic variation. <i>Human Molecular Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/hmg/ddg359\">https://doi.org/10.1093/hmg/ddg359</a>","ieee":"S. Sunyaev, F. Kondrashov, P. Bork, and V. Ramensky, “Impact of selection, mutation rate and genetic drift on human genetic variation,” <i>Human Molecular Genetics</i>, vol. 12, no. 24. Oxford University Press, pp. 3325–3330, 2003.","mla":"Sunyaev, Shamil, et al. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” <i>Human Molecular Genetics</i>, vol. 12, no. 24, Oxford University Press, 2003, pp. 3325–30, doi:<a href=\"https://doi.org/10.1093/hmg/ddg359\">10.1093/hmg/ddg359</a>.","chicago":"Sunyaev, Shamil, Fyodor Kondrashov, Peer Bork, and Vasily Ramensky. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” <i>Human Molecular Genetics</i>. Oxford University Press, 2003. <a href=\"https://doi.org/10.1093/hmg/ddg359\">https://doi.org/10.1093/hmg/ddg359</a>.","short":"S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics 12 (2003) 3325–3330.","ista":"Sunyaev S, Kondrashov F, Bork P, Ramensky V. 2003. Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. 12(24), 3325–3330.","ama":"Sunyaev S, Kondrashov F, Bork P, Ramensky V. Impact of selection, mutation rate and genetic drift on human genetic variation. <i>Human Molecular Genetics</i>. 2003;12(24):3325-3330. doi:<a href=\"https://doi.org/10.1093/hmg/ddg359\">10.1093/hmg/ddg359</a>"},"year":"2003","title":"Impact of selection, mutation rate and genetic drift on human genetic variation","status":"public","publication":"Human Molecular Genetics","acknowledgement":"We are grateful to Alexey Kondrashov and Alison Wellman for the careful reading of the manuscript and providing us with their valuable comments.","month":"12","abstract":[{"text":"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.","lang":"eng"}],"publication_status":"published","_id":"847","quality_controlled":0,"date_published":"2003-12-15T00:00:00Z","date_created":"2018-12-11T11:48:49Z","intvolume":"        12","volume":12,"extern":1,"page":"3325 - 3330","issue":"24","date_updated":"2021-01-12T08:19:29Z"},{"author":[{"orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","first_name":"Vadim","last_name":"Kaloshin","full_name":"Kaloshin, Vadim"}],"day":"01","type":"journal_article","oa_version":"None","publication":"Inventiones mathematicae","year":"2003","status":"public","title":"The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles","citation":{"short":"V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512.","ama":"Kaloshin V. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. <i>Inventiones mathematicae</i>. 2003;151(3):451-512. doi:<a href=\"https://doi.org/10.1007/s00222-002-0244-9\">10.1007/s00222-002-0244-9</a>","ista":"Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512.","ieee":"V. Kaloshin, “The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles,” <i>Inventiones mathematicae</i>, vol. 151, no. 3. Springer Nature, pp. 451–512, 2003.","apa":"Kaloshin, V. (2003). The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. <i>Inventiones Mathematicae</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00222-002-0244-9\">https://doi.org/10.1007/s00222-002-0244-9</a>","mla":"Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” <i>Inventiones Mathematicae</i>, vol. 151, no. 3, Springer Nature, 2003, pp. 451–512, doi:<a href=\"https://doi.org/10.1007/s00222-002-0244-9\">10.1007/s00222-002-0244-9</a>.","chicago":"Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” <i>Inventiones Mathematicae</i>. Springer Nature, 2003. <a href=\"https://doi.org/10.1007/s00222-002-0244-9\">https://doi.org/10.1007/s00222-002-0244-9</a>."},"doi":"10.1007/s00222-002-0244-9","publisher":"Springer Nature","keyword":["General Mathematics"],"publication_identifier":{"issn":["0020-9910","1432-1297"]},"_id":"8519","publication_status":"published","month":"03","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":151,"intvolume":"       151","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2020-09-18T10:49:26Z","date_published":"2003-03-01T00:00:00Z","article_type":"original","date_updated":"2021-01-12T08:19:50Z","page":"451-512","issue":"3","extern":"1"},{"publist_id":"6776","citation":{"chicago":"Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” <i>Trends in Genetics</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0168-9525(02)00029-X\">https://doi.org/10.1016/S0168-9525(02)00029-X</a>.","mla":"Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” <i>Trends in Genetics</i>, vol. 19, no. 3, Elsevier, 2003, pp. 115–19, doi:<a href=\"https://doi.org/10.1016/S0168-9525(02)00029-X\">10.1016/S0168-9525(02)00029-X</a>.","apa":"Kondrashov, F., &#38; Koonin, E. (2003). Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. <i>Trends in Genetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0168-9525(02)00029-X\">https://doi.org/10.1016/S0168-9525(02)00029-X</a>","ieee":"F. Kondrashov and E. Koonin, “Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences,” <i>Trends in Genetics</i>, vol. 19, no. 3. Elsevier, pp. 115–119, 2003.","ista":"Kondrashov F, Koonin E. 2003. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. 19(3), 115–119.","ama":"Kondrashov F, Koonin E. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. <i>Trends in Genetics</i>. 2003;19(3):115-119. doi:<a href=\"https://doi.org/10.1016/S0168-9525(02)00029-X\">10.1016/S0168-9525(02)00029-X</a>","short":"F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119."},"doi":"10.1016/S0168-9525(02)00029-X","publisher":"Elsevier","acknowledgement":"We thank Peer Bork, Mikhail Gelfand, Alexey Kondrashov, David Lipman and Shamil Sunyaev for critical reading of the manuscript and useful suggestions and the Koonin group members for helpful discussions.","year":"2003","title":"Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences","status":"public","publication":"Trends in Genetics","author":[{"last_name":"Kondrashov","first_name":"Fyodor","full_name":"Fyodor Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694"},{"first_name":"Eugene","last_name":"Koonin","full_name":"Koonin, Eugene V"}],"type":"journal_article","day":"01","date_published":"2003-01-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:48:58Z","volume":19,"intvolume":"        19","extern":1,"page":"115 - 119","issue":"3","date_updated":"2021-01-12T08:20:58Z","publication_status":"published","month":"01","abstract":[{"text":"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.","lang":"eng"}],"_id":"876"},{"date_updated":"2021-01-12T06:52:20Z","external_id":{"arxiv":["1311.1665"]},"extern":"1","volume":360,"language":[{"iso":"eng"}],"intvolume":"       360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2003-01-01T00:00:00Z","date_created":"2018-12-11T11:44:58Z","_id":"166","publication_status":"published","month":"01","abstract":[{"lang":"eng","text":"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."}],"arxiv":1,"year":"2003","publication":"Proceedings of the Bonn session in analytic number theory and diophantine equations","title":"Counting rational points on del Pezzo surfaces of degree 5","status":"public","publisher":"Mathematisches Institut der Universität Bonn","citation":{"mla":"Browning, Timothy D., and M. Swarbick Jones. “Counting Rational Points on Del Pezzo Surfaces of Degree 5.” <i>Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations</i>, vol. 360, Mathematisches Institut der Universität Bonn, 2003.","chicago":"Browning, Timothy D, and M Swarbick Jones. “Counting Rational Points on Del Pezzo Surfaces of Degree 5.” <i>Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations</i>. Mathematisches Institut der Universität Bonn, 2003.","apa":"Browning, T. D., &#38; Swarbick Jones, M. (2003). Counting rational points on del Pezzo surfaces of degree 5. <i>Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations</i>. Mathematisches Institut der Universität Bonn.","ieee":"T. D. Browning and M. Swarbick Jones, “Counting rational points on del Pezzo surfaces of degree 5,” <i>Proceedings of the Bonn session in analytic number theory and diophantine equations</i>, vol. 360. Mathematisches Institut der Universität Bonn, 2003.","short":"T.D. Browning, M. Swarbick Jones, Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations 360 (2003).","ista":"Browning TD, Swarbick Jones M. 2003. Counting rational points on del Pezzo surfaces of degree 5. Proceedings of the Bonn session in analytic number theory and diophantine equations. 360.","ama":"Browning TD, Swarbick Jones M. Counting rational points on del Pezzo surfaces of degree 5. <i>Proceedings of the Bonn session in analytic number theory and diophantine equations</i>. 2003;360."},"oa":1,"publist_id":"7755","oa_version":"None","day":"01","alternative_title":["Bonner mathematische Schriften"],"type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1311.1665","open_access":"1"}],"author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Swarbick Jones, M","first_name":"M","last_name":"Swarbick Jones"}]},{"publisher":"American Society for Biochemistry and Molecular Biology","doi":"10.1074/jbc.M308247200","citation":{"ista":"Holt P, Morgan D, Sazanov LA. 2003. The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. Journal of Biological Chemistry. 278(44), 43114–43120.","ama":"Holt P, Morgan D, Sazanov LA. The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. <i>Journal of Biological Chemistry</i>. 2003;278(44):43114-43120. doi:<a href=\"https://doi.org/10.1074/jbc.M308247200\">10.1074/jbc.M308247200</a>","short":"P. Holt, D. Morgan, L.A. Sazanov, Journal of Biological Chemistry 278 (2003) 43114–43120.","chicago":"Holt, Peter, David Morgan, and Leonid A Sazanov. “The Location of NuoL and NuoM Subunits in the Membrane Domain of the Escherichia Coli Complex I: Implications for the Mechanism of Proton Pumping.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2003. <a href=\"https://doi.org/10.1074/jbc.M308247200\">https://doi.org/10.1074/jbc.M308247200</a>.","mla":"Holt, Peter, et al. “The Location of NuoL and NuoM Subunits in the Membrane Domain of the Escherichia Coli Complex I: Implications for the Mechanism of Proton Pumping.” <i>Journal of Biological Chemistry</i>, vol. 278, no. 44, American Society for Biochemistry and Molecular Biology, 2003, pp. 43114–20, doi:<a href=\"https://doi.org/10.1074/jbc.M308247200\">10.1074/jbc.M308247200</a>.","ieee":"P. Holt, D. Morgan, and L. A. Sazanov, “The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping,” <i>Journal of Biological Chemistry</i>, vol. 278, no. 44. American Society for Biochemistry and Molecular Biology, pp. 43114–43120, 2003.","apa":"Holt, P., Morgan, D., &#38; Sazanov, L. A. (2003). The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M308247200\">https://doi.org/10.1074/jbc.M308247200</a>"},"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","publication":"Journal of Biological Chemistry","year":"2003","status":"public","acknowledgement":"his work was supported by the Medical Research Council.","publist_id":"5124","type":"journal_article","day":"31","author":[{"full_name":"Holt, Peter J","last_name":"Holt","first_name":"Peter"},{"full_name":"Morgan, David J","first_name":"David","last_name":"Morgan"},{"orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov","full_name":"Leonid Sazanov"}],"issue":"44","page":"43114 - 43120","extern":1,"date_updated":"2021-01-12T06:54:21Z","date_published":"2003-10-31T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:54:55Z","volume":278,"intvolume":"       278","publication_status":"published","month":"10","abstract":[{"lang":"eng","text":"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."}],"_id":"1959"},{"volume":278,"intvolume":"       278","date_created":"2018-12-11T11:54:55Z","date_published":"2003-05-23T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T06:54:21Z","issue":"21","page":"19483 - 19491","extern":1,"_id":"1960","abstract":[{"text":"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.","lang":"eng"}],"month":"05","publication_status":"published","publist_id":"5125","publication":"Journal of Biological Chemistry","title":"A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I)","year":"2003","status":"public","publisher":"American Society for Biochemistry and Molecular Biology","citation":{"ieee":"L. A. Sazanov, J. Carroll, P. Holt, L. Toime, and I. Fearnley, “A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I),” <i>Journal of Biological Chemistry</i>, vol. 278, no. 21. American Society for Biochemistry and Molecular Biology, pp. 19483–19491, 2003.","apa":"Sazanov, L. A., Carroll, J., Holt, P., Toime, L., &#38; Fearnley, I. (2003). A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M208959200\">https://doi.org/10.1074/jbc.M208959200</a>","mla":"Sazanov, Leonid A., et al. “A Role for Native Lipids in the Stabilization and Two Dimensional Crystallization of the Escherichia Coli NADH Ubiquinone Oxidoreductase (Complex I).” <i>Journal of Biological Chemistry</i>, vol. 278, no. 21, American Society for Biochemistry and Molecular Biology, 2003, pp. 19483–91, doi:<a href=\"https://doi.org/10.1074/jbc.M208959200\">10.1074/jbc.M208959200</a>.","chicago":"Sazanov, Leonid A, Joe Carroll, Peter Holt, Laurence Toime, and Ian Fearnley. “A Role for Native Lipids in the Stabilization and Two Dimensional Crystallization of the Escherichia Coli NADH Ubiquinone Oxidoreductase (Complex I).” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2003. <a href=\"https://doi.org/10.1074/jbc.M208959200\">https://doi.org/10.1074/jbc.M208959200</a>.","short":"L.A. Sazanov, J. Carroll, P. Holt, L. Toime, I. Fearnley, Journal of Biological Chemistry 278 (2003) 19483–19491.","ista":"Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. 2003. A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry. 278(21), 19483–19491.","ama":"Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). <i>Journal of Biological Chemistry</i>. 2003;278(21):19483-19491. doi:<a href=\"https://doi.org/10.1074/jbc.M208959200\">10.1074/jbc.M208959200</a>"},"doi":"10.1074/jbc.M208959200","author":[{"orcid":"0000-0002-0977-7989","full_name":"Leonid Sazanov","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joe","last_name":"Carroll","full_name":"Carroll, Joe D"},{"last_name":"Holt","first_name":"Peter","full_name":"Holt, Peter J"},{"last_name":"Toime","first_name":"Laurence","full_name":"Toime, Laurence J"},{"last_name":"Fearnley","first_name":"Ian","full_name":"Fearnley, Ian M"}],"day":"23","type":"journal_article"},{"date_updated":"2021-01-12T06:54:58Z","extern":1,"issue":"3","page":"275 - 295","intvolume":"       108","volume":108,"quality_controlled":0,"date_created":"2018-12-11T11:45:12Z","date_published":"2003-01-01T00:00:00Z","_id":"205","month":"01","publication_status":"published","year":"2003","title":"Counting rational points on cubic and quartic surfaces","publication":"Acta Arithmetica","status":"public","doi":"10.4064/aa108-3-7","citation":{"ama":"Browning TD. Counting rational points on cubic and quartic surfaces. <i>Acta Arithmetica</i>. 2003;108(3):275-295. doi:<a href=\"https://doi.org/10.4064/aa108-3-7\">10.4064/aa108-3-7</a>","ista":"Browning TD. 2003. Counting rational points on cubic and quartic surfaces. Acta Arithmetica. 108(3), 275–295.","short":"T.D. Browning, Acta Arithmetica 108 (2003) 275–295.","apa":"Browning, T. D. (2003). Counting rational points on cubic and quartic surfaces. <i>Acta Arithmetica</i>. Instytut Matematyczny. <a href=\"https://doi.org/10.4064/aa108-3-7\">https://doi.org/10.4064/aa108-3-7</a>","ieee":"T. D. Browning, “Counting rational points on cubic and quartic surfaces,” <i>Acta Arithmetica</i>, vol. 108, no. 3. Instytut Matematyczny, pp. 275–295, 2003.","chicago":"Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.” <i>Acta Arithmetica</i>. Instytut Matematyczny, 2003. <a href=\"https://doi.org/10.4064/aa108-3-7\">https://doi.org/10.4064/aa108-3-7</a>.","mla":"Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.” <i>Acta Arithmetica</i>, vol. 108, no. 3, Instytut Matematyczny, 2003, pp. 275–95, doi:<a href=\"https://doi.org/10.4064/aa108-3-7\">10.4064/aa108-3-7</a>."},"publisher":"Instytut Matematyczny","publist_id":"7707","day":"01","type":"journal_article","author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"}]},{"_id":"206","month":"03","abstract":[{"text":"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 → ∞.","lang":"eng"}],"publication_status":"published","volume":54,"intvolume":"        54","date_created":"2018-12-11T11:45:12Z","quality_controlled":0,"date_published":"2003-03-01T00:00:00Z","date_updated":"2021-01-12T06:55:02Z","page":"33 - 39","extern":1,"issue":"1","author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"}],"day":"01","type":"journal_article","publist_id":"7706","publication":"Quarterly Journal of Mathematics","year":"2003","status":"public","title":"A note on the distribution of rational points on threefolds","doi":"10.1093/qjmath/54.1.33","citation":{"chicago":"Browning, Timothy D. “A Note on the Distribution of Rational Points on Threefolds.” <i>Quarterly Journal of Mathematics</i>. Unknown, 2003. <a href=\"https://doi.org/10.1093/qjmath/54.1.33\">https://doi.org/10.1093/qjmath/54.1.33</a>.","mla":"Browning, Timothy D. “A Note on the Distribution of Rational Points on Threefolds.” <i>Quarterly Journal of Mathematics</i>, vol. 54, no. 1, Unknown, 2003, pp. 33–39, doi:<a href=\"https://doi.org/10.1093/qjmath/54.1.33\">10.1093/qjmath/54.1.33</a>.","ieee":"T. D. Browning, “A note on the distribution of rational points on threefolds,” <i>Quarterly Journal of Mathematics</i>, vol. 54, no. 1. Unknown, pp. 33–39, 2003.","apa":"Browning, T. D. (2003). A note on the distribution of rational points on threefolds. <i>Quarterly Journal of Mathematics</i>. Unknown. <a href=\"https://doi.org/10.1093/qjmath/54.1.33\">https://doi.org/10.1093/qjmath/54.1.33</a>","ista":"Browning TD. 2003. A note on the distribution of rational points on threefolds. Quarterly Journal of Mathematics. 54(1), 33–39.","ama":"Browning TD. A note on the distribution of rational points on threefolds. <i>Quarterly Journal of Mathematics</i>. 2003;54(1):33-39. doi:<a href=\"https://doi.org/10.1093/qjmath/54.1.33\">10.1093/qjmath/54.1.33</a>","short":"T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 33–39."},"publisher":"Unknown"},{"_id":"207","month":"05","publication_status":"published","date_updated":"2021-01-12T06:55:07Z","page":"385 - 395","issue":"3","extern":"1","language":[{"iso":"eng"}],"intvolume":"       134","volume":134,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","date_published":"2003-05-01T00:00:00Z","date_created":"2018-12-11T11:45:12Z","day":"01","type":"journal_article","author":[{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D"}],"title":"Sums of four biquadrates","year":"2003","publication":"Mathematical Proceedings of the Cambridge Philosophical Society","status":"public","publisher":"Cambridge University Press","citation":{"ieee":"T. D. Browning, “Sums of four biquadrates,” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 134, no. 3. Cambridge University Press, pp. 385–395, 2003.","apa":"Browning, T. D. (2003). Sums of four biquadrates. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0305004102006382\">https://doi.org/10.1017/S0305004102006382</a>","mla":"Browning, Timothy D. “Sums of Four Biquadrates.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>, vol. 134, no. 3, Cambridge University Press, 2003, pp. 385–95, doi:<a href=\"https://doi.org/10.1017/S0305004102006382\">10.1017/S0305004102006382</a>.","chicago":"Browning, Timothy D. “Sums of Four Biquadrates.” <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. Cambridge University Press, 2003. <a href=\"https://doi.org/10.1017/S0305004102006382\">https://doi.org/10.1017/S0305004102006382</a>.","short":"T.D. Browning, Mathematical Proceedings of the Cambridge Philosophical Society 134 (2003) 385–395.","ama":"Browning TD. Sums of four biquadrates. <i>Mathematical Proceedings of the Cambridge Philosophical Society</i>. 2003;134(3):385-395. doi:<a href=\"https://doi.org/10.1017/S0305004102006382\">10.1017/S0305004102006382</a>","ista":"Browning TD. 2003. Sums of four biquadrates. Mathematical Proceedings of the Cambridge Philosophical Society. 134(3), 385–395."},"doi":"10.1017/S0305004102006382","oa_version":"None","publist_id":"7704"}]