[{"date_created":"2018-12-11T12:04:15Z","_id":"3614","page":"2111 - 2132","extern":"1","publisher":"Wiley-Blackwell","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"title":"Effects of allele frequency changes on variance components under a general model of epistasis","author":[{"full_name":"Barton, Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"full_name":"Turelli, Michael","last_name":"Turelli","first_name":"Michael"}],"article_type":"original","volume":58,"publication":"Evolution; International Journal of Organic Evolution","day":"01","year":"2004","language":[{"iso":"eng"}],"intvolume":"        58","date_published":"2004-10-01T00:00:00Z","citation":{"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>","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>.","short":"N.H. Barton, M. Turelli, Evolution; International Journal of Organic Evolution 58 (2004) 2111–2132.","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>.","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."},"status":"public","doi":"10.1111/j.0014-3820.2004.tb01591.x","OA_type":"closed access","month":"10","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"}],"publist_id":"2769","oa_version":"None","external_id":{"pmid":["15562679"]},"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x","date_updated":"2026-09-11T11:20:44Z","issue":"10","publication_status":"published","pmid":1,"article_processing_charge":"No"},{"OA_type":"closed access","doi":"10.1534/genetics.166.2.1053","status":"public","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>","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>.","short":"M. Turelli, N.H. Barton, Genetics 166 (2004) 1053–1079.","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.","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>"},"date_published":"2004-02-01T00:00:00Z","external_id":{"pmid":["15020487"]},"type":"journal_article","publist_id":"2768","oa_version":"None","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"}],"month":"02","fulldoi":"https://doi.org/10.1534/genetics.166.2.1053","date_updated":"2026-09-11T11:13:08Z","publication_status":"published","issue":"2","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","pmid":1,"_id":"3615","page":"1053 - 1079","date_created":"2018-12-11T12:04:15Z","extern":"1","article_type":"original","author":[{"first_name":"Michael","full_name":"Turelli, Michael","last_name":"Turelli"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"title":"Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions","publisher":"Genetics Society of America","publication_identifier":{"eissn":["1943-2631"],"issn":["0016-6731"]},"day":"01","publication":"Genetics","volume":166,"intvolume":"       166","language":[{"iso":"eng"}],"year":"2004"},{"publication_status":"published","issue":"2","fulldoi":"https://doi.org/10.1534/genetics.166.2.1115","date_updated":"2026-09-11T10:54:39Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"article_processing_charge":"No","citation":{"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>.","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>","short":"N.H. Barton, A. Etheridge, Genetics 166 (2004) 1115–1131.","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.","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>","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>."},"date_published":"2004-02-01T00:00:00Z","OA_type":"closed access","doi":"10.1534/genetics.166.2.1115","status":"public","abstract":[{"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.","lang":"eng"}],"month":"02","external_id":{"pmid":["15020491"]},"type":"journal_article","oa_version":"None","publist_id":"2766","publication":"Genetics","volume":166,"day":"01","language":[{"iso":"eng"}],"year":"2004","intvolume":"       166","extern":"1","date_created":"2018-12-11T12:04:16Z","_id":"3617","page":"1115 - 1131","publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"publisher":"Genetics Society of America","article_type":"original","author":[{"last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"}],"title":"The effect of selection on genealogies"},{"publication_identifier":{"eissn":["1878-108X"],"issn":["0166-2236"]},"publisher":"Elsevier","title":"Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons","article_type":"original","author":[{"orcid":"0000-0001-5001-4804","first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bischofberger","full_name":"Bischofberger, Josef","first_name":"Josef"},{"first_name":"Desdemona","last_name":"Fricker","full_name":"Fricker, Desdemona"},{"last_name":"Miles","full_name":"Miles, Richard","first_name":"Richard"}],"extern":"1","_id":"3805","page":"30 - 40","date_created":"2018-12-11T12:05:16Z","year":"2004","language":[{"iso":"eng"}],"intvolume":"        27","publication":"Trends in Neurosciences","volume":27,"day":"01","month":"01","abstract":[{"lang":"eng","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."}],"oa_version":"None","publist_id":"2404","external_id":{"pmid":["14698608"]},"type":"journal_article","date_published":"2004-01-01T00:00:00Z","citation":{"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>.","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>","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.","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>.","short":"P.M. Jonas, J. Bischofberger, D. Fricker, R. Miles, Trends in Neurosciences 27 (2004) 30–40.","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."},"status":"public","doi":"doi:10.1016/j.tins.2003.10.010","OA_type":"closed access","pmid":1,"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","issue":"1","date_updated":"2026-09-11T10:25:02Z","fulldoi":"https://doi.org/doi:10.1016/j.tins.2003.10.010"},{"type":"conference","author":[{"first_name":"Adrian","full_name":"Ulges, Adrian","last_name":"Ulges"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"full_name":"Breuel, Thomas","last_name":"Breuel","first_name":"Thomas"}],"oa_version":"None","title":"Document capture using stereo vision","publist_id":"2679","abstract":[{"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.","lang":"eng"}],"publication_identifier":{"isbn":["9781581139389"]},"publisher":"ACM","month":"01","OA_type":"closed access","doi":"10.1145/1030397.1030434","status":"public","main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/ulges-doceng2004.pdf"}],"extern":"1","citation":{"ama":"Ulges A, Lampert C, Breuel T. Document capture using stereo vision. In: <i>Proceedings of the 2004 ACM Symposium on Document Engineering</i>. ACM; 2004:198-200. doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>","ista":"Ulges A, Lampert C, Breuel T. 2004. Document capture using stereo vision. Proceedings of the 2004 ACM symposium on Document engineering. DocEng: ACM Symposium on Document Engineering, 198–200.","chicago":"Ulges, Adrian, Christoph Lampert, and Thomas Breuel. “Document Capture Using Stereo Vision.” In <i>Proceedings of the 2004 ACM Symposium on Document Engineering</i>, 198–200. ACM, 2004. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>.","ieee":"A. Ulges, C. Lampert, and T. Breuel, “Document capture using stereo vision,” in <i>Proceedings of the 2004 ACM symposium on Document engineering</i>, Milwaukee, WI, United States, 2004, pp. 198–200.","short":"A. Ulges, C. Lampert, T. Breuel, in:, Proceedings of the 2004 ACM Symposium on Document Engineering, ACM, 2004, pp. 198–200.","mla":"Ulges, Adrian, et al. “Document Capture Using Stereo Vision.” <i>Proceedings of the 2004 ACM Symposium on Document Engineering</i>, ACM, 2004, pp. 198–200, doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>.","apa":"Ulges, A., Lampert, C., &#38; Breuel, T. (2004). Document capture using stereo vision. In <i>Proceedings of the 2004 ACM symposium on Document engineering</i> (pp. 198–200). Milwaukee, WI, United States: ACM. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>"},"_id":"3688","page":"198 - 200","date_created":"2018-12-11T12:04:38Z","date_published":"2004-01-01T00:00:00Z","conference":{"end_date":"2004-10-30","start_date":"2004-10-28","name":"DocEng: ACM Symposium on Document Engineering","location":"Milwaukee, WI, United States"},"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2004","day":"01","publication_status":"published","date_updated":"2026-09-11T10:45:46Z","fulldoi":"https://doi.org/10.1145/1030397.1030434","publication":"Proceedings of the 2004 ACM symposium on Document engineering","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"month":"01","publisher":"Springer","abstract":[{"text":"The Jacobi set of two Morse functions defined on a common - manifold is the set of critical points of the restrictions of one func- tion to the level sets of the other function. Equivalently, it is the set of points where the gradients of the functions are parallel. For a generic pair of Morse functions, the Jacobi set is a smoothly embed- ded 1-manifold. We give a polynomial-time algorithm that com- putes the piecewise linear analog of the Jacobi set for functions specified at the vertices of a triangulation, and we generalize all results to more than two but at most Morse functions.","lang":"eng"}],"publist_id":"2810","oa_version":"None","title":"Jacobi sets of multiple Morse functions","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Harer, John","last_name":"Harer","first_name":"John"}],"type":"book_chapter","date_published":"2004-01-01T00:00:00Z","_id":"3575","page":"37 - 57","date_created":"2018-12-11T12:04:02Z","citation":{"ieee":"H. Edelsbrunner and J. Harer, “Jacobi sets of multiple Morse functions,” in <i>Foundations of Computational Mathematics</i>, vol. 312, Springer, 2004, pp. 37–57.","short":"H. Edelsbrunner, J. Harer, in:, Foundations of Computational Mathematics, Springer, 2004, pp. 37–57.","ama":"Edelsbrunner H, Harer J. Jacobi sets of multiple Morse functions. In: <i>Foundations of Computational Mathematics</i>. Vol 312. Springer; 2004:37-57. doi:<a href=\"https://doi.org/10.1017/CBO9781139106962.003\">10.1017/CBO9781139106962.003</a>","chicago":"Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” In <i>Foundations of Computational Mathematics</i>, 312:37–57. Springer, 2004. <a href=\"https://doi.org/10.1017/CBO9781139106962.003\">https://doi.org/10.1017/CBO9781139106962.003</a>.","ista":"Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In: Foundations of Computational Mathematics. London Mathematical Society Lecture Note, vol. 312, 37–57.","apa":"Edelsbrunner, H., &#38; Harer, J. (2004). Jacobi sets of multiple Morse functions. In <i>Foundations of Computational Mathematics</i> (Vol. 312, pp. 37–57). Springer. <a href=\"https://doi.org/10.1017/CBO9781139106962.003\">https://doi.org/10.1017/CBO9781139106962.003</a>","mla":"Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” <i>Foundations of Computational Mathematics</i>, vol. 312, Springer, 2004, pp. 37–57, doi:<a href=\"https://doi.org/10.1017/CBO9781139106962.003\">10.1017/CBO9781139106962.003</a>."},"extern":"1","status":"public","doi":"10.1017/CBO9781139106962.003","OA_type":"closed access","year":"2004","language":[{"iso":"eng"}],"article_processing_charge":"No","alternative_title":["London Mathematical Society Lecture Note"],"intvolume":"       312","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-09-11T11:58:23Z","fulldoi":"https://doi.org/10.1017/CBO9781139106962.003","volume":312,"publication":"Foundations of Computational Mathematics","publication_status":"published","day":"01"},{"date_published":"2004-11-01T00:00:00Z","extern":"1","citation":{"mla":"Ulrich, Florian, and Carl-Philipp J. Heisenberg. “Gastrulation in Zebrafish.” <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>, edited by Vladimir Korzh and Zhiyuan Gong, vol. 2, World Scientific Publishing, 2004, pp. 39–86.","apa":"Ulrich, F., &#38; Heisenberg, C.-P. J. (2004). Gastrulation in zebrafish. In V. Korzh &#38; Z. Gong (Eds.), <i>Fish development and genetics : the zebrafish and medaka models</i> (Vol. 2, pp. 39–86). World Scientific Publishing.","ieee":"F. Ulrich and C.-P. J. Heisenberg, “Gastrulation in zebrafish,” in <i>Fish development and genetics : the zebrafish and medaka models</i>, vol. 2, V. Korzh and Z. Gong, Eds. World Scientific Publishing, 2004, pp. 39–86.","short":"F. Ulrich, C.-P.J. Heisenberg, in:, V. Korzh, Z. Gong (Eds.), Fish Development and Genetics : The Zebrafish and Medaka Models, World Scientific Publishing, 2004, pp. 39–86.","ama":"Ulrich F, Heisenberg C-PJ. Gastrulation in zebrafish. In: Korzh V, Gong Z, eds. <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>. Vol 2. World Scientific Publishing; 2004:39-86.","ista":"Ulrich F, Heisenberg C-PJ. 2004.Gastrulation in zebrafish. In: Fish development and genetics : the zebrafish and medaka models. Molecular Aspects of Fish and Marine Biology, vol. 2, 39–86.","chicago":"Ulrich, Florian, and Carl-Philipp J Heisenberg. “Gastrulation in Zebrafish.” In <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>, edited by Vladimir Korzh and Zhiyuan Gong, 2:39–86. World Scientific Publishing, 2004."},"date_created":"2018-12-11T12:04:06Z","_id":"3587","page":"39 - 86","status":"public","OA_type":"closed access","publication_identifier":{"isbn":["9812388214"]},"month":"11","publisher":"World Scientific Publishing","oa_version":"None","title":"Gastrulation in zebrafish","publist_id":"2796","type":"book_chapter","author":[{"first_name":"Florian","full_name":"Ulrich, Florian","last_name":"Ulrich"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","publication":"Fish development and genetics : the zebrafish and medaka models","date_updated":"2026-09-11T11:54:02Z","volume":2,"day":"01","year":"2004","language":[{"iso":"eng"}],"article_processing_charge":"No","editor":[{"first_name":"Vladimir","last_name":"Korzh","full_name":"Korzh, Vladimir"},{"full_name":"Gong, Zhiyuan","last_name":"Gong","first_name":"Zhiyuan"}],"intvolume":"         2","alternative_title":["Molecular Aspects of Fish and Marine Biology"]},{"date_created":"2018-12-11T12:04:09Z","_id":"3595","page":"R233 - R235","extern":"1","title":"Genome size: Does bigger mean worse?","author":[{"first_name":"Brian","full_name":"Charlesworth, Brian","last_name":"Charlesworth"},{"last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"}],"publisher":"Cell Press","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"day":"01","volume":14,"publication":"Current Biology","intvolume":"        14","year":"2004","language":[{"iso":"eng"}],"status":"public","OA_type":"closed access","doi":"10.1016/j.cub.2004.02.054","date_published":"2004-03-01T00:00:00Z","citation":{"ieee":"B. Charlesworth and N. H. Barton, “Genome size: Does bigger mean worse?,” <i>Current Biology</i>, vol. 14, no. 6. Cell Press, pp. R233–R235, 2004.","short":"B. Charlesworth, N.H. Barton, Current Biology 14 (2004) R233–R235.","ista":"Charlesworth B, Barton NH. 2004. Genome size: Does bigger mean worse? Current Biology. 14(6), R233–R235.","chicago":"Charlesworth, Brian, and Nicholas H Barton. “Genome Size: Does Bigger Mean Worse?” <i>Current Biology</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">https://doi.org/10.1016/j.cub.2004.02.054</a>.","ama":"Charlesworth B, Barton NH. Genome size: Does bigger mean worse? <i>Current Biology</i>. 2004;14(6):R233-R235. doi:<a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">10.1016/j.cub.2004.02.054</a>","mla":"Charlesworth, Brian, and Nicholas H. Barton. “Genome Size: Does Bigger Mean Worse?” <i>Current Biology</i>, vol. 14, no. 6, Cell Press, 2004, pp. R233–35, doi:<a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">10.1016/j.cub.2004.02.054</a>.","apa":"Charlesworth, B., &#38; Barton, N. H. (2004). Genome size: Does bigger mean worse? <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">https://doi.org/10.1016/j.cub.2004.02.054</a>"},"publist_id":"2788","oa_version":"None","type":"review","external_id":{"pmid":["15043833"]},"month":"03","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-09-11T11:22:22Z","fulldoi":"https://doi.org/10.1016/j.cub.2004.02.054","publication_status":"published","issue":"6","article_processing_charge":"No","pmid":1},{"type":"review","author":[{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"oa_version":"None","title":"Speciation: Why, how, where and when?","publist_id":"2767","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"month":"08","publisher":"Cell Press","doi":"10.1016/j.cub.2004.07.037","status":"public","extern":"1","citation":{"ieee":"N. H. Barton, “Speciation: Why, how, where and when?,” <i>Current Biology</i>, vol. 14, no. 15. Cell Press, pp. R603–R604, 2004.","short":"N.H. Barton, Current Biology 14 (2004) R603–R604.","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>","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>.","ista":"Barton NH. 2004. Speciation: Why, how, where and when? Current Biology. 14(15), R603–R604.","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>"},"date_created":"2018-12-11T12:04:16Z","_id":"3616","page":"R603 - R604","date_published":"2004-08-10T00:00:00Z","intvolume":"        14","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2004","day":"10","issue":"15","publication_status":"published","volume":14,"fulldoi":"https://doi.org/10.1016/j.cub.2004.07.037","date_updated":"2026-09-11T10:57:09Z","publication":"Current Biology","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"language":[{"iso":"eng"}],"year":"2004","intvolume":"      2951","conference":{"start_date":"2004-02-19","end_date":"2004-02-21","location":"Cambridge, MA, United","name":"TCC: Theory of Cryptography Conference"},"publication":"First Theory of Cryptography Conference, 2004","volume":2951,"day":"19","publisher":"Springer Nature","publication_identifier":{"isbn":["9783540210009"],"eisbn":["9783540246381"]},"author":[{"first_name":"Ueli","full_name":"Maurer, Ueli","last_name":"Maurer"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"}],"title":"Composition of random systems: When two weak make one strong","date_created":"2018-12-11T12:02:01Z","_id":"3208","page":"410 - 427","extern":"1","alternative_title":["LNCS"],"article_processing_charge":"No","fulldoi":"https://doi.org/10.1007/978-3-540-24638-1_23","date_updated":"2026-09-11T12:11:09Z","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"A new technique for proving the adaptive indistinguishability of two systems, each composed of some component systems, is presented, using only the fact that corresponding component systems are non-adaptively indistinguishable. The main tool is the definition of a special monotone condition for a random system F, relative to another random system G, whose probability of occurring for a given distinguisher D is closely related to the distinguishing advantage ε of D for F and G, namely it is lower and upper bounded by ε and (1+ln1), respectively.\r\nA concrete instantiation of this result shows that the cascade of two random permutations (with the second one inverted) is indistinguishable from a uniform random permutation by adaptive distinguishers which may query the system from both sides, assuming the components’ security only against non-adaptive one-sided distinguishers.\r\nAs applications we provide some results in various fields as almost k-wise independent probability spaces, decorrelation theory and computational indistinguishability (i.e., pseudo-randomness)."}],"month":"03","type":"conference","publist_id":"3471","oa_version":"None","citation":{"ieee":"U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” in <i>First Theory of Cryptography Conference, 2004</i>, Cambridge, MA, United, 2004, vol. 2951, pp. 410–427.","short":"U. Maurer, K.Z. Pietrzak, in:, First Theory of Cryptography Conference, 2004, Springer Nature, 2004, pp. 410–427.","ista":"Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. First Theory of Cryptography Conference, 2004. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.","ama":"Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one strong. In: <i>First Theory of Cryptography Conference, 2004</i>. Vol 2951. Springer Nature; 2004:410-427. doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong.” In <i>First Theory of Cryptography Conference, 2004</i>, 2951:410–27. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong.” <i>First Theory of Cryptography Conference, 2004</i>, vol. 2951, Springer Nature, 2004, pp. 410–27, doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2004). Composition of random systems: When two weak make one strong. In <i>First Theory of Cryptography Conference, 2004</i> (Vol. 2951, pp. 410–427). Cambridge, MA, United: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>"},"date_published":"2004-03-19T00:00:00Z","doi":"10.1007/978-3-540-24638-1_23","OA_type":"closed access","status":"public"},{"title":"Spatially coherent clustering using graph cuts","oa_version":"None","publist_id":"3506","type":"conference","author":[{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["1063-6919"],"isbn":["0769521584"]},"publisher":"IEEE","month":"06","abstract":[{"text":"Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixel. The feature space is then clustered, and each pixel is labeled with the cluster that contains its feature vector. A major limitation of this approach is that feature space clusters generally lack spatial coherence (i.e., they do not correspond to a compact grouping of pixels). In this paper, we propose a segmentation algorithm that operates simultaneously in feature space and in image space. We define an energy function over both a set of clusters and a labeling of pixels with clusters. In our framework, a pixel is labeled with a single cluster (rather than, for example, a distribution over clusters). Our energy function penalizes clusters that are a poor fit to the data in feature space, and also penalizes clusters whose pixels lack spatial coherence. The energy function can be efficiently minimized using graph cuts. Our algorithm can incorporate both parametric and non-parametric clustering methods. It can be applied to many optimization-based clustering methods, including k-means and k-medians, and can handle models which are very close in feature space. Preliminary results are presented on segmenting real and synthetic images, using both parametric and non-parametric clustering.","lang":"eng"}],"status":"public","doi":"10.1109/CVPR.2004.1315196","OA_type":"closed access","date_published":"2004-06-01T00:00:00Z","citation":{"apa":"Zabih, R., &#38; Kolmogorov, V. (2004). Spatially coherent clustering using graph cuts. In <i>Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004</i> (Vol. 2, pp. 437–444). Washington, DC, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">https://doi.org/10.1109/CVPR.2004.1315196</a>","mla":"Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using Graph Cuts.” <i>Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004</i>, vol. 2, IEEE, 2004, pp. 437–44, doi:<a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">10.1109/CVPR.2004.1315196</a>.","ieee":"R. Zabih and V. Kolmogorov, “Spatially coherent clustering using graph cuts,” in <i>Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004</i>, Washington, DC, United States, 2004, vol. 2, pp. 437–444.","short":"R. Zabih, V. Kolmogorov, in:, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004, IEEE, 2004, pp. 437–444.","ista":"Zabih R, Kolmogorov V. 2004. Spatially coherent clustering using graph cuts. Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR: Computer Vision and Pattern Recognition vol. 2, 437–444.","chicago":"Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using Graph Cuts.” In <i>Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004</i>, 2:437–44. IEEE, 2004. <a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">https://doi.org/10.1109/CVPR.2004.1315196</a>.","ama":"Zabih R, Kolmogorov V. Spatially coherent clustering using graph cuts. In: <i>Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004</i>. Vol 2. IEEE; 2004:437-444. doi:<a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">10.1109/CVPR.2004.1315196</a>"},"extern":"1","_id":"3177","date_created":"2018-12-11T12:01:50Z","page":"437 - 444","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","location":"Washington, DC, United States","end_date":"2004-07-02","start_date":"2004-06-27"},"article_processing_charge":"No","intvolume":"         2","year":"2004","language":[{"iso":"eng"}],"day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","volume":2,"fulldoi":"https://doi.org/10.1109/CVPR.2004.1315196","date_updated":"2026-09-11T12:20:17Z","publication":"Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004"},{"OA_type":"closed access","doi":"10.1016/j.jmb.2004.05.026","status":"public","citation":{"short":"A. Kedrov, C. Ziegler, H.L. Janovjak, W. Kühlbrandt, D. Mueller, Journal of Molecular Biology 340 (2004) 1143–1152.","ieee":"A. Kedrov, C. Ziegler, H. L. Janovjak, W. Kühlbrandt, and D. Mueller, “Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy,” <i>Journal of Molecular Biology</i>, vol. 340, no. 5. Elsevier, pp. 1143–1152, 2004.","ista":"Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. 2004. Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. Journal of Molecular Biology. 340(5), 1143–1152.","ama":"Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. <i>Journal of Molecular Biology</i>. 2004;340(5):1143-1152. doi:<a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">10.1016/j.jmb.2004.05.026</a>","chicago":"Kedrov, Alexej, Christine Ziegler, Harald L Janovjak, Werner Kühlbrandt, and Daniel Mueller. “Controlled Unfolding and Refolding of a Single Sodium/Proton Antiporter Using Atomic Force Microscopy.” <i>Journal of Molecular Biology</i>. Elsevier, 2004. <a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">https://doi.org/10.1016/j.jmb.2004.05.026</a>.","apa":"Kedrov, A., Ziegler, C., Janovjak, H. L., Kühlbrandt, W., &#38; Mueller, D. (2004). Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">https://doi.org/10.1016/j.jmb.2004.05.026</a>","mla":"Kedrov, Alexej, et al. “Controlled Unfolding and Refolding of a Single Sodium/Proton Antiporter Using Atomic Force Microscopy.” <i>Journal of Molecular Biology</i>, vol. 340, no. 5, Elsevier, 2004, pp. 1143–52, doi:<a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">10.1016/j.jmb.2004.05.026</a>."},"date_published":"2004-07-23T00:00:00Z","type":"journal_article","external_id":{"pmid":["15236973"]},"publist_id":"2981","oa_version":"None","abstract":[{"text":"Single-molecule force-spectroscopy was employed to unfold and refold single sodium-proton antiporters (NhaA) of Escherichia coli from membrane patches. Although transmembrane α-helices and extracellular polypeptide loops exhibited sufficient stability to individually establish potential barriers against unfolding, two helices predominantly unfolded pairwise, thereby acting as one structural unit. Many of the potential barriers were detected unfolding NhaA either from the C-terminal or the N-terminal end. It was found that some molecular interactions stabilizing secondary structural elements were directional, while others were not. Additionally, some interactions appeared to occur between the secondary structural elements. After unfolding ten of the 12 helices, the extracted polypeptide was allowed to refold back into the membrane. After five seconds, the refolded polypeptide established all secondary structure elements of the native protein. One helical pair showed a characteristic spring like “snap in” into its folded conformation, while the refolding process of other helices was not detected in particular. Additionally, individual helices required characteristic periods of time to fold. Correlating these results with the primary structure of NhaA allowed us to obtain the first insights into how potential barriers establish and determine the folding kinetics of the secondary structure elements.","lang":"eng"}],"month":"07","fulldoi":"https://doi.org/10.1016/j.jmb.2004.05.026","date_updated":"2026-09-11T12:02:45Z","publication_status":"published","issue":"5","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","pmid":1,"_id":"3420","date_created":"2018-12-11T12:03:14Z","page":"1143 - 1152","extern":"1","article_type":"original","author":[{"first_name":"Alexej","last_name":"Kedrov","full_name":"Kedrov, Alexej"},{"last_name":"Ziegler","full_name":"Ziegler, Christine","first_name":"Christine"},{"first_name":"Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Werner","full_name":"Kühlbrandt, Werner","last_name":"Kühlbrandt"},{"first_name":"Daniel","last_name":"Mueller","full_name":"Mueller, Daniel"}],"title":"Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy","publisher":"Elsevier","publication_identifier":{"issn":["0022-2836"]},"day":"23","volume":340,"publication":"Journal of Molecular Biology","intvolume":"       340","language":[{"iso":"eng"}],"year":"2004"},{"day":"01","publication":"Structure","volume":12,"intvolume":"        12","year":"2004","language":[{"iso":"eng"}],"_id":"3419","page":"871 - 879","date_created":"2018-12-11T12:03:14Z","extern":"1","title":"Probing the energy landscape of the membrane protein bacteriorhodopsin","author":[{"first_name":"Harald L","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak"},{"first_name":"Jens","full_name":"Struckmeier, Jens","last_name":"Struckmeier"},{"last_name":"Hubain","full_name":"Hubain, Maurice","first_name":"Maurice"},{"full_name":"Kessler, Max","last_name":"Kessler","first_name":"Max"},{"last_name":"Kedrov","full_name":"Kedrov, Alexej","first_name":"Alexej"},{"first_name":"Daniel","full_name":"Mueller, Daniel","last_name":"Mueller"}],"article_type":"original","publisher":"Cell Press","publication_identifier":{"eissn":["1878-4186"],"issn":["0969-2126"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1016/j.str.2004.03.016","date_updated":"2026-09-11T12:05:19Z","publication_status":"published","issue":"5","article_processing_charge":"No","pmid":1,"status":"public","doi":"10.1016/j.str.2004.03.016","OA_type":"free access","date_published":"2004-05-01T00:00:00Z","citation":{"mla":"Janovjak, Harald L., et al. “Probing the Energy Landscape of the Membrane Protein Bacteriorhodopsin.” <i>Structure</i>, vol. 12, no. 5, Cell Press, 2004, pp. 871–79, doi:<a href=\"https://doi.org/10.1016/j.str.2004.03.016\">10.1016/j.str.2004.03.016</a>.","apa":"Janovjak, H. L., Struckmeier, J., Hubain, M., Kessler, M., Kedrov, A., &#38; Mueller, D. (2004). Probing the energy landscape of the membrane protein bacteriorhodopsin. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2004.03.016\">https://doi.org/10.1016/j.str.2004.03.016</a>","ama":"Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. Probing the energy landscape of the membrane protein bacteriorhodopsin. <i>Structure</i>. 2004;12(5):871-879. doi:<a href=\"https://doi.org/10.1016/j.str.2004.03.016\">10.1016/j.str.2004.03.016</a>","ista":"Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. 2004. Probing the energy landscape of the membrane protein bacteriorhodopsin. Structure. 12(5), 871–879.","chicago":"Janovjak, Harald L, Jens Struckmeier, Maurice Hubain, Max Kessler, Alexej Kedrov, and Daniel Mueller. “Probing the Energy Landscape of the Membrane Protein Bacteriorhodopsin.” <i>Structure</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.str.2004.03.016\">https://doi.org/10.1016/j.str.2004.03.016</a>.","short":"H.L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, D. Mueller, Structure 12 (2004) 871–879.","ieee":"H. L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, and D. Mueller, “Probing the energy landscape of the membrane protein bacteriorhodopsin,” <i>Structure</i>, vol. 12, no. 5. Cell Press, pp. 871–879, 2004."},"publist_id":"2982","oa_version":"None","type":"journal_article","external_id":{"pmid":["15130479"]},"month":"05","abstract":[{"text":"The folding and stability of transmembrane proteins is a fundamental and unsolved biological problem. Here, single bacteriorhodopsin molecules were mechanically unfolded from native purple membranes using atomic force microscopy and force spectroscopy. The energy landscape of individual transmembrane α helices and polypeptide loops was mapped by monitoring the pulling speed dependence of the unfolding forces and applying Monte Carlo simulations. Single helices formed independently stable units stabilized by a single potential barrier. Mechanical unfolding of the helices was triggered by 3.9–7.7 Å extension, while natural unfolding rates were of the order of 10−3 s−1. Besides acting as individually stable units, helices associated pairwise, establishing a collective potential barrier. The unfolding pathways of individual proteins reflect distinct pulling speed-dependent unfolding routes in their energy landscapes. These observations support the two-stage model of membrane protein folding in which α helices insert into the membrane as stable units and then assemble into the functional protein.","lang":"eng"}]},{"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publisher":"ACM","title":"&quot;GrabCut&quot; - Interactive foreground extraction using iterated graph cuts ","author":[{"last_name":"Rother","full_name":"Rother, Carsten","first_name":"Carsten"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"}],"extern":"1","_id":"3179","date_created":"2018-12-11T12:01:51Z","page":"309 - 314","year":"2004","OA_place":"publisher","language":[{"iso":"eng"}],"conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"intvolume":"        23","volume":23,"day":"01","month":"08","abstract":[{"lang":"eng","text":"The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach based on optimization by graph-cut has been developed which successfully combines both types of information. In this paper we extend the graph-cut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Thirdly, a robust algorithm for &quot;border matting&quot; has been developed to estimate simultaneously the alpha-matte around an object boundary and the colours of foreground pixels. We show that for moderately difficult examples the proposed method outperforms competitive tools."}],"oa_version":"None","publist_id":"3505","type":"conference","date_published":"2004-08-01T00:00:00Z","citation":{"chicago":"Rother, Carsten, Vladimir Kolmogorov, and Andrew Blake. “&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts ,” 23:309–14. ACM, 2004. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>.","ista":"Rother C, Kolmogorov V, Blake A. 2004. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 23, 309–314.","ama":"Rother C, Kolmogorov V, Blake A. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . In: Vol 23. ACM; 2004:309-314. doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>","ieee":"C. Rother, V. Kolmogorov, and A. Blake, “&#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2004, vol. 23, no. 3, pp. 309–314.","short":"C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.","mla":"Rother, Carsten, et al. <i>&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts </i>. Vol. 23, no. 3, ACM, 2004, pp. 309–14, doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>.","apa":"Rother, C., Kolmogorov, V., &#38; Blake, A. (2004). &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts  (Vol. 23, pp. 309–314). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>"},"status":"public","main_file_link":[{"url":"http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf"}],"doi":"10.1145/1015706.1015720","OA_type":"gold","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"3","publication_status":"published","fulldoi":"https://doi.org/10.1145/1015706.1015720","date_updated":"2026-09-11T12:16:13Z"},{"article_processing_charge":"No","year":"2004","language":[{"iso":"eng"}],"day":"15","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-09-11T11:59:01Z","publication":"Handbook of Discrete and Computational Geometry","publication_status":"published","publist_id":"2811","oa_version":"None","title":"Biological applications of computational topology","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"}],"type":"book_chapter","month":"04","publisher":"CRC Press","main_file_link":[{"url":"http://www.cs.duke.edu/~edels/Papers/2004-B-01-BiologicalApplicationsTopology.pdf"}],"status":"public","OA_type":"closed access","date_published":"2004-04-15T00:00:00Z","page":"1395 - 1412","_id":"3574","date_created":"2018-12-11T12:04:02Z","extern":"1","citation":{"mla":"Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” <i>Handbook of Discrete and Computational Geometry</i>, CRC Press, 2004, pp. 1395–412.","apa":"Edelsbrunner, H. (2004). Biological applications of computational topology. In <i>Handbook of Discrete and Computational Geometry</i> (pp. 1395–1412). CRC Press.","chicago":"Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” In <i>Handbook of Discrete and Computational Geometry</i>, 1395–1412. CRC Press, 2004.","ama":"Edelsbrunner H. Biological applications of computational topology. In: <i>Handbook of Discrete and Computational Geometry</i>. CRC Press; 2004:1395-1412.","ista":"Edelsbrunner H. 2004.Biological applications of computational topology. In: Handbook of Discrete and Computational Geometry. , 1395–1412.","short":"H. Edelsbrunner, in:, Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–1412.","ieee":"H. Edelsbrunner, “Biological applications of computational topology,” in <i>Handbook of Discrete and Computational Geometry</i>, CRC Press, 2004, pp. 1395–1412."}},{"OA_type":"closed access","doi":"10.1109/TPAMI.2004.60","status":"public","citation":{"short":"Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1124–1137.","ieee":"Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 9. IEEE, pp. 1124–1137, 2004.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2004. <a href=\"https://doi.org/10.1109/TPAMI.2004.60\">https://doi.org/10.1109/TPAMI.2004.60</a>.","ista":"Boykov Y, Kolmogorov V. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(9), 1124–1137.","ama":"Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2004;26(9):1124-1137. doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.60\">10.1109/TPAMI.2004.60</a>","apa":"Boykov, Y., &#38; Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2004.60\">https://doi.org/10.1109/TPAMI.2004.60</a>","mla":"Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 9, IEEE, 2004, pp. 1124–37, doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.60\">10.1109/TPAMI.2004.60</a>."},"date_published":"2004-09-01T00:00:00Z","external_id":{"pmid":["15742889"]},"type":"journal_article","publist_id":"3507","oa_version":"None","abstract":[{"lang":"eng","text":"Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style &quot;push -relabel&quot; methods and algorithms based on Ford-Fulkerson style &quot;augmenting paths.&quot; We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes."}],"month":"09","fulldoi":"https://doi.org/10.1109/TPAMI.2004.60","date_updated":"2026-09-16T12:51:04Z","issue":"9","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","pmid":1,"page":"1124 - 1137","_id":"3178","date_created":"2018-12-11T12:01:51Z","extern":"1","article_type":"original","author":[{"full_name":"Boykov, Yuri","last_name":"Boykov","first_name":"Yuri"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"title":"An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision","publisher":"IEEE","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"day":"01","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":26,"intvolume":"        26","language":[{"iso":"eng"}],"year":"2004"},{"intvolume":"        52","language":[{"iso":"eng"}],"year":"2004","day":"01","publication":"Magnetic Resonance in Medicine","volume":52,"article_type":"original","author":[{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nguyen, Thành","last_name":"Nguyen","first_name":"Thành"},{"last_name":"Nuval","full_name":"Nuval, Anthony","first_name":"Anthony"},{"first_name":"Pascal","last_name":"Spincemaille","full_name":"Spincemaille, Pascal"},{"last_name":"Prince","full_name":"Prince, Martin","first_name":"Martin"},{"last_name":"Zabih","full_name":"Zabih, Ramin","first_name":"Ramin"},{"full_name":"Wang, Yusu","last_name":"Wang","first_name":"Yusu"}],"title":"Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method","publication_identifier":{"issn":["0740-3194"],"eissn":["1522-2594"]},"publisher":"Wiley-Blackwell","extern":"1","date_created":"2018-12-11T12:01:48Z","_id":"3172","page":"362 - 367","article_processing_charge":"No","pmid":1,"publication_status":"published","issue":"2","fulldoi":"https://doi.org/10.1002/mrm.20162","date_updated":"2026-09-16T12:55:19Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"pmid":["15282819"]},"type":"journal_article","oa_version":"None","publist_id":"3508","abstract":[{"lang":"eng","text":"The simultaneous multiple volume (SMV) approach in navigator-gated MRI allows the use of the whole motion range or the entire scan time for the reconstruction of final images by simultaneously acquiring different image volumes at different motion states. The motion tolerance range for each volume is kept small, thus SMV substantially increases the scan efficiency of navigator methods while maintaining the effectiveness of motion suppression. This article reports a general implementation of the SMV approach using a multiprocessor scheduling algorithm. Each motion state is regarded as a processor and each volume is regarded as a job. An efficient scheduling that completes all jobs in minimal time is maintained even when the motion pattern changes. Initial experiments demonstrated that SMV significantly increased the scan efficiency of navigatorgated MRI."}],"month":"08","doi":"10.1002/mrm.20162","OA_type":"closed access","status":"public","citation":{"short":"V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih, Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367.","ieee":"V. Kolmogorov <i>et al.</i>, “Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method,” <i>Magnetic Resonance in Medicine</i>, vol. 52, no. 2. Wiley-Blackwell, pp. 362–367, 2004.","ama":"Kolmogorov V, Nguyen T, Nuval A, et al. Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method. <i>Magnetic Resonance in Medicine</i>. 2004;52(2):362-367. doi:<a href=\"https://doi.org/10.1002/mrm.20162\">10.1002/mrm.20162</a>","chicago":"Kolmogorov, Vladimir, Thành Nguyen, Anthony Nuval, Pascal Spincemaille, Martin Prince, Ramin Zabih, and Yusu Wang. “Multiprocessor Scheduling Implementation of the Simultaneous Multiple Volume SMV Navigator Method.” <i>Magnetic Resonance in Medicine</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1002/mrm.20162\">https://doi.org/10.1002/mrm.20162</a>.","ista":"Kolmogorov V, Nguyen T, Nuval A, Spincemaille P, Prince M, Zabih R, Wang Y. 2004. Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method. Magnetic Resonance in Medicine. 52(2), 362–367.","apa":"Kolmogorov, V., Nguyen, T., Nuval, A., Spincemaille, P., Prince, M., Zabih, R., &#38; Wang, Y. (2004). Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method. <i>Magnetic Resonance in Medicine</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/mrm.20162\">https://doi.org/10.1002/mrm.20162</a>","mla":"Kolmogorov, Vladimir, et al. “Multiprocessor Scheduling Implementation of the Simultaneous Multiple Volume SMV Navigator Method.” <i>Magnetic Resonance in Medicine</i>, vol. 52, no. 2, Wiley-Blackwell, 2004, pp. 362–67, doi:<a href=\"https://doi.org/10.1002/mrm.20162\">10.1002/mrm.20162</a>."},"date_published":"2004-08-01T00:00:00Z"},{"article_type":"original","author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"}],"title":"What energy functions can be minimized via graph cuts? ","publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"publisher":"IEEE","extern":"1","_id":"3173","page":"147 - 159","date_created":"2018-12-11T12:01:49Z","intvolume":"        26","language":[{"iso":"eng"}],"year":"2004","day":"01","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":26,"external_id":{"pmid":["15376891"]},"type":"journal_article","oa_version":"None","publist_id":"3509","abstract":[{"text":"In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.","lang":"eng"}],"month":"02","OA_type":"closed access","doi":"10.1109/TPAMI.2004.1262177","status":"public","citation":{"short":"V. Kolmogorov, R. Zabih, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 147–159.","ieee":"V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts? ,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 2. IEEE, pp. 147–159, 2004.","ama":"Kolmogorov V, Zabih R. What energy functions can be minimized via graph cuts? . <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2004;26(2):147-159. doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.1262177\">10.1109/TPAMI.2004.1262177</a>","ista":"Kolmogorov V, Zabih R. 2004. What energy functions can be minimized via graph cuts? . IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(2), 147–159.","chicago":"Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized via Graph Cuts? .” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2004. <a href=\"https://doi.org/10.1109/TPAMI.2004.1262177\">https://doi.org/10.1109/TPAMI.2004.1262177</a>.","mla":"Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized via Graph Cuts? .” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 2, IEEE, 2004, pp. 147–59, doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.1262177\">10.1109/TPAMI.2004.1262177</a>.","apa":"Kolmogorov, V., &#38; Zabih, R. (2004). What energy functions can be minimized via graph cuts? . <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2004.1262177\">https://doi.org/10.1109/TPAMI.2004.1262177</a>"},"date_published":"2004-02-01T00:00:00Z","article_processing_charge":"No","pmid":1,"issue":"2","publication_status":"published","fulldoi":"https://doi.org/10.1109/TPAMI.2004.1262177","date_updated":"2026-09-17T12:40:36Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"publication":"Plant Journal","volume":40,"day":"01","language":[{"iso":"eng"}],"year":"2004","intvolume":"        40","_id":"2998","page":"660 - 671","date_created":"2018-12-11T12:00:47Z","extern":"1","publisher":"Wiley-Blackwell","publication_identifier":{"eissn":["1365-313X"],"issn":["0960-7412"]},"article_type":"original","author":[{"last_name":"Duroux","full_name":"Duroux, Meg","first_name":"Meg"},{"first_name":"Andreas","last_name":"Houben","full_name":"Houben, Andreas"},{"full_name":"Růžička, Kamil","last_name":"Růžička","first_name":"Kamil"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jirí"},{"full_name":"Grasser, Klaus","last_name":"Grasser","first_name":"Klaus"}],"title":"The chromatin remodelling complex FACT associates with actively transcribed regions of the Arabidopsis genome","fulldoi":"https://doi.org/10.1111/j.1365-313X.2004.02242.x","date_updated":"2026-09-17T12:52:29Z","publication_status":"published","issue":"5","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"article_processing_charge":"No","citation":{"short":"M. Duroux, A. Houben, K. Růžička, J. Friml, K. Grasser, Plant Journal 40 (2004) 660–671.","ieee":"M. Duroux, A. Houben, K. Růžička, J. Friml, and K. Grasser, “The chromatin remodelling complex FACT associates with actively transcribed regions of the Arabidopsis genome,” <i>Plant Journal</i>, vol. 40, no. 5. Wiley-Blackwell, pp. 660–671, 2004.","ama":"Duroux M, Houben A, Růžička K, Friml J, Grasser K. The chromatin remodelling complex FACT associates with actively transcribed regions of the Arabidopsis genome. <i>Plant Journal</i>. 2004;40(5):660-671. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2004.02242.x\">10.1111/j.1365-313X.2004.02242.x</a>","ista":"Duroux M, Houben A, Růžička K, Friml J, Grasser K. 2004. The chromatin remodelling complex FACT associates with actively transcribed regions of the Arabidopsis genome. Plant Journal. 40(5), 660–671.","chicago":"Duroux, Meg, Andreas Houben, Kamil Růžička, Jiří Friml, and Klaus Grasser. “The Chromatin Remodelling Complex FACT Associates with Actively Transcribed Regions of the Arabidopsis Genome.” <i>Plant Journal</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1111/j.1365-313X.2004.02242.x\">https://doi.org/10.1111/j.1365-313X.2004.02242.x</a>.","mla":"Duroux, Meg, et al. “The Chromatin Remodelling Complex FACT Associates with Actively Transcribed Regions of the Arabidopsis Genome.” <i>Plant Journal</i>, vol. 40, no. 5, Wiley-Blackwell, 2004, pp. 660–71, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2004.02242.x\">10.1111/j.1365-313X.2004.02242.x</a>.","apa":"Duroux, M., Houben, A., Růžička, K., Friml, J., &#38; Grasser, K. (2004). The chromatin remodelling complex FACT associates with actively transcribed regions of the Arabidopsis genome. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2004.02242.x\">https://doi.org/10.1111/j.1365-313X.2004.02242.x</a>"},"date_published":"2004-12-01T00:00:00Z","OA_type":"free access","doi":"10.1111/j.1365-313X.2004.02242.x","status":"public","abstract":[{"lang":"eng","text":"The packaging of the genomic DNA into chromatin in the cell nucleus requires machineries that facilitate DNA-dependent processes such as transcription in the presence of repressive chromatin structures. Using co-immunoprecipitation we have identified in Arabidopsis thaliana cells the FAcilitates Chromatin Transcription (FACT) complex, consisting of the 120-kDa Spt16 and the 71-kDa SSRP1 proteins. Indirect immunofluorecence analyses revealed that both FACT subunits co-localize to nuclei of the majority of cell types in embryos, shoots and roots, whereas FACT is not present in terminally differentiated cells such as mature trichoblasts or cells of the root cap. In the nucleus, Spt16 and SSRP1 are found in the cytologically defined euchromatin of interphase cells independent of the status of DNA replication, but the proteins are not associated with heterochromatic chromocentres and condensed mitotic chromosomes. FACT can be detected by chromatin immunoprecipitation over the entire transcribed region (5′-UTR, coding sequence, 3′-UTR) of actively transcribed genes, whereas it does not occur at transcriptionally inactive heterochromatic regions and intergenic regions. FACT localizes to inducible genes only after induction of transcription, and the association of the complex with the genes correlates with the level of transcription. Collectively, these results indicate that FACT assists transcription elongation through plant chromatin."}],"month":"12","external_id":{"pmid":["15546350"]},"type":"journal_article","publist_id":"3703","oa_version":"None"},{"publication":"Science","volume":306,"day":"29","year":"2004","language":[{"iso":"eng"}],"intvolume":"       306","extern":"1","date_created":"2018-12-11T12:00:46Z","_id":"2997","page":"862 - 865","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"publisher":"American Association for the Advancement of Science","title":"A PINOID-dependent binary switch in apical-basal PIN polar targeting directs auxin efflux","author":[{"first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Xiong","last_name":"Yang","full_name":"Yang, Xiong"},{"first_name":"Marta","last_name":"Michniewicz","full_name":"Michniewicz, Marta"},{"last_name":"Weijers","full_name":"Weijers, Dolf","first_name":"Dolf"},{"first_name":"Ab","last_name":"Quint","full_name":"Quint, Ab"},{"first_name":"Olaf","last_name":"Tietz","full_name":"Tietz, Olaf"},{"first_name":"René","last_name":"Benjamins","full_name":"Benjamins, René"},{"first_name":"Pieter","full_name":"Ouwerkerk, Pieter","last_name":"Ouwerkerk"},{"first_name":"Karin","last_name":"Ljung","full_name":"Ljung, Karin"},{"first_name":"Göran","last_name":"Sandberg","full_name":"Sandberg, Göran"},{"first_name":"Paul","full_name":"Hooykaas, Paul","last_name":"Hooykaas"},{"first_name":"Klaus","full_name":"Palme, Klaus","last_name":"Palme"},{"full_name":"Offringa, Remko","last_name":"Offringa","first_name":"Remko"}],"article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","issue":"5697","fulldoi":"https://doi.org/10.1126/science.1100618","date_updated":"2026-09-17T13:05:22Z","pmid":1,"article_processing_charge":"No","date_published":"2004-10-29T00:00:00Z","citation":{"ista":"Friml J, Yang X, Michniewicz M, Weijers D, Quint A, Tietz O, Benjamins R, Ouwerkerk P, Ljung K, Sandberg G, Hooykaas P, Palme K, Offringa R. 2004. A PINOID-dependent binary switch in apical-basal PIN polar targeting directs auxin efflux. Science. 306(5697), 862–865.","chicago":"Friml, Jiří, Xiong Yang, Marta Michniewicz, Dolf Weijers, Ab Quint, Olaf Tietz, René Benjamins, et al. “A PINOID-Dependent Binary Switch in Apical-Basal PIN Polar Targeting Directs Auxin Efflux.” <i>Science</i>. American Association for the Advancement of Science, 2004. <a href=\"https://doi.org/10.1126/science.1100618\">https://doi.org/10.1126/science.1100618</a>.","ama":"Friml J, Yang X, Michniewicz M, et al. A PINOID-dependent binary switch in apical-basal PIN polar targeting directs auxin efflux. <i>Science</i>. 2004;306(5697):862-865. doi:<a href=\"https://doi.org/10.1126/science.1100618\">10.1126/science.1100618</a>","ieee":"J. Friml <i>et al.</i>, “A PINOID-dependent binary switch in apical-basal PIN polar targeting directs auxin efflux,” <i>Science</i>, vol. 306, no. 5697. American Association for the Advancement of Science, pp. 862–865, 2004.","short":"J. Friml, X. Yang, M. Michniewicz, D. Weijers, A. Quint, O. Tietz, R. Benjamins, P. Ouwerkerk, K. Ljung, G. Sandberg, P. Hooykaas, K. Palme, R. Offringa, Science 306 (2004) 862–865.","mla":"Friml, Jiří, et al. “A PINOID-Dependent Binary Switch in Apical-Basal PIN Polar Targeting Directs Auxin Efflux.” <i>Science</i>, vol. 306, no. 5697, American Association for the Advancement of Science, 2004, pp. 862–65, doi:<a href=\"https://doi.org/10.1126/science.1100618\">10.1126/science.1100618</a>.","apa":"Friml, J., Yang, X., Michniewicz, M., Weijers, D., Quint, A., Tietz, O., … Offringa, R. (2004). A PINOID-dependent binary switch in apical-basal PIN polar targeting directs auxin efflux. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1100618\">https://doi.org/10.1126/science.1100618</a>"},"status":"public","doi":"10.1126/science.1100618","OA_type":"closed access","month":"10","abstract":[{"text":"Polar transport-dependent local accumulation of auxin provides positional cues for multiple plant patterning processes. This directional auxin flow depends on the polar subcellular localization of the PIN auxin efflux regulators. Overexpression of the PINOID protein kinase induces a basal-to-apical shift in PIN localization, resulting in the loss of auxin gradients and strong defects in embryo and seedling roots. Conversely, pid loss of function induces an apical-to-basal shift in PIN1 polar targeting at the inflorescence apex, accompanied by defective organogenesis. Our results show that a PINOID-dependent binary switch controls PIN polarity and mediates changes in auxin flow to create local gradients for patterning processes.","lang":"eng"}],"oa_version":"None","publist_id":"3705","type":"journal_article","external_id":{"pmid":["15514156"]}}]