[{"abstract":[{"text":"We analyze the changes in the mean and variance components of a quantitative trait caused by changes in allele frequencies, concentrating on the effects of genetic drift. We use a general representation of epistasis and dominance that allows an arbitrary relation between genotype and phenotype for any number of diallelic loci. We assume initial and final Hardy-Weinberg and linkage equilibrium in our analyses of drift-induced changes. Random drift generates transient linkage disequilibria that cause correlations between allele frequency fluctuations at different loci. However, we show that these have negligible effects, at least for interactions among small numbers of loci. Our analyses are based on diffusion approximations that summarize the effects of drift in terms of F, the inbreeding coefficient, interpreted as the expected proportional decrease in heterozygosity at each locus. For haploids, the variance of the trait mean after a population bottleneck is var(Δ&amp;#x007a;̄) =inline imagewhere n is the number of loci contributing to the trait variance, VA(1)=VA is the additive genetic variance, and VA(k) is the kth-order additive epistatic variance. The expected additive genetic variance after the bottleneck, denoted (V*A), is closely related to var(Δ&amp;#x007a;̄); (V*A) (1 –F)inline imageThus, epistasis inflates the expected additive variance above VA(1 –F), the expectation under additivity. For haploids (and diploids without dominance), the expected value of every variance component is inflated by the existence of higher order interactions (e.g., third-order epistasis inflates (V*AA)). This is not true in general with diploidy, because dominance alone can reduce (V*A) below VA(1 –F) (e.g., when dominant alleles are rare). Without dominance, diploidy produces simple expressions: var(Δ&amp;#x007a;̄)=inline image=1 (2F) kVA(k) and (V*A) = (1 –F)inline imagek(2F)k-1VA(k) With dominance (and even without epistasis), var(Δ&amp;#x007a;̄)and (V*A) no longer depend solely on the variance components in the base population. For small F, the expected additive variance simplifies to (V*A)(1 –F) VA+ 4FVAA+2FVD+2FCAD, where CAD is a sum of two terms describing covariances between additive effects and dominance and additive × dominance interactions. Whether population bottlenecks lead to expected increases in additive variance depends primarily on the ratio of nonadditive to additive genetic variance in the base population, but dominance precludes simple predictions based solely on variance components. We illustrate these results using a model in which genotypic values are drawn at random, allowing extreme and erratic epistatic interactions. Although our analyses clarify the conditions under which drift is expected to increase VA, we question the evolutionary importance of such increases.","lang":"eng"}],"month":"10","publication_status":"published","_id":"3614","page":"2111 - 2132","issue":"10","extern":1,"date_updated":"2021-01-12T07:44:40Z","date_published":"2004-10-01T00:00:00Z","date_created":"2018-12-11T12:04:15Z","quality_controlled":0,"intvolume":"        58","volume":58,"type":"journal_article","day":"01","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Turelli","first_name":"Michael","full_name":"Turelli, Michael"}],"doi":"10.1111/j.0014-3820.2004.tb01591.x","citation":{"ama":"Barton NH, Turelli M. Effects of allele frequency changes on variance components under a general model of epistasis. <i>Evolution; International Journal of Organic Evolution</i>. 2004;58(10):2111-2132. doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">10.1111/j.0014-3820.2004.tb01591.x</a>","ista":"Barton NH, Turelli M. 2004. Effects of allele frequency changes on variance components under a general model of epistasis. Evolution; International Journal of Organic Evolution. 58(10), 2111–2132.","short":"N.H. Barton, M. Turelli, Evolution; International Journal of Organic Evolution 58 (2004) 2111–2132.","apa":"Barton, N. H., &#38; Turelli, M. (2004). Effects of allele frequency changes on variance components under a general model of epistasis. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">https://doi.org/10.1111/j.0014-3820.2004.tb01591.x</a>","ieee":"N. H. Barton and M. Turelli, “Effects of allele frequency changes on variance components under a general model of epistasis,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 58, no. 10. Wiley-Blackwell, pp. 2111–2132, 2004.","chicago":"Barton, Nicholas H, and Michael Turelli. “Effects of Allele Frequency Changes on Variance Components under a General Model of Epistasis.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">https://doi.org/10.1111/j.0014-3820.2004.tb01591.x</a>.","mla":"Barton, Nicholas H., and Michael Turelli. “Effects of Allele Frequency Changes on Variance Components under a General Model of Epistasis.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 58, no. 10, Wiley-Blackwell, 2004, pp. 2111–32, doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">10.1111/j.0014-3820.2004.tb01591.x</a>."},"publisher":"Wiley-Blackwell","title":"Effects of allele frequency changes on variance components under a general model of epistasis","publication":"Evolution; International Journal of Organic Evolution","year":"2004","status":"public","publist_id":"2769"},{"publist_id":"2768","title":"Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions","publication":"Genetics","year":"2004","status":"public","publisher":"Genetics Society of America","citation":{"ista":"Turelli M, Barton NH. 2004. Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. Genetics. 166(2), 1053–1079.","ama":"Turelli M, Barton NH. Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. <i>Genetics</i>. 2004;166(2):1053-1079. doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1053\">10.1534/genetics.166.2.1053</a>","short":"M. Turelli, N.H. Barton, Genetics 166 (2004) 1053–1079.","chicago":"Turelli, Michael, and Nicholas H Barton. “Polygenic Variation Maintained by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.” <i>Genetics</i>. Genetics Society of America, 2004. <a href=\"https://doi.org/10.1534/genetics.166.2.1053\">https://doi.org/10.1534/genetics.166.2.1053</a>.","mla":"Turelli, Michael, and Nicholas H. Barton. “Polygenic Variation Maintained by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.” <i>Genetics</i>, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1053–79, doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1053\">10.1534/genetics.166.2.1053</a>.","apa":"Turelli, M., &#38; Barton, N. H. (2004). Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.166.2.1053\">https://doi.org/10.1534/genetics.166.2.1053</a>","ieee":"M. Turelli and N. H. Barton, “Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions,” <i>Genetics</i>, vol. 166, no. 2. Genetics Society of America, pp. 1053–1079, 2004."},"doi":"10.1534/genetics.166.2.1053","author":[{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"},{"full_name":"Nicholas Barton","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"day":"01","type":"journal_article","volume":166,"intvolume":"       166","quality_controlled":0,"date_created":"2018-12-11T12:04:15Z","date_published":"2004-02-01T00:00:00Z","date_updated":"2021-01-12T07:44:41Z","page":"1053 - 1079","issue":"2","extern":1,"_id":"3615","publication_status":"published","month":"02","abstract":[{"text":"We investigate three alternative selection-based scenarios proposed to maintain polygenic variation: pleiotropic balancing selection, G x E interactions (with spatial or temporal variation in allelic effects), and sex-dependent allelic effects. Each analysis assumes an additive polygenic trait with n diallelic loci under stabilizing selection. We allow loci to have different effects and consider equilibria at which the population mean departs from the stabilizing-selection optimum. Under weak selection, each model produces essentially identical, approximate allele-frequency dynamics. Variation is maintained under pleiotropic balancing selection only at loci for which the strength of balancing selection exceeds the effective strength of stabilizing selection. In addition, for all models, polymorphism requires that the population mean be close enough to the optimum that directional selection does not overwhelm balancing selection. This balance allows many simultaneously stable equilibria, and we explore their properties numerically. Both spatial and temporal G x E can maintain variation at loci for which the coefficient of variation (across environments) of the effect of a substitution exceeds a critical value greater than one. The critical value depends on the correlation between substitution effects at different loci. For large positive correlations (e.g., ρ2ij &gt; 3/4), even extreme fluctuations in allelic effects cannot maintain variation. Surprisingly, this constraint on correlations implies that sex-dependent allelic effects cannot maintain polygenic variation. We present numerical results that support our analytical approximations and discuss our results in connection to relevant data and alternative variance-maintaining mechanisms.","lang":"eng"}]},{"type":"review","day":"10","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Nicholas Barton"}],"publisher":"Cell Press","citation":{"chicago":"Barton, Nicholas H. “Speciation: Why, How, Where and When?” <i>Current Biology</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">https://doi.org/10.1016/j.cub.2004.07.037</a>.","mla":"Barton, Nicholas H. “Speciation: Why, How, Where and When?” <i>Current Biology</i>, vol. 14, no. 15, Cell Press, 2004, pp. R603–04, doi:<a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">10.1016/j.cub.2004.07.037</a>.","apa":"Barton, N. H. (2004). Speciation: Why, how, where and when? <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">https://doi.org/10.1016/j.cub.2004.07.037</a>","ieee":"N. H. Barton, “Speciation: Why, how, where and when?,” <i>Current Biology</i>, vol. 14, no. 15. Cell Press, pp. R603–R604, 2004.","ama":"Barton NH. Speciation: Why, how, where and when? <i>Current Biology</i>. 2004;14(15):R603-R604. doi:<a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">10.1016/j.cub.2004.07.037</a>","ista":"Barton NH. 2004. Speciation: Why, how, where and when? Current Biology. 14(15), R603–R604.","short":"N.H. Barton, Current Biology 14 (2004) R603–R604."},"doi":"10.1016/j.cub.2004.07.037","status":"public","year":"2004","title":"Speciation: Why, how, where and when?","publication":"Current Biology","publist_id":"2767","publication_status":"published","month":"08","_id":"3616","page":"R603 - R604","extern":1,"issue":"15","date_updated":"2019-04-26T07:22:31Z","date_created":"2018-12-11T12:04:16Z","quality_controlled":0,"date_published":"2004-08-10T00:00:00Z","intvolume":"        14","volume":14},{"publist_id":"2766","year":"2004","title":"The effect of selection on genealogies","status":"public","publication":"Genetics","doi":"10.1534/genetics.166.2.1115","citation":{"short":"N.H. Barton, A. Etheridge, Genetics 166 (2004) 1115–1131.","ista":"Barton NH, Etheridge A. 2004. The effect of selection on genealogies. Genetics. 166(2), 1115–1131.","ama":"Barton NH, Etheridge A. The effect of selection on genealogies. <i>Genetics</i>. 2004;166(2):1115-1131. doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1115\">10.1534/genetics.166.2.1115</a>","mla":"Barton, Nicholas H., and Alison Etheridge. “The Effect of Selection on Genealogies.” <i>Genetics</i>, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1115–31, doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1115\">10.1534/genetics.166.2.1115</a>.","chicago":"Barton, Nicholas H, and Alison Etheridge. “The Effect of Selection on Genealogies.” <i>Genetics</i>. Genetics Society of America, 2004. <a href=\"https://doi.org/10.1534/genetics.166.2.1115\">https://doi.org/10.1534/genetics.166.2.1115</a>.","apa":"Barton, N. H., &#38; Etheridge, A. (2004). The effect of selection on genealogies. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.166.2.1115\">https://doi.org/10.1534/genetics.166.2.1115</a>","ieee":"N. H. Barton and A. Etheridge, “The effect of selection on genealogies,” <i>Genetics</i>, vol. 166, no. 2. Genetics Society of America, pp. 1115–1131, 2004."},"publisher":"Genetics Society of America","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison M"}],"day":"01","type":"journal_article","intvolume":"       166","volume":166,"date_published":"2004-02-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T12:04:16Z","date_updated":"2021-01-12T07:44:41Z","page":"1115 - 1131","issue":"2","extern":1,"_id":"3617","publication_status":"published","month":"02","abstract":[{"lang":"eng","text":"The coalescent process can describe the effects of selection at linked loci only if selection is so strong that genotype frequencies evolve deterministically. Here, we develop methods proposed by Kaplan, Darden, and Hudson to find the effects of weak selection. We show that the overall effect is given by an extension to Price's equation: the change in properties such as moments of coalescence times is equal to the covariance between those properties and the fitness of the sample of genes. The distribution of coalescence times differs substantially between allelic classes, even in the absence of selection. However, the average coalescence time between randomly chosen genes is insensitive to the current allele frequency and is affected significantly by purifying selection only if deleterious mutations are common and selection is strong (i.e., the product of population size and selection coefficient, Ns &gt; 3). Balancing selection increases mean coalescence times, but the effect becomes large only when mutation rates between allelic classes are low and when selection is extremely strong. Our analysis supports previous simulations that show that selection has surprisingly little effect on genealogies. Moreover, small fluctuations in allele frequency due to random drift can greatly reduce any such effects. This will make it difficult to detect the action of selection from neutral variation alone."}]},{"date_updated":"2021-01-12T07:48:58Z","extern":1,"page":"198 - 200","quality_controlled":0,"date_published":"2004-01-01T00:00:00Z","date_created":"2018-12-11T12:04:38Z","_id":"3688","publication_status":"published","month":"01","abstract":[{"lang":"eng","text":"Capturing images of documents using handheld digital cameras has a variety of applications in academia, research, knowledge management, retail, and office settings. The ultimate goal of such systems is to achieve image quality comparable to that currently achieved with flatbed scanners even for curved, warped, or curled pages. This can be achieved by high-accuracy 3D modeling of the page surface, followed by a &quot;flattening&quot; of the surface. A number of previous systems have either assumed only perspective distortions, or used techniques like structured lighting, shading, or side-imaging for obtaining 3D shape. This paper describes a system for handheld camera-based document capture using general purpose stereo vision methods followed by a new document dewarping technique. Examples of shape modeling and dewarping of book images is shown."}],"year":"2004","status":"public","title":"Document capture using stereo vision","doi":"10.1145/1030397.1030434","citation":{"ista":"Ulges A, Lampert C, Breuel T. 2004. Document capture using stereo vision. DocEng: ACM Symposium on Document Engineering, 198–200.","ama":"Ulges A, Lampert C, Breuel T. Document capture using stereo vision. In: ACM; 2004:198-200. doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>","short":"A. Ulges, C. Lampert, T. Breuel, in:, ACM, 2004, pp. 198–200.","chicago":"Ulges, Adrian, Christoph Lampert, and Thomas Breuel. “Document Capture Using Stereo Vision,” 198–200. ACM, 2004. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>.","mla":"Ulges, Adrian, et al. <i>Document Capture Using Stereo Vision</i>. ACM, 2004, pp. 198–200, doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>.","ieee":"A. Ulges, C. Lampert, and T. Breuel, “Document capture using stereo vision,” presented at the DocEng: ACM Symposium on Document Engineering, 2004, pp. 198–200.","apa":"Ulges, A., Lampert, C., &#38; Breuel, T. (2004). Document capture using stereo vision (pp. 198–200). Presented at the DocEng: ACM Symposium on Document Engineering, ACM. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>"},"publisher":"ACM","publist_id":"2679","day":"01","conference":{"name":"DocEng: ACM Symposium on Document Engineering"},"type":"conference","main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/~chl/papers/ulges-doceng2004.pdf"}],"author":[{"full_name":"Ulges, Adrian","first_name":"Adrian","last_name":"Ulges"},{"full_name":"Christoph Lampert","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"first_name":"Thomas","last_name":"Breuel","full_name":"Breuel,Thomas M"}]},{"_id":"3805","month":"01","publication_status":"published","abstract":[{"text":"The operation of neuronal networks crucially depends on a fast time course of signaling in inhibitory interneurons. Synapses that excite interneurons generate fast currents, owing to the expression of glutamate receptors of specific subunit composition. Interneurons generate brief action potentials in response to transient synaptic activation and discharge repetitively at very high frequencies during sustained stimulation. The ability to generate short-duration action potentials at high frequencies depends on the expression of specific voltage-gated K+ channels. Factors facilitating fast action potential initiation following synaptic excitation include depolarized interneuron resting potential, subthreshold conductances and active dendrites. Finally, GABA release at interneuron output synapses is rapid and highly synchronized, leading to a faster inhibition in postsynaptic interneurons than in principal cells. Thus, the expression of distinct transmitter receptors and voltage-gated ion channels ensures that interneurons operate with high speed and temporal precision.","lang":"eng"}],"date_updated":"2021-01-12T07:52:19Z","extern":1,"issue":"1","page":"30 - 40","volume":27,"intvolume":"        27","date_created":"2018-12-11T12:05:16Z","date_published":"2004-01-01T00:00:00Z","quality_controlled":0,"day":"01","type":"journal_article","author":[{"first_name":"Peter M","last_name":"Jonas","full_name":"Peter Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"last_name":"Bischofberger","first_name":"Josef","full_name":"Bischofberger, Josef"},{"full_name":"Fricker, Desdemona","last_name":"Fricker","first_name":"Desdemona"},{"last_name":"Miles","first_name":"Richard","full_name":"Miles, Richard"}],"publication":"Trends in Neurosciences","year":"2004","title":"Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons","status":"public","doi":"doi:10.1016/j.tins.2003.10.010","citation":{"short":"P.M. Jonas, J. Bischofberger, D. Fricker, R. Miles, Trends in Neurosciences 27 (2004) 30–40.","ama":"Jonas PM, Bischofberger J, Fricker D, Miles R. Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. <i>Trends in Neurosciences</i>. 2004;27(1):30-40. doi:<a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">doi:10.1016/j.tins.2003.10.010</a>","ista":"Jonas PM, Bischofberger J, Fricker D, Miles R. 2004. Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. Trends in Neurosciences. 27(1), 30–40.","apa":"Jonas, P. M., Bischofberger, J., Fricker, D., &#38; Miles, R. (2004). Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. <i>Trends in Neurosciences</i>. Elsevier. <a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">https://doi.org/doi:10.1016/j.tins.2003.10.010</a>","ieee":"P. M. Jonas, J. Bischofberger, D. Fricker, and R. Miles, “Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons,” <i>Trends in Neurosciences</i>, vol. 27, no. 1. Elsevier, pp. 30–40, 2004.","mla":"Jonas, Peter M., et al. “Interneuron Diversity Series: Fast in, Fast out--Temporal and Spatial Signal Processing in Hippocampal Interneurons.” <i>Trends in Neurosciences</i>, vol. 27, no. 1, Elsevier, 2004, pp. 30–40, doi:<a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">doi:10.1016/j.tins.2003.10.010</a>.","chicago":"Jonas, Peter M, Josef Bischofberger, Desdemona Fricker, and Richard Miles. “Interneuron Diversity Series: Fast in, Fast out--Temporal and Spatial Signal Processing in Hippocampal Interneurons.” <i>Trends in Neurosciences</i>. Elsevier, 2004. <a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">https://doi.org/doi:10.1016/j.tins.2003.10.010</a>."},"publisher":"Elsevier","publist_id":"2404"},{"author":[{"full_name":"Kampa, Bjorn M","first_name":"Bjorn","last_name":"Kampa"},{"full_name":"Clements, John","last_name":"Clements","first_name":"John"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Greg","last_name":"Stuart","full_name":"Stuart, Greg J"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1664940/","open_access":"1"}],"type":"journal_article","day":"01","publist_id":"2403","oa":1,"doi":"10.1113/jphysiol.2003.058842 ","citation":{"ama":"Kampa B, Clements J, Jonas PM, Stuart G. Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. <i>Journal of Physiology</i>. 2004;556(Pt 2):337-345. doi:<a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">10.1113/jphysiol.2003.058842 </a>","ista":"Kampa B, Clements J, Jonas PM, Stuart G. 2004. Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. Journal of Physiology. 556(Pt 2), 337–45.","short":"B. Kampa, J. Clements, P.M. Jonas, G. Stuart, Journal of Physiology 556 (2004) 337–45.","chicago":"Kampa, Bjorn, John Clements, Peter M Jonas, and Greg Stuart. “Kinetics of Mg(2+) Unblock of NMDA Receptors: Implications for Spike-Timing Dependent Synaptic Plasticity.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">https://doi.org/10.1113/jphysiol.2003.058842 </a>.","mla":"Kampa, Bjorn, et al. “Kinetics of Mg(2+) Unblock of NMDA Receptors: Implications for Spike-Timing Dependent Synaptic Plasticity.” <i>Journal of Physiology</i>, vol. 556, no. Pt 2, Wiley-Blackwell, 2004, pp. 337–45, doi:<a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">10.1113/jphysiol.2003.058842 </a>.","ieee":"B. Kampa, J. Clements, P. M. Jonas, and G. Stuart, “Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity,” <i>Journal of Physiology</i>, vol. 556, no. Pt 2. Wiley-Blackwell, pp. 337–45, 2004.","apa":"Kampa, B., Clements, J., Jonas, P. M., &#38; Stuart, G. (2004). Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">https://doi.org/10.1113/jphysiol.2003.058842 </a>"},"publisher":"Wiley-Blackwell","status":"public","publication":"Journal of Physiology","year":"2004","title":"Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity","month":"01","abstract":[{"text":"The time course of Mg(2+) block and unblock of NMDA receptors (NMDARs) determines the extent they are activated by depolarization. Here, we directly measure the rate of NMDAR channel opening in response to depolarizations at different times after brief (1 ms) and sustained (4.6 s) applications of glutamate to nucleated patches from neocortical pyramidal neurons. The kinetics of Mg(2+) unblock were found to be non-instantaneous and complex, consisting of a prominent fast component (time constant approximately 100 micros) and slower components (time constants 4 and approximately 300 ms), the relative amplitudes of which depended on the timing of the depolarizing pulse. Fitting a kinetic model to these data indicated that Mg(2+) not only blocks the NMDAR channel, but reduces both the open probability and affinity for glutamate, while enhancing desensitization. These effects slow the rate of NMDAR channel opening in response to depolarization in a time-dependent manner such that the slower components of Mg(2+) unblock are enhanced during depolarizations at later times after glutamate application. One physiological consequence of this is that brief depolarizations occurring earlier in time after glutamate application are better able to open NMDAR channels. This finding has important implications for spike-timing-dependent synaptic plasticity (STDP), where the precise (millisecond) timing of action potentials relative to synaptic inputs determines the magnitude and sign of changes in synaptic strength. Indeed, we find that STDP timing curves of NMDAR channel activation elicited by realistic dendritic action potential waveforms are narrower than expected assuming instantaneous Mg(2+) unblock, indicating that slow Mg(2+) unblock of NMDAR channels makes the STDP timing window more precise.","lang":"eng"}],"publication_status":"published","_id":"3807","date_created":"2018-12-11T12:05:17Z","quality_controlled":0,"date_published":"2004-01-01T00:00:00Z","intvolume":"       556","volume":556,"page":"337 - 45","extern":1,"issue":"Pt 2","date_updated":"2021-01-12T07:52:20Z"},{"month":"01","abstract":[{"text":"Neural stem cells in various regions of the vertebrate brain continuously generate neurons throughout life. In the mammalian hippocampus, a region important for spatial and episodic memory, thousands of new granule cells are produced per day, with the exact number depending on environmental conditions and physical exercise. The survival of these neurons is improved by learning and conversely learning may be promoted by neurogenesis. Although it has been suggested that newly generated neurons may have specific properties to facilitate learning, the cellular and synaptic mechanisms of plasticity in these neurons are largely unknown. Here we show that young granule cells in the adult hippocampus differ substantially from mature granule cells in both active and passive membrane properties. In young neurons, T-type Ca2+ channels can generate isolated Ca2+ spikes and boost fast Na+ action potentials, contributing to the induction of synaptic plasticity. Associative long-term potentiation can be induced more easily in young neurons than in mature neurons under identical conditions. Thus, newly generated neurons express unique mechanisms to facilitate synaptic plasticity, which may be important for the formation of new memories.","lang":"eng"}],"publication_status":"published","_id":"3809","issue":"6988","extern":1,"page":"184 - 7","date_updated":"2021-01-12T07:52:21Z","date_created":"2018-12-11T12:05:17Z","quality_controlled":0,"date_published":"2004-01-01T00:00:00Z","intvolume":"       429","volume":429,"type":"journal_article","day":"01","author":[{"last_name":"Schmidt Hieber","first_name":"Christoph","full_name":"Schmidt-Hieber, Christoph"},{"orcid":"0000-0001-5001-4804","full_name":"Peter Jonas","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bischofberger, Josef","last_name":"Bischofberger","first_name":"Josef"}],"publisher":"Nature Publishing Group","citation":{"short":"C. Schmidt Hieber, P.M. Jonas, J. Bischofberger, Nature 429 (2004) 184–7.","ista":"Schmidt Hieber C, Jonas PM, Bischofberger J. 2004. Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. Nature. 429(6988), 184–7.","ama":"Schmidt Hieber C, Jonas PM, Bischofberger J. Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. <i>Nature</i>. 2004;429(6988):184-187. doi:<a href=\"https://doi.org/10.1038/nature02553\">10.1038/nature02553</a>","mla":"Schmidt Hieber, Christoph, et al. “Enhanced Synaptic Plasticity in Newly Generated Granule Cells of the Adult Hippocampus.” <i>Nature</i>, vol. 429, no. 6988, Nature Publishing Group, 2004, pp. 184–87, doi:<a href=\"https://doi.org/10.1038/nature02553\">10.1038/nature02553</a>.","chicago":"Schmidt Hieber, Christoph, Peter M Jonas, and Josef Bischofberger. “Enhanced Synaptic Plasticity in Newly Generated Granule Cells of the Adult Hippocampus.” <i>Nature</i>. Nature Publishing Group, 2004. <a href=\"https://doi.org/10.1038/nature02553\">https://doi.org/10.1038/nature02553</a>.","ieee":"C. Schmidt Hieber, P. M. Jonas, and J. Bischofberger, “Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus,” <i>Nature</i>, vol. 429, no. 6988. Nature Publishing Group, pp. 184–7, 2004.","apa":"Schmidt Hieber, C., Jonas, P. M., &#38; Bischofberger, J. (2004). Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature02553\">https://doi.org/10.1038/nature02553</a>"},"doi":"10.1038/nature02553","year":"2004","title":"Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus","publication":"Nature","status":"public","publist_id":"2401"},{"author":[{"first_name":"Dominik","last_name":"Oliver","full_name":"Oliver, Dominik"},{"full_name":"Lien, Cheng-Chang","first_name":"Cheng","last_name":"Lien"},{"full_name":"Soom, Malle","last_name":"Soom","first_name":"Malle"},{"full_name":"Baukrowitz, Thomas","first_name":"Thomas","last_name":"Baukrowitz"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fakler, Bernd","last_name":"Fakler","first_name":"Bernd"}],"type":"journal_article","day":"01","publist_id":"2402","publisher":"American Association for the Advancement of Science","citation":{"apa":"Oliver, D., Lien, C., Soom, M., Baukrowitz, T., Jonas, P. M., &#38; Fakler, B. (2004). Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1094113\">https://doi.org/10.1126/science.1094113</a>","ieee":"D. Oliver, C. Lien, M. Soom, T. Baukrowitz, P. M. Jonas, and B. Fakler, “Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids,” <i>Science</i>, vol. 304, no. 5668. American Association for the Advancement of Science, pp. 265–70, 2004.","mla":"Oliver, Dominik, et al. “Functional Conversion between A-Type and Delayed Rectifier K+ Channels by Membrane Lipids.” <i>Science</i>, vol. 304, no. 5668, American Association for the Advancement of Science, 2004, pp. 265–70, doi:<a href=\"https://doi.org/10.1126/science.1094113\">10.1126/science.1094113</a>.","chicago":"Oliver, Dominik, Cheng Lien, Malle Soom, Thomas Baukrowitz, Peter M Jonas, and Bernd Fakler. “Functional Conversion between A-Type and Delayed Rectifier K+ Channels by Membrane Lipids.” <i>Science</i>. American Association for the Advancement of Science, 2004. <a href=\"https://doi.org/10.1126/science.1094113\">https://doi.org/10.1126/science.1094113</a>.","short":"D. Oliver, C. Lien, M. Soom, T. Baukrowitz, P.M. Jonas, B. Fakler, Science 304 (2004) 265–70.","ista":"Oliver D, Lien C, Soom M, Baukrowitz T, Jonas PM, Fakler B. 2004. Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. Science. 304(5668), 265–70.","ama":"Oliver D, Lien C, Soom M, Baukrowitz T, Jonas PM, Fakler B. Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. <i>Science</i>. 2004;304(5668):265-270. doi:<a href=\"https://doi.org/10.1126/science.1094113\">10.1126/science.1094113</a>"},"doi":"10.1126/science.1094113","year":"2004","title":"Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids","publication":"Science","status":"public","abstract":[{"text":"Voltage-gated potassium (Kv) channels control action potential repolarization, interspike membrane potential, and action potential frequency in excitable cells. It is thought that the combinatorial association between distinct alpha and beta subunits determines whether Kv channels function as non-inactivating delayed rectifiers or as rapidly inactivating A-type channels. We show that membrane lipids can convert A-type channels into delayed rectifiers and vice versa. Phosphoinositides remove N-type inactivation from A-type channels by immobilizing the inactivation domains. Conversely, arachidonic acid and its amide anandamide endow delayed rectifiers with rapid voltage-dependent inactivation. The bidirectional control of Kv channel gating by lipids may provide a mechanism for the dynamic regulation of electrical signaling in the nervous system.","lang":"eng"}],"publication_status":"published","month":"01","_id":"3810","quality_controlled":0,"date_created":"2018-12-11T12:05:18Z","date_published":"2004-01-01T00:00:00Z","intvolume":"       304","volume":304,"page":"265 - 70","extern":1,"issue":"5668","date_updated":"2021-01-12T07:52:22Z"},{"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"full_name":"Jurdziński, Marcin","first_name":"Marcin","last_name":"Jurdziński"}],"day":"09","alternative_title":["LNCS "],"type":"conference","conference":{"name":"CSL: Computer Science Logic"},"publist_id":"2264","year":"2004","status":"public","title":"On Nash equilibria in stochastic games","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, ONR grant N00014-02-1-0671, NSF grants CCR-9988172 and CCR-0225610","publisher":"Springer","doi":"10.1007/978-3-540-30124-0_6","citation":{"apa":"Chatterjee, K., Majumdar, R., &#38; Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">https://doi.org/10.1007/978-3-540-30124-0_6</a>","ieee":"K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic games,” presented at the CSL: Computer Science Logic, 2004, vol. 3210, pp. 26–40.","chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash Equilibria in Stochastic Games,” 3210:26–40. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">https://doi.org/10.1007/978-3-540-30124-0_6</a>.","mla":"Chatterjee, Krishnendu, et al. <i>On Nash Equilibria in Stochastic Games</i>. Vol. 3210, Springer, 2004, pp. 26–40, doi:<a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">10.1007/978-3-540-30124-0_6</a>.","ama":"Chatterjee K, Majumdar R, Jurdziński M. On Nash equilibria in stochastic games. In: Vol 3210. Springer; 2004:26-40. doi:<a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">10.1007/978-3-540-30124-0_6</a>","ista":"Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic games. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.","short":"K. Chatterjee, R. Majumdar, M. Jurdziński, in:, Springer, 2004, pp. 26–40."},"_id":"3894","month":"09","abstract":[{"text":"We study infinite stochastic games played by n-players on a finite graph with goals given by sets of infinite traces. The games are stochastic (each player simultaneously and independently chooses an action at each round, and the next state is determined by a probability distribution depending on the current state and the chosen actions), infinite (the game continues for an infinite number of rounds), nonzero sum (the players' goals are not necessarily conflicting), and undiscounted. We show that if each player has a reachability objective, that is, if the goal for each player i is to visit some subset R-i of the states, then there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon &gt; 0. However, exact Nash equilibria need not exist. We study the complexity of finding such Nash equilibria, and show that the payoff of some epsilon-Nash equilibrium in memoryless strategies can be epsilon-approximated in NP. We study the important subclass of n-player turn-based probabilistic games, where at each state at most one player has a nontrivial choice of moves. For turn-based probabilistic games, we show the existence of epsilon-Nash equilibria in pure strategies for games where the objective of player i is a Borel set B-i of infinite traces. However, exact Nash equilibria may not exist. For the special case of omega-regular objectives, we show exact Nash equilibria exist, and can be computed in NP when the omega-regular objectives are expressed as parity objectives.","lang":"eng"}],"publication_status":"published","intvolume":"      3210","volume":3210,"date_published":"2004-09-09T00:00:00Z","date_created":"2018-12-11T12:05:45Z","quality_controlled":0,"date_updated":"2021-01-12T07:53:01Z","page":"26 - 40","extern":1},{"date_published":"2004-08-09T00:00:00Z","date_created":"2018-12-11T12:05:45Z","quality_controlled":0,"date_updated":"2021-01-12T07:53:01Z","extern":1,"page":"160 - 169","_id":"3895","publication_status":"published","abstract":[{"text":"In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with multiple components. There, instead of proving that each component satisfies its specification no matter how the other components behave, it often suffices to prove that each component satisfies its specification provided that the other components satisfy their specifications. We say that a Nash equilibrium is secure if it is an equilibrium with respect to the lexicographic objectives of both players. We prove that in graph games with Borel objectives, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of secure equilibria. We show how this equilibrium can be computed in the case of omega-regular objectives, and we characterize the memory requirements of strategies that achieve the equilibrium.","lang":"eng"}],"month":"08","publist_id":"2262","title":"Games with secure equilibria","year":"2004","status":"public","publisher":"IEEE","doi":"10.1109/LICS.2004.1319610","citation":{"short":"K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2004, pp. 160–169.","ama":"Chatterjee K, Henzinger TA, Jurdziński M. Games with secure equilibria. In: IEEE; 2004:160-169. doi:<a href=\"https://doi.org/10.1109/LICS.2004.1319610\">10.1109/LICS.2004.1319610</a>","ista":"Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science, 160–169.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the LICS: Logic in Computer Science, 2004, pp. 160–169.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2004.1319610\">https://doi.org/10.1109/LICS.2004.1319610</a>","mla":"Chatterjee, Krishnendu, et al. <i>Games with Secure Equilibria</i>. IEEE, 2004, pp. 160–69, doi:<a href=\"https://doi.org/10.1109/LICS.2004.1319610\">10.1109/LICS.2004.1319610</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 160–69. IEEE, 2004. <a href=\"https://doi.org/10.1109/LICS.2004.1319610\">https://doi.org/10.1109/LICS.2004.1319610</a>."},"author":[{"full_name":"Krishnendu Chatterjee","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marcin","last_name":"Jurdziński","full_name":"Jurdziński, Marcin"}],"day":"09","type":"conference","conference":{"name":"LICS: Logic in Computer Science"}},{"volume":51,"intvolume":"        51","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:05:53Z","date_published":"2004-08-19T00:00:00Z","date_updated":"2021-01-12T07:53:11Z","page":"275 - 278","issue":"3","extern":"1","_id":"3918","publication_status":"published","month":"08","abstract":[{"lang":"eng","text":"Wingless (ergatoid) males of the tramp ant Cardiocondyla minutior attack and kill their young ergatoid rivals and thus attempt to monopolize mating with female sexuals reared in the colony. Because of the different strength of local mate competition in colonies with one or several reproductive queens, we expected the production of new ergatoid males to vary with queen number. Sex ratios were mostly female-biased, but in contrast to the sympatric species C. obscurior (Cremer and Heinze, 2002) neither the percentage of ergatoid males nor of female sexuals among the first 20 sexuals produced varied considerably with queen number. As in C. obscurior, experimental colony fragmentation led to the production of winged males, whereas in unfragmented control colonies only ergatoid males eclosed."}],"oa_version":"None","publist_id":"2236","title":"Production of winged and wingless males in the ant, Cardiocondyla minutior","publication":"Insectes Sociaux","status":"public","year":"2004","publisher":"Springer","doi":"10.1007/s00040-004-0740-6","citation":{"mla":"Heinze, Jürgen, et al. “Production of Winged and Wingless Males in the Ant, Cardiocondyla Minutior.” <i>Insectes Sociaux</i>, vol. 51, no. 3, Springer, 2004, pp. 275–78, doi:<a href=\"https://doi.org/10.1007/s00040-004-0740-6\">10.1007/s00040-004-0740-6</a>.","chicago":"Heinze, Jürgen, A. Böttcher, and Sylvia Cremer. “Production of Winged and Wingless Males in the Ant, Cardiocondyla Minutior.” <i>Insectes Sociaux</i>. Springer, 2004. <a href=\"https://doi.org/10.1007/s00040-004-0740-6\">https://doi.org/10.1007/s00040-004-0740-6</a>.","apa":"Heinze, J., Böttcher, A., &#38; Cremer, S. (2004). Production of winged and wingless males in the ant, Cardiocondyla minutior. <i>Insectes Sociaux</i>. Springer. <a href=\"https://doi.org/10.1007/s00040-004-0740-6\">https://doi.org/10.1007/s00040-004-0740-6</a>","ieee":"J. Heinze, A. Böttcher, and S. Cremer, “Production of winged and wingless males in the ant, Cardiocondyla minutior,” <i>Insectes Sociaux</i>, vol. 51, no. 3. Springer, pp. 275–278, 2004.","short":"J. Heinze, A. Böttcher, S. Cremer, Insectes Sociaux 51 (2004) 275–278.","ama":"Heinze J, Böttcher A, Cremer S. Production of winged and wingless males in the ant, Cardiocondyla minutior. <i>Insectes Sociaux</i>. 2004;51(3):275-278. doi:<a href=\"https://doi.org/10.1007/s00040-004-0740-6\">10.1007/s00040-004-0740-6</a>","ista":"Heinze J, Böttcher A, Cremer S. 2004. Production of winged and wingless males in the ant, Cardiocondyla minutior. Insectes Sociaux. 51(3), 275–278."},"author":[{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"},{"last_name":"Böttcher","first_name":"A.","full_name":"Böttcher, A."},{"orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"day":"19","type":"journal_article"},{"intvolume":"        13","volume":13,"quality_controlled":0,"date_created":"2018-12-11T12:05:56Z","date_published":"2004-01-30T00:00:00Z","date_updated":"2021-01-12T07:53:16Z","extern":1,"issue":"2","page":"179 - 190","_id":"3929","abstract":[{"lang":"eng","text":"The Nef protein of human and simian immunodeficiency virus (HIV/SIV) is believed to interfere with T cell activation signals by forming a signaling complex at the plasma membrane. Composition and function of the complex are not fully understood. Here we report that Nef recruits the Polycomb Group (PcG) protein Eed, so far known as a nuclear factor and repressor of transcription, to the membrane of cells. The Nef-induced translocation of Eed led to a potent stimulation of Tat-dependent HIV transcription, implying that Eed removal from the nucleus is required for optimal Tat function. Similar to Nef action, activation of integrin receptors recruited Eed to the plasma membrane, also leading to enhanced Tat/Nef-mediated transcription. Our results suggest a link between membrane-associated activation processes and transcriptional derepression and demonstrate how HIV exploits this mechanism."}],"publication_status":"published","month":"01","publist_id":"2197","publication":"Molecular Cell","title":"HIV-1 Nef mimics an integrin receptor signal that recruits the polycomb group protein Eed to the plasma membrane","status":"public","year":"2004","publisher":"Cell Press","doi":"10.1016/S1097-2765(04)00004-8","citation":{"chicago":"Witte, Vanessa, Bernd Laffert, Olaf Rosorius, Peter Lischka, Katja Blume, Gunther Galler, Andrea Stilper, et al. “HIV-1 Nef Mimics an Integrin Receptor Signal That Recruits the Polycomb Group Protein Eed to the Plasma Membrane.” <i>Molecular Cell</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/S1097-2765(04)00004-8\">https://doi.org/10.1016/S1097-2765(04)00004-8</a>.","mla":"Witte, Vanessa, et al. “HIV-1 Nef Mimics an Integrin Receptor Signal That Recruits the Polycomb Group Protein Eed to the Plasma Membrane.” <i>Molecular Cell</i>, vol. 13, no. 2, Cell Press, 2004, pp. 179–90, doi:<a href=\"https://doi.org/10.1016/S1097-2765(04)00004-8\">10.1016/S1097-2765(04)00004-8</a>.","apa":"Witte, V., Laffert, B., Rosorius, O., Lischka, P., Blume, K., Galler, G., … Baur, A. (2004). HIV-1 Nef mimics an integrin receptor signal that recruits the polycomb group protein Eed to the plasma membrane. <i>Molecular Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/S1097-2765(04)00004-8\">https://doi.org/10.1016/S1097-2765(04)00004-8</a>","ieee":"V. Witte <i>et al.</i>, “HIV-1 Nef mimics an integrin receptor signal that recruits the polycomb group protein Eed to the plasma membrane,” <i>Molecular Cell</i>, vol. 13, no. 2. Cell Press, pp. 179–190, 2004.","ista":"Witte V, Laffert B, Rosorius O, Lischka P, Blume K, Galler G, Stilper A, Willbold D, D’Aloja P, Sixt MK, Kolanus J, Ott M, Kolanus W, Schuler G, Baur A. 2004. HIV-1 Nef mimics an integrin receptor signal that recruits the polycomb group protein Eed to the plasma membrane. Molecular Cell. 13(2), 179–190.","ama":"Witte V, Laffert B, Rosorius O, et al. HIV-1 Nef mimics an integrin receptor signal that recruits the polycomb group protein Eed to the plasma membrane. <i>Molecular Cell</i>. 2004;13(2):179-190. doi:<a href=\"https://doi.org/10.1016/S1097-2765(04)00004-8\">10.1016/S1097-2765(04)00004-8</a>","short":"V. Witte, B. Laffert, O. Rosorius, P. Lischka, K. Blume, G. Galler, A. Stilper, D. Willbold, P. D’Aloja, M.K. Sixt, J. Kolanus, M. Ott, W. Kolanus, G. Schuler, A. Baur, Molecular Cell 13 (2004) 179–190."},"author":[{"first_name":"Vanessa","last_name":"Witte","full_name":"Witte, Vanessa"},{"full_name":"Laffert, Bernd","last_name":"Laffert","first_name":"Bernd"},{"full_name":"Rosorius, Olaf","last_name":"Rosorius","first_name":"Olaf"},{"full_name":"Lischka, Peter","last_name":"Lischka","first_name":"Peter"},{"first_name":"Katja","last_name":"Blume","full_name":"Blume, Katja"},{"full_name":"Galler, Gunther","last_name":"Galler","first_name":"Gunther"},{"last_name":"Stilper","first_name":"Andrea","full_name":"Stilper, Andrea"},{"full_name":"Willbold, Dieter","last_name":"Willbold","first_name":"Dieter"},{"full_name":"D'Aloja, Paola","last_name":"D'Aloja","first_name":"Paola"},{"last_name":"Sixt","first_name":"Michael K","full_name":"Michael Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"first_name":"Johanna","last_name":"Kolanus","full_name":"Kolanus, Johanna"},{"last_name":"Ott","first_name":"Melanie","full_name":"Ott, Melanie"},{"full_name":"Kolanus, Waldemar","last_name":"Kolanus","first_name":"Waldemar"},{"last_name":"Schuler","first_name":"Gerold","full_name":"Schuler, Gerold"},{"last_name":"Baur","first_name":"Andreas","full_name":"Baur, Andreas S"}],"day":"30","type":"journal_article"},{"_id":"3931","month":"01","abstract":[{"text":"Hyaluronan is an unsulfated glycosaminoglycan (GAG) that is ubiquitously expressed in the extracellular matrix (ECM) of all vertebrates, where hyaluronan rich matrices constitute a particular permissive environment for the development of complex biological structures and also for tumor progression. Because of its conserved structure and ubiquitous expression, antibodies for its histochemical detection cannot be produced. We have engineered a fusion protein, neurocan-GFP, and expressed it as a secreted molecule in mammalian cells. Neurocan-GFP fusion protein specifically binds to hyaluronan and directly visualizes hyaluronan on tissue sections, revealing a very detailed picture of hyaluronan distribution. The fluorescent fusion protein can be used in combination with antibodies and nuclear markers for double or triple staining. In addition, it is suitable to visualize hyaluronan on living cells by time-lapse video microscopy. The successful production and application of the neurocan-GFP fusion protein opens up new perspectives for using GFP fusion proteins as detection tools in histological and cytological studies complementing conventional antibody and biotin/avidin techniques.","lang":"eng"}],"publication_status":"published","date_updated":"2021-01-12T07:53:17Z","issue":"7","page":"915 - 922","extern":1,"intvolume":"        52","volume":52,"quality_controlled":0,"date_created":"2018-12-11T12:05:57Z","date_published":"2004-01-01T00:00:00Z","day":"01","type":"journal_article","author":[{"last_name":"Zhang","first_name":"Hui","full_name":"Zhang, Hui"},{"full_name":"Baader, Stephan L","first_name":"Stephan","last_name":"Baader"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","full_name":"Michael Sixt"},{"full_name":"Kappler, Joachim","first_name":"Joachim","last_name":"Kappler"},{"full_name":"Rauch, Uwe","last_name":"Rauch","first_name":"Uwe"}],"publication":"Journal of Histochemistry and Cytochemistry","status":"public","year":"2004","title":"Neurocan-GFP fusion protein: a new approach to detect hyaluronan on tissue sections and living cells","publisher":"Histochemical Society","doi":"10.1369/jhc.3A6221.2004","citation":{"apa":"Zhang, H., Baader, S., Sixt, M. K., Kappler, J., &#38; Rauch, U. (2004). Neurocan-GFP fusion protein: a new approach to detect hyaluronan on tissue sections and living cells. <i>Journal of Histochemistry and Cytochemistry</i>. Histochemical Society. <a href=\"https://doi.org/10.1369/jhc.3A6221.2004\">https://doi.org/10.1369/jhc.3A6221.2004</a>","ieee":"H. Zhang, S. Baader, M. K. Sixt, J. Kappler, and U. Rauch, “Neurocan-GFP fusion protein: a new approach to detect hyaluronan on tissue sections and living cells,” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 52, no. 7. Histochemical Society, pp. 915–922, 2004.","mla":"Zhang, Hui, et al. “Neurocan-GFP Fusion Protein: A New Approach to Detect Hyaluronan on Tissue Sections and Living Cells.” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 52, no. 7, Histochemical Society, 2004, pp. 915–22, doi:<a href=\"https://doi.org/10.1369/jhc.3A6221.2004\">10.1369/jhc.3A6221.2004</a>.","chicago":"Zhang, Hui, Stephan Baader, Michael K Sixt, Joachim Kappler, and Uwe Rauch. “Neurocan-GFP Fusion Protein: A New Approach to Detect Hyaluronan on Tissue Sections and Living Cells.” <i>Journal of Histochemistry and Cytochemistry</i>. Histochemical Society, 2004. <a href=\"https://doi.org/10.1369/jhc.3A6221.2004\">https://doi.org/10.1369/jhc.3A6221.2004</a>.","short":"H. Zhang, S. Baader, M.K. Sixt, J. Kappler, U. Rauch, Journal of Histochemistry and Cytochemistry 52 (2004) 915–922.","ista":"Zhang H, Baader S, Sixt MK, Kappler J, Rauch U. 2004. Neurocan-GFP fusion protein: a new approach to detect hyaluronan on tissue sections and living cells. Journal of Histochemistry and Cytochemistry. 52(7), 915–922.","ama":"Zhang H, Baader S, Sixt MK, Kappler J, Rauch U. Neurocan-GFP fusion protein: a new approach to detect hyaluronan on tissue sections and living cells. <i>Journal of Histochemistry and Cytochemistry</i>. 2004;52(7):915-922. doi:<a href=\"https://doi.org/10.1369/jhc.3A6221.2004\">10.1369/jhc.3A6221.2004</a>"},"publist_id":"2196"},{"publisher":"IEEE","citation":{"ama":"Bremer P, Edelsbrunner H, Hamann B, Pascucci V. A topological hierarchy for functions on triangulated surfaces. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2004;10(4):385-396. doi:<a href=\"https://doi.org/10.1109/TVCG.2004.3\">10.1109/TVCG.2004.3</a>","ista":"Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2004. A topological hierarchy for functions on triangulated surfaces. IEEE Transactions on Visualization and Computer Graphics. 10(4), 385–396.","short":"P. Bremer, H. Edelsbrunner, B. Hamann, V. Pascucci, IEEE Transactions on Visualization and Computer Graphics 10 (2004) 385–396.","ieee":"P. Bremer, H. Edelsbrunner, B. Hamann, and V. Pascucci, “A topological hierarchy for functions on triangulated surfaces,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 10, no. 4. IEEE, pp. 385–396, 2004.","apa":"Bremer, P., Edelsbrunner, H., Hamann, B., &#38; Pascucci, V. (2004). A topological hierarchy for functions on triangulated surfaces. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2004.3\">https://doi.org/10.1109/TVCG.2004.3</a>","chicago":"Bremer, Peer, Herbert Edelsbrunner, Bernd Hamann, and Valerio Pascucci. “A Topological Hierarchy for Functions on Triangulated Surfaces.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2004. <a href=\"https://doi.org/10.1109/TVCG.2004.3\">https://doi.org/10.1109/TVCG.2004.3</a>.","mla":"Bremer, Peer, et al. “A Topological Hierarchy for Functions on Triangulated Surfaces.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 10, no. 4, IEEE, 2004, pp. 385–96, doi:<a href=\"https://doi.org/10.1109/TVCG.2004.3\">10.1109/TVCG.2004.3</a>."},"doi":"10.1109/TVCG.2004.3","title":"A topological hierarchy for functions on triangulated surfaces","publication":"IEEE Transactions on Visualization and Computer Graphics","status":"public","year":"2004","publist_id":"2139","type":"journal_article","day":"01","author":[{"full_name":"Bremer, Peer-Timo","first_name":"Peer","last_name":"Bremer"},{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Bernd","last_name":"Hamann","full_name":"Hamann, Bernd"},{"full_name":"Pascucci, Valerio","first_name":"Valerio","last_name":"Pascucci"}],"page":"385 - 396","issue":"4","extern":1,"date_updated":"2021-01-12T07:53:39Z","date_created":"2018-12-11T12:06:16Z","date_published":"2004-07-01T00:00:00Z","quality_controlled":0,"intvolume":"        10","volume":10,"abstract":[{"lang":"eng","text":"We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structure supporting traversal and reconstruction operations similarly to traditional geometry-based representations. We use this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime."}],"publication_status":"published","month":"07","_id":"3984"},{"author":[{"last_name":"Cole Mclaughlin","first_name":"Kree","full_name":"Cole-McLaughlin, Kree"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"first_name":"Vijay","last_name":"Natarajan","full_name":"Natarajan, Vijay"},{"full_name":"Pascucci, Valerio","first_name":"Valerio","last_name":"Pascucci"}],"type":"journal_article","day":"01","publist_id":"2140","publisher":"Springer","citation":{"ama":"Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Loops in Reeb graphs of 2-manifolds. <i>Discrete &#38; Computational Geometry</i>. 2004;32(2):231-244. doi:<a href=\"https://doi.org/10.1007/s00454-004-1122-6\">10.1007/s00454-004-1122-6</a>","ista":"Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Loops in Reeb graphs of 2-manifolds. Discrete &#38; Computational Geometry. 32(2), 231–244.","short":"K. Cole Mclaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, Discrete &#38; Computational Geometry 32 (2004) 231–244.","chicago":"Cole Mclaughlin, Kree, Herbert Edelsbrunner, John Harer, Vijay Natarajan, and Valerio Pascucci. “Loops in Reeb Graphs of 2-Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2004. <a href=\"https://doi.org/10.1007/s00454-004-1122-6\">https://doi.org/10.1007/s00454-004-1122-6</a>.","mla":"Cole Mclaughlin, Kree, et al. “Loops in Reeb Graphs of 2-Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 2, Springer, 2004, pp. 231–44, doi:<a href=\"https://doi.org/10.1007/s00454-004-1122-6\">10.1007/s00454-004-1122-6</a>.","apa":"Cole Mclaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., &#38; Pascucci, V. (2004). Loops in Reeb graphs of 2-manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-004-1122-6\">https://doi.org/10.1007/s00454-004-1122-6</a>","ieee":"K. Cole Mclaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Loops in Reeb graphs of 2-manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 2. Springer, pp. 231–244, 2004."},"doi":"10.1007/s00454-004-1122-6","status":"public","publication":"Discrete & Computational Geometry","title":"Loops in Reeb graphs of 2-manifolds","year":"2004","acknowledgement":"Partially supported by NSF under Grants EIA-99-72879 and CCR-00-86013.","month":"07","publication_status":"published","abstract":[{"lang":"eng","text":"Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend on the genus, the number of boundary components, and whether or not the 2-manifold is orientable. We also give an algorithm that constructs the Reeb graph in time O(n log n), where n is the number of edges in the triangulation used to represent the 2-manifold and the Morse function."}],"_id":"3985","date_created":"2018-12-11T12:06:16Z","quality_controlled":0,"date_published":"2004-07-01T00:00:00Z","volume":32,"intvolume":"        32","issue":"2","page":"231 - 244","extern":1,"date_updated":"2021-01-12T07:53:39Z"},{"publist_id":"2141","acknowledgement":"Partially supported by NSF under grant CCR-00-86013 and NSF under grant CCR-97-12088.","status":"public","year":"2004","title":"The area derivative of a space-filling diagram","publication":"Discrete & Computational Geometry","doi":"10.1007/s00454-004-1099-1","citation":{"ama":"Bryant R, Edelsbrunner H, Koehl P, Levitt M. The area derivative of a space-filling diagram. <i>Discrete &#38; Computational Geometry</i>. 2004;32(3):293-308. doi:<a href=\"https://doi.org/10.1007/s00454-004-1099-1\">10.1007/s00454-004-1099-1</a>","ista":"Bryant R, Edelsbrunner H, Koehl P, Levitt M. 2004. The area derivative of a space-filling diagram. Discrete &#38; Computational Geometry. 32(3), 293–308.","short":"R. Bryant, H. Edelsbrunner, P. Koehl, M. Levitt, Discrete &#38; Computational Geometry 32 (2004) 293–308.","chicago":"Bryant, Robert, Herbert Edelsbrunner, Patrice Koehl, and Michael Levitt. “The Area Derivative of a Space-Filling Diagram.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2004. <a href=\"https://doi.org/10.1007/s00454-004-1099-1\">https://doi.org/10.1007/s00454-004-1099-1</a>.","mla":"Bryant, Robert, et al. “The Area Derivative of a Space-Filling Diagram.” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 3, Springer, 2004, pp. 293–308, doi:<a href=\"https://doi.org/10.1007/s00454-004-1099-1\">10.1007/s00454-004-1099-1</a>.","apa":"Bryant, R., Edelsbrunner, H., Koehl, P., &#38; Levitt, M. (2004). The area derivative of a space-filling diagram. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-004-1099-1\">https://doi.org/10.1007/s00454-004-1099-1</a>","ieee":"R. Bryant, H. Edelsbrunner, P. Koehl, and M. Levitt, “The area derivative of a space-filling diagram,” <i>Discrete &#38; Computational Geometry</i>, vol. 32, no. 3. Springer, pp. 293–308, 2004."},"publisher":"Springer","author":[{"first_name":"Robert","last_name":"Bryant","full_name":"Bryant, Robert"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner"},{"full_name":"Koehl, Patrice","first_name":"Patrice","last_name":"Koehl"},{"full_name":"Levitt, Michael","last_name":"Levitt","first_name":"Michael"}],"day":"01","type":"journal_article","intvolume":"        32","volume":32,"date_created":"2018-12-11T12:06:17Z","date_published":"2004-09-01T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T07:53:40Z","extern":1,"issue":"3","page":"293 - 308","_id":"3986","month":"09","abstract":[{"text":"The motion of a biomolecule greatly depends on the engulfing solution, which is mostly water. Instead of representing individual water molecules, it is desirable to develop implicit solvent models that nevertheless accurately represent the contribution of the solvent interaction to the motion. In such models, hydrophobicity is expressed as a weighted sum of atomic surface areas. The derivatives of these weighted areas contribute to the force that drives the motion. In this paper we give formulas for the weighted and unweighted area derivatives of a molecule modeled as a space-filling diagram made up of balls in motion. Other than the radii and the centers of the balls, the formulas are given in terms of the sizes of circular arcs of the boundary and edges of the power diagram. We also give inclusion-exclusion formulas for these sizes.","lang":"eng"}],"publication_status":"published"},{"title":"Simplification of three-dimensional density maps","status":"public","year":"2004","publication":"IEEE Transactions on Visualization and Computer Graphics","publisher":"IEEE","citation":{"apa":"Natarajan, V., &#38; Edelsbrunner, H. (2004). Simplification of three-dimensional density maps. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2004.32\">https://doi.org/10.1109/TVCG.2004.32</a>","ieee":"V. Natarajan and H. Edelsbrunner, “Simplification of three-dimensional density maps,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 10, no. 5. IEEE, pp. 587–597, 2004.","mla":"Natarajan, Vijay, and Herbert Edelsbrunner. “Simplification of Three-Dimensional Density Maps.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 10, no. 5, IEEE, 2004, pp. 587–97, doi:<a href=\"https://doi.org/10.1109/TVCG.2004.32\">10.1109/TVCG.2004.32</a>.","chicago":"Natarajan, Vijay, and Herbert Edelsbrunner. “Simplification of Three-Dimensional Density Maps.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2004. <a href=\"https://doi.org/10.1109/TVCG.2004.32\">https://doi.org/10.1109/TVCG.2004.32</a>.","short":"V. Natarajan, H. Edelsbrunner, IEEE Transactions on Visualization and Computer Graphics 10 (2004) 587–597.","ista":"Natarajan V, Edelsbrunner H. 2004. Simplification of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics. 10(5), 587–597.","ama":"Natarajan V, Edelsbrunner H. Simplification of three-dimensional density maps. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2004;10(5):587-597. doi:<a href=\"https://doi.org/10.1109/TVCG.2004.32\">10.1109/TVCG.2004.32</a>"},"doi":"10.1109/TVCG.2004.32","publist_id":"2142","day":"12","type":"journal_article","author":[{"first_name":"Vijay","last_name":"Natarajan","full_name":"Natarajan, Vijay"},{"orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T07:53:40Z","page":"587 - 597","issue":"5","extern":1,"intvolume":"        10","volume":10,"date_published":"2004-07-12T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T12:06:17Z","_id":"3987","abstract":[{"text":"We consider scientific data sets that describe density functions over three-dimensional geometric domains. Such data sets are often large and coarsened representations are needed for visualization and analysis. Assuming a tetrahedral mesh representation, we construct such representations with a simplification algorithm that combines three goals: the approximation of the function, the preservation of the mesh topology, and the improvement of the mesh quality. The third goal is achieved with a novel extension of the well-known quadric error metric. We perform a number of computational experiments to understand the effect of mesh quality improvement on the density map approximation. In addition, we study the effect of geometric simplification on the topological features of the function by monitoring its critical points.","lang":"eng"}],"month":"07","publication_status":"published"},{"conference":{"name":"WABI: 4th International Workshop on Algorithms in Bioinformatics"},"type":"conference","day":"01","alternative_title":["LNCS"],"author":[{"first_name":"Vicky","last_name":"Choi","full_name":"Choi, Vicky"},{"first_name":"Pankaj","last_name":"Agarwal","full_name":"Agarwal, Pankaj K"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Rudolph, Johannes","last_name":"Rudolph","first_name":"Johannes"}],"publisher":"Springer","citation":{"mla":"Choi, Vicky, et al. <i>Local Search Heuristic for Rigid Protein Docking</i>. Vol. 3240, Springer, 2004, pp. 218–29, doi:<a href=\"https://doi.org/10.1007/978-3-540-30219-3_19\">10.1007/978-3-540-30219-3_19</a>.","chicago":"Choi, Vicky, Pankaj Agarwal, Herbert Edelsbrunner, and Johannes Rudolph. “Local Search Heuristic for Rigid Protein Docking,” 3240:218–29. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30219-3_19\">https://doi.org/10.1007/978-3-540-30219-3_19</a>.","apa":"Choi, V., Agarwal, P., Edelsbrunner, H., &#38; Rudolph, J. (2004). Local search heuristic for rigid protein docking (Vol. 3240, pp. 218–229). Presented at the WABI: 4th International Workshop on Algorithms in Bioinformatics, Springer. <a href=\"https://doi.org/10.1007/978-3-540-30219-3_19\">https://doi.org/10.1007/978-3-540-30219-3_19</a>","ieee":"V. Choi, P. Agarwal, H. Edelsbrunner, and J. Rudolph, “Local search heuristic for rigid protein docking,” presented at the WABI: 4th International Workshop on Algorithms in Bioinformatics, 2004, vol. 3240, pp. 218–229.","short":"V. Choi, P. Agarwal, H. Edelsbrunner, J. Rudolph, in:, Springer, 2004, pp. 218–229.","ama":"Choi V, Agarwal P, Edelsbrunner H, Rudolph J. Local search heuristic for rigid protein docking. In: Vol 3240. Springer; 2004:218-229. doi:<a href=\"https://doi.org/10.1007/978-3-540-30219-3_19\">10.1007/978-3-540-30219-3_19</a>","ista":"Choi V, Agarwal P, Edelsbrunner H, Rudolph J. 2004. Local search heuristic for rigid protein docking. WABI: 4th International Workshop on Algorithms in Bioinformatics, LNCS, vol. 3240, 218–229."},"doi":"10.1007/978-3-540-30219-3_19","title":"Local search heuristic for rigid protein docking","year":"2004","status":"public","acknowledgement":"Supported by NSF under grant CCR-00-86013, BGT Postdoc Program from Duke University and NIH under grant R01 GM61822-01.","publist_id":"2136","month":"01","publication_status":"published","abstract":[{"text":"We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and improves by applying a rigid motion to one of the two proteins. Our implementation of the algorithm takes between three and ten seconds and converges with high likelihood to the correct docked configuration, provided it starts at a position away from the correct one by at most 18 degrees of rotation and at most 3.0Angstrom of translation. The speed and convergence radius make this an attractive algorithm to use in combination with a coarse sampling of the six-dimensional space of rigid motions.","lang":"eng"}],"_id":"3988","extern":1,"page":"218 - 229","date_updated":"2021-01-12T07:53:41Z","date_published":"2004-01-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T12:06:17Z","intvolume":"      3240","volume":3240},{"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Harer, John","last_name":"Harer","first_name":"John"},{"first_name":"Vijay","last_name":"Natarajan","full_name":"Natarajan, Vijay"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"}],"conference":{"name":"VIS: IEEE Visualization"},"type":"conference","day":"01","publist_id":"2137","citation":{"mla":"Edelsbrunner, Herbert, et al. <i>Local and Global Comparison of Continuous Functions</i>. IEEE, 2004, pp. 275–80, doi:<a href=\"https://doi.org/10.1109/VISUAL.2004.68\">10.1109/VISUAL.2004.68</a>.","chicago":"Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Local and Global Comparison of Continuous Functions,” 275–80. IEEE, 2004. <a href=\"https://doi.org/10.1109/VISUAL.2004.68\">https://doi.org/10.1109/VISUAL.2004.68</a>.","ieee":"H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Local and global comparison of continuous functions,” presented at the VIS: IEEE Visualization, 2004, pp. 275–280.","apa":"Edelsbrunner, H., Harer, J., Natarajan, V., &#38; Pascucci, V. (2004). Local and global comparison of continuous functions (pp. 275–280). Presented at the VIS: IEEE Visualization, IEEE. <a href=\"https://doi.org/10.1109/VISUAL.2004.68\">https://doi.org/10.1109/VISUAL.2004.68</a>","short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, IEEE, 2004, pp. 275–280.","ista":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Local and global comparison of continuous functions. VIS: IEEE Visualization, 275–280.","ama":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Local and global comparison of continuous functions. In: IEEE; 2004:275-280. doi:<a href=\"https://doi.org/10.1109/VISUAL.2004.68\">10.1109/VISUAL.2004.68</a>"},"doi":"10.1109/VISUAL.2004.68","publisher":"IEEE","status":"public","title":"Local and global comparison of continuous functions","year":"2004","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce local and global comparison measures for a collection of k less than or equal to d real-valued smooth functions on a common d-dimensional Riemannian manifold. For k = d = 2 we relate the measures to the set of critical points of one function restricted to the level sets of the other. The definition of the measures extends to piecewise linear functions for which they ace easy to compute. The computation of the measures forms the centerpiece of a software tool which we use to study scientific datasets."}],"month":"10","_id":"3989","date_created":"2018-12-11T12:06:18Z","quality_controlled":0,"date_published":"2004-10-01T00:00:00Z","extern":1,"page":"275 - 280","date_updated":"2021-01-12T07:53:41Z"}]