[{"publist_id":"3555","intvolume":"        27","publication":"Trends in Neurosciences","date_created":"2018-12-11T12:01:38Z","_id":"3142","type":"review","day":"01","status":"public","year":"2004","doi":"10.1016/j.tins.2004.05.012","page":"482 - 488","month":"08","publication_status":"published","abstract":[{"lang":"eng","text":"Assembly of neuronal circuits is controlled by the sequential acquisition of neuronal subpopulation-specific identities at progressive developmental steps. Whereas neuronal features involved in initial phases of differentiation are already established at cell-cycle exit, recent findings, based mainly on work in the peripheral nervous system, suggest that the timely integration of signals encountered en route to targets and from the target region itself is essential to control late steps in connectivity. As neurons project towards their targets they require target-derived signals to establish mature axonal projections and acquire neuronal traits such as the expression of distinct combinations of neurotransmitters. Recent evidence presented in this review shows that this principle, of a signaling interplay between target-derived signals and neuronal cell bodies, is often mediated through transcriptional events and is evolutionarily conserved."}],"issue":"8","date_published":"2004-08-01T00:00:00Z","publisher":"Elsevier","volume":27,"title":"Control of neuronal phenotype: What targets tell the cell bodies","quality_controlled":0,"extern":1,"date_updated":"2019-04-26T07:22:25Z","citation":{"ieee":"S. Hippenmeyer, I. Kramer, and S. Arber, “Control of neuronal phenotype: What targets tell the cell bodies,” <i>Trends in Neurosciences</i>, vol. 27, no. 8. Elsevier, pp. 482–488, 2004.","apa":"Hippenmeyer, S., Kramer, I., &#38; Arber, S. (2004). Control of neuronal phenotype: What targets tell the cell bodies. <i>Trends in Neurosciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tins.2004.05.012\">https://doi.org/10.1016/j.tins.2004.05.012</a>","ista":"Hippenmeyer S, Kramer I, Arber S. 2004. Control of neuronal phenotype: What targets tell the cell bodies. Trends in Neurosciences. 27(8), 482–488.","chicago":"Hippenmeyer, Simon, Ina Kramer, and Silvia Arber. “Control of Neuronal Phenotype: What Targets Tell the Cell Bodies.” <i>Trends in Neurosciences</i>. Elsevier, 2004. <a href=\"https://doi.org/10.1016/j.tins.2004.05.012\">https://doi.org/10.1016/j.tins.2004.05.012</a>.","ama":"Hippenmeyer S, Kramer I, Arber S. Control of neuronal phenotype: What targets tell the cell bodies. <i>Trends in Neurosciences</i>. 2004;27(8):482-488. doi:<a href=\"https://doi.org/10.1016/j.tins.2004.05.012\">10.1016/j.tins.2004.05.012</a>","mla":"Hippenmeyer, Simon, et al. “Control of Neuronal Phenotype: What Targets Tell the Cell Bodies.” <i>Trends in Neurosciences</i>, vol. 27, no. 8, Elsevier, 2004, pp. 482–88, doi:<a href=\"https://doi.org/10.1016/j.tins.2004.05.012\">10.1016/j.tins.2004.05.012</a>.","short":"S. Hippenmeyer, I. Kramer, S. Arber, Trends in Neurosciences 27 (2004) 482–488."},"author":[{"first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Simon Hippenmeyer"},{"full_name":"Kramer, Ina","last_name":"Kramer","first_name":"Ina"},{"full_name":"Arber, Silvia","last_name":"Arber","first_name":"Silvia"}]},{"date_published":"2004-08-01T00:00:00Z","publisher":"Wiley-Blackwell","volume":52,"title":"Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method","month":"08","publication_status":"published","abstract":[{"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.","lang":"eng"}],"issue":"2","author":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"},{"first_name":"Thành","last_name":"Nguyen","full_name":"Nguyen, Thành D"},{"last_name":"Nuval","first_name":"Anthony","full_name":"Nuval, Anthony"},{"first_name":"Pascal","last_name":"Spincemaille","full_name":"Spincemaille, Pascal"},{"full_name":"Prince, Martin R","last_name":"Prince","first_name":"Martin"},{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T07:41:34Z","citation":{"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.","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.","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>.","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>.","short":"V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih, Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367."},"publist_id":"3508","intvolume":"        52","publication":"Magnetic Resonance in Medicine","page":"362 - 367","doi":"10.1002/mrm.20162","day":"01","status":"public","year":"2004","date_created":"2018-12-11T12:01:48Z","_id":"3172","type":"journal_article"},{"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publist_id":"3509","intvolume":"        26","day":"01","page":"147 - 159","year":"2004","status":"public","doi":"10.1109/TPAMI.2004.1262177","type":"journal_article","_id":"3173","date_created":"2018-12-11T12:01:49Z","volume":26,"title":"What energy functions can be minimized via graph cuts? ","date_published":"2004-02-01T00:00:00Z","publisher":"IEEE","issue":"2","month":"02","publication_status":"published","abstract":[{"lang":"eng","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."}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"}],"citation":{"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>.","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.","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>.","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>","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>"},"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:41:34Z"},{"doi":"10.1109/CVPR.2004.1315196","year":"2004","day":"01","status":"public","page":"437 - 444","type":"conference","_id":"3177","date_created":"2018-12-11T12:01:50Z","intvolume":"         2","publist_id":"3506","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"author":[{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"}],"citation":{"short":"R. Zabih, V. Kolmogorov, in:, IEEE, 2004, pp. 437–444.","mla":"Zabih, Ramin, and Vladimir Kolmogorov. <i>Spatially Coherent Clustering Using Graph Cuts</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,” presented at the CVPR: Computer Vision and Pattern Recognition, 2004, vol. 2, pp. 437–444.","apa":"Zabih, R., &#38; Kolmogorov, V. (2004). Spatially coherent clustering using graph cuts (Vol. 2, pp. 437–444). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">https://doi.org/10.1109/CVPR.2004.1315196</a>","ista":"Zabih R, Kolmogorov V. 2004. Spatially coherent clustering using graph cuts. CVPR: Computer Vision and Pattern Recognition vol. 2, 437–444.","ama":"Zabih R, Kolmogorov V. Spatially coherent clustering using graph cuts. In: Vol 2. IEEE; 2004:437-444. doi:<a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">10.1109/CVPR.2004.1315196</a>","chicago":"Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using Graph Cuts,” 2:437–44. IEEE, 2004. <a href=\"https://doi.org/10.1109/CVPR.2004.1315196\">https://doi.org/10.1109/CVPR.2004.1315196</a>."},"date_updated":"2021-01-12T07:41:36Z","quality_controlled":0,"extern":1,"volume":2,"title":"Spatially coherent clustering using graph cuts","date_published":"2004-06-01T00:00:00Z","publisher":"IEEE","abstract":[{"lang":"eng","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."}],"month":"06","publication_status":"published"},{"publisher":"IEEE","date_published":"2004-09-01T00:00:00Z","volume":26,"title":"An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision","month":"09","publication_status":"published","abstract":[{"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.","lang":"eng"}],"issue":"9","author":[{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"}],"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:41:36Z","citation":{"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>.","short":"Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1124–1137.","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>","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>.","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>","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."},"publist_id":"3507","intvolume":"        26","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","status":"public","page":"1124 - 1137","day":"01","year":"2004","doi":"10.1109/TPAMI.2004.60","date_created":"2018-12-11T12:01:51Z","type":"journal_article","_id":"3178"},{"publisher":"ACM","date_published":"2004-08-01T00:00:00Z","title":"&quot;GrabCut&quot; - Interactive foreground extraction using iterated graph cuts ","volume":23,"publication_status":"published","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."}],"issue":"3","author":[{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"},{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"}],"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:41:36Z","citation":{"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>.","short":"C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.","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.","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>","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.","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>.","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>"},"conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"publist_id":"3505","intvolume":"        23","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf"}],"doi":"10.1145/1015706.1015720","status":"public","page":"309 - 314","year":"2004","day":"01","date_created":"2018-12-11T12:01:51Z","type":"conference","_id":"3179"},{"alternative_title":["LNCS"],"author":[{"full_name":"Maurer, Ueli M","last_name":"Maurer","first_name":"Ueli"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"}],"citation":{"ieee":"U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004, vol. 2951, pp. 410–427.","ama":"Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one strong. In: Vol 2951. Springer; 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>","ista":"Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong,” 2951:410–27. Springer, 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>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2004). Composition of random systems: When two weak make one strong (Vol. 2951, pp. 410–427). Presented at the TCC: Theory of Cryptography Conference, Springer. <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. <i>Composition of Random Systems: When Two Weak Make One Strong</i>. Vol. 2951, Springer, 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>.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427."},"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:41:48Z","volume":2951,"title":"Composition of random systems: When two weak make one strong","date_published":"2004-03-19T00:00:00Z","publisher":"Springer","month":"03","publication_status":"published","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.\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.\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)."}],"status":"public","page":"410 - 427","day":"19","year":"2004","doi":"10.1007/978-3-540-24638-1_23","_id":"3208","type":"conference","date_created":"2018-12-11T12:02:01Z","publist_id":"3471","conference":{"name":"TCC: Theory of Cryptography Conference"},"intvolume":"      2951"},{"scopus_import":"1","publication":"Internet Mathematics","intvolume":"         1","oa":1,"year":"2004","page":"115-123","doi":"10.1080/15427951.2004.10129079","day":"01","publication_status":"published","abstract":[{"lang":"eng","text":"In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web."}],"title":"Algorithmic challenges in web search engines","publisher":"Internet Mathematics","date_published":"2004-01-01T00:00:00Z","citation":{"mla":"Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>.","short":"M.H. Henzinger, Internet Mathematics 1 (2004) 115–123.","ieee":"M. H. Henzinger, “Algorithmic challenges in web search engines,” <i>Internet Mathematics</i>, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.","ama":"Henzinger MH. Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. 2004;1(1):115-123. doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>","ista":"Henzinger MH. 2004. Algorithmic challenges in web search engines. Internet Mathematics. 1(1), 115–123.","chicago":"Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>. Internet Mathematics, 2004. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>.","apa":"Henzinger, M. H. (2004). Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. Internet Mathematics. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>"},"extern":"1","date_updated":"2023-02-10T07:47:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","_id":"11762","type":"journal_article","date_created":"2022-08-08T11:55:53Z","publication_identifier":{"eissn":["1944-9488"],"issn":["1542-7951"]},"main_file_link":[{"url":"https://doi.org/10.1080/15427951.2004.10129079","open_access":"1"}],"status":"public","issue":"1","month":"01","volume":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","author":[{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}]},{"year":"2004","status":"public","publication_identifier":{"issn":["0010-3640","1097-0312"]},"day":"01","doi":"10.1002/cpa.20032","page":"1127-1158","article_type":"original","_id":"8517","type":"journal_article","date_created":"2020-09-18T10:49:12Z","publication":"Communications on Pure and Applied Mathematics","intvolume":"        57","keyword":["Applied Mathematics","General Mathematics"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Dolgopyat","first_name":"Dmitry","full_name":"Dolgopyat, Dmitry"},{"first_name":"Vadim","last_name":"Kaloshin","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim"},{"first_name":"Leonid","last_name":"Koralov","full_name":"Koralov, Leonid"}],"oa_version":"None","citation":{"ieee":"D. Dolgopyat, V. Kaloshin, and L. Koralov, “A limit shape theorem for periodic stochastic dispersion,” <i>Communications on Pure and Applied Mathematics</i>, vol. 57, no. 9. Wiley, pp. 1127–1158, 2004.","ama":"Dolgopyat D, Kaloshin V, Koralov L. A limit shape theorem for periodic stochastic dispersion. <i>Communications on Pure and Applied Mathematics</i>. 2004;57(9):1127-1158. doi:<a href=\"https://doi.org/10.1002/cpa.20032\">10.1002/cpa.20032</a>","ista":"Dolgopyat D, Kaloshin V, Koralov L. 2004. A limit shape theorem for periodic stochastic dispersion. Communications on Pure and Applied Mathematics. 57(9), 1127–1158.","chicago":"Dolgopyat, Dmitry, Vadim Kaloshin, and Leonid Koralov. “A Limit Shape Theorem for Periodic Stochastic Dispersion.” <i>Communications on Pure and Applied Mathematics</i>. Wiley, 2004. <a href=\"https://doi.org/10.1002/cpa.20032\">https://doi.org/10.1002/cpa.20032</a>.","apa":"Dolgopyat, D., Kaloshin, V., &#38; Koralov, L. (2004). A limit shape theorem for periodic stochastic dispersion. <i>Communications on Pure and Applied Mathematics</i>. Wiley. <a href=\"https://doi.org/10.1002/cpa.20032\">https://doi.org/10.1002/cpa.20032</a>","short":"D. Dolgopyat, V. Kaloshin, L. Koralov, Communications on Pure and Applied Mathematics 57 (2004) 1127–1158.","mla":"Dolgopyat, Dmitry, et al. “A Limit Shape Theorem for Periodic Stochastic Dispersion.” <i>Communications on Pure and Applied Mathematics</i>, vol. 57, no. 9, Wiley, 2004, pp. 1127–58, doi:<a href=\"https://doi.org/10.1002/cpa.20032\">10.1002/cpa.20032</a>."},"extern":"1","quality_controlled":"1","date_updated":"2021-01-12T08:19:50Z","volume":57,"title":"A limit shape theorem for periodic stochastic dispersion","article_processing_charge":"No","publisher":"Wiley","date_published":"2004-09-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"9","publication_status":"published","month":"09","abstract":[{"lang":"eng","text":"We consider the evolution of a connected set on the plane carried by a space periodic incompressible stochastic flow. While for almost every realization of the stochastic flow at time t most of the particles are at a distance of order equation image away from the origin, there is a measure zero set of points that escape to infinity at the linear rate. We study the set of points visited by the original set by time t and show that such a set, when scaled down by the factor of t, has a limiting nonrandom shape."}]},{"author":[{"full_name":"Koralov, Leonid","last_name":"Koralov","first_name":"Leonid"},{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin"},{"full_name":"Dolgopyat, Dmitry","last_name":"Dolgopyat","first_name":"Dmitry"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","quality_controlled":"1","date_updated":"2021-01-12T08:19:50Z","citation":{"ieee":"L. Koralov, V. Kaloshin, and D. Dolgopyat, “Sample path properties of the stochastic flows,” <i>The Annals of Probability</i>, vol. 32, no. 1A. Institute of Mathematical Statistics, pp. 1–27, 2004.","ista":"Koralov L, Kaloshin V, Dolgopyat D. 2004. Sample path properties of the stochastic flows. The Annals of Probability. 32(1A), 1–27.","ama":"Koralov L, Kaloshin V, Dolgopyat D. Sample path properties of the stochastic flows. <i>The Annals of Probability</i>. 2004;32(1A):1-27. doi:<a href=\"https://doi.org/10.1214/aop/1078415827\">10.1214/aop/1078415827</a>","chicago":"Koralov, Leonid, Vadim Kaloshin, and Dmitry Dolgopyat. “Sample Path Properties of the Stochastic Flows.” <i>The Annals of Probability</i>. Institute of Mathematical Statistics, 2004. <a href=\"https://doi.org/10.1214/aop/1078415827\">https://doi.org/10.1214/aop/1078415827</a>.","apa":"Koralov, L., Kaloshin, V., &#38; Dolgopyat, D. (2004). Sample path properties of the stochastic flows. <i>The Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/aop/1078415827\">https://doi.org/10.1214/aop/1078415827</a>","short":"L. Koralov, V. Kaloshin, D. Dolgopyat, The Annals of Probability 32 (2004) 1–27.","mla":"Koralov, Leonid, et al. “Sample Path Properties of the Stochastic Flows.” <i>The Annals of Probability</i>, vol. 32, no. 1A, Institute of Mathematical Statistics, 2004, pp. 1–27, doi:<a href=\"https://doi.org/10.1214/aop/1078415827\">10.1214/aop/1078415827</a>."},"oa_version":"None","date_published":"2004-03-04T00:00:00Z","publisher":"Institute of Mathematical Statistics","language":[{"iso":"eng"}],"title":"Sample path properties of the stochastic flows","volume":32,"article_processing_charge":"No","publication_status":"published","month":"03","issue":"1A","day":"04","status":"public","year":"2004","page":"1-27","doi":"10.1214/aop/1078415827","publication_identifier":{"issn":["0091-1798"]},"date_created":"2020-09-18T10:49:19Z","article_type":"original","type":"journal_article","_id":"8518","intvolume":"        32","publication":"The Annals of Probability"},{"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T08:20:22Z","citation":{"ieee":"A. Panchenko, F. Kondrashov, and S. Bryant, “Prediction of functional sites by analysis of sequence and structure conservation,” <i>Protein Science</i>, vol. 13, no. 4. Wiley-Blackwell, pp. 884–892, 2004.","chicago":"Panchenko, Anna, Fyodor Kondrashov, and Stephen Bryant. “Prediction of Functional Sites by Analysis of Sequence and Structure Conservation.” <i>Protein Science</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1110/ps.03465504\">https://doi.org/10.1110/ps.03465504</a>.","ista":"Panchenko A, Kondrashov F, Bryant S. 2004. Prediction of functional sites by analysis of sequence and structure conservation. Protein Science. 13(4), 884–892.","ama":"Panchenko A, Kondrashov F, Bryant S. Prediction of functional sites by analysis of sequence and structure conservation. <i>Protein Science</i>. 2004;13(4):884-892. doi:<a href=\"https://doi.org/10.1110/ps.03465504\">10.1110/ps.03465504</a>","apa":"Panchenko, A., Kondrashov, F., &#38; Bryant, S. (2004). Prediction of functional sites by analysis of sequence and structure conservation. <i>Protein Science</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1110/ps.03465504\">https://doi.org/10.1110/ps.03465504</a>","short":"A. Panchenko, F. Kondrashov, S. Bryant, Protein Science 13 (2004) 884–892.","mla":"Panchenko, Anna, et al. “Prediction of Functional Sites by Analysis of Sequence and Structure Conservation.” <i>Protein Science</i>, vol. 13, no. 4, Wiley-Blackwell, 2004, pp. 884–92, doi:<a href=\"https://doi.org/10.1110/ps.03465504\">10.1110/ps.03465504</a>."},"author":[{"first_name":"Anna","last_name":"Panchenko","full_name":"Panchenko, Anna R"},{"full_name":"Fyodor Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","last_name":"Kondrashov","first_name":"Fyodor"},{"last_name":"Bryant","first_name":"Stephen","full_name":"Bryant, Stephen H"}],"publication_status":"published","month":"04","abstract":[{"text":"We present a method for prediction of functional sites in a set of aligned protein sequences. The method selects sites which are both well conserved and clustered together in space, as inferred from the 3D structures of proteins included in the alignment. We tested the method using 86 alignments from the NCBI CDD database, where the sites of experimentally determined ligand and/or macromolecular interactions are annotated. In agreement with earlier investigations, we found that functional site predictions are most successful when overall background sequence conservation is low, such that sites under evolutionary constraint become apparent. In addition, we found that averaging of conservation values across spatially clustered sites improves predictions under certain conditions: that is, when overall conservation is relatively high and when the site in question involves a large macromolecular binding interface. Under these conditions it is better to look for clusters of conserved sites than to look for particular conserved sites.","lang":"eng"}],"issue":"4","date_published":"2004-04-01T00:00:00Z","publisher":"Wiley-Blackwell","title":"Prediction of functional sites by analysis of sequence and structure conservation","volume":13,"date_created":"2018-12-11T11:48:55Z","_id":"864","type":"journal_article","acknowledgement":"We thank John Spouge, Ben Shoemaker, and Michael Galperin forhelpful suggestions, and the NIH Intramural Research Program forsupport.","page":"884 - 892","doi":"10.1110/ps.03465504","status":"public","year":"2004","day":"01","publist_id":"6786","intvolume":"        13","publication":"Protein Science"},{"issue":"5","month":"01","publication_status":"published","abstract":[{"lang":"eng","text":"Only a fraction of eukaryotic genes affect the phenotype drastically. We compared 18 parameters in 1273 human morbid genes, known to cause diseases, and in the remaining 16 580 unambiguous human genes. Morbid genes evolve more slowly, have wider phylogenetic distributions, are more similar to essential genes of Drosophila melanogaster, code for longer proteins containing more alanine and glycine and less histidine, lysine and methionine, possess larger numbers of longer introns with more accurate splicing signals and have higher and broader expressions. These differences make it possible to classify as non-morbid 34% of human genes with unknown morbidity, when only 5% of known morbid genes are incorrectly classified as non-morbid. This classification can help to identify disease-causing genes among multiple candidates."}],"title":"Bioinformatical assay of human gene morbidity","volume":32,"publisher":"Oxford University Press","date_published":"2004-01-01T00:00:00Z","citation":{"ieee":"F. Kondrashov, A. Ogurtsov, and A. Kondrashov, “Bioinformatical assay of human gene morbidity,” <i>Nucleic Acids Research</i>, vol. 32, no. 5. Oxford University Press, pp. 1731–1737, 2004.","ama":"Kondrashov F, Ogurtsov A, Kondrashov A. Bioinformatical assay of human gene morbidity. <i>Nucleic Acids Research</i>. 2004;32(5):1731-1737. doi:<a href=\"https://doi.org/10.1093/nar/gkh330\">10.1093/nar/gkh330</a>","chicago":"Kondrashov, Fyodor, Aleksey Ogurtsov, and Alexey Kondrashov. “Bioinformatical Assay of Human Gene Morbidity.” <i>Nucleic Acids Research</i>. Oxford University Press, 2004. <a href=\"https://doi.org/10.1093/nar/gkh330\">https://doi.org/10.1093/nar/gkh330</a>.","ista":"Kondrashov F, Ogurtsov A, Kondrashov A. 2004. Bioinformatical assay of human gene morbidity. Nucleic Acids Research. 32(5), 1731–1737.","apa":"Kondrashov, F., Ogurtsov, A., &#38; Kondrashov, A. (2004). Bioinformatical assay of human gene morbidity. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkh330\">https://doi.org/10.1093/nar/gkh330</a>","mla":"Kondrashov, Fyodor, et al. “Bioinformatical Assay of Human Gene Morbidity.” <i>Nucleic Acids Research</i>, vol. 32, no. 5, Oxford University Press, 2004, pp. 1731–37, doi:<a href=\"https://doi.org/10.1093/nar/gkh330\">10.1093/nar/gkh330</a>.","short":"F. Kondrashov, A. Ogurtsov, A. Kondrashov, Nucleic Acids Research 32 (2004) 1731–1737."},"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T08:20:37Z","author":[{"first_name":"Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov"},{"last_name":"Ogurtsov","first_name":"Aleksey","full_name":"Ogurtsov, Aleksey Yu"},{"first_name":"Alexey","last_name":"Kondrashov","full_name":"Kondrashov, Alexey S"}],"publication":"Nucleic Acids Research","publist_id":"6780","intvolume":"        32","_id":"870","type":"journal_article","date_created":"2018-12-11T11:48:56Z","page":"1731 - 1737","year":"2004","doi":"10.1093/nar/gkh330","day":"01","status":"public"},{"publication":"Trends in Genetics","publist_id":"6775","intvolume":"        20","type":"journal_article","_id":"875","date_created":"2018-12-11T11:48:58Z","year":"2004","status":"public","day":"01","page":"287 - 291","doi":"10.1016/j.tig.2004.05.001","issue":"7","publication_status":"published","month":"07","abstract":[{"lang":"eng","text":"The dominance of wild-type alleles and the concomitant recessivity of deleterious mutant alleles might have evolved by natural selection or could be a by-product of the molecular and physiological mechanisms of gene action. We compared the properties of human haplosufficient genes, whose wild-type alleles are dominant over loss-of-function alleles, with haploinsufficient (recessive wild-type) genes, which produce an abnormal phenotype when heterozygous for a loss-of-function allele. The fraction of haplosufficient genes is the highest among the genes that encode enzymes, which is best compatible with the physiological theory. Haploinsufficient genes, on average, have more paralogs than haplosufficient genes, supporting the idea that gene dosage could be important for the initial fixation of duplications. Thus, haplo(in)sufficiency of a gene and its propensity for duplication might have a common evolutionary basis."}],"title":"A common framework for understanding the origin of genetic dominance and evolutionary fates of gene duplications","volume":20,"publisher":"Elsevier","date_published":"2004-07-01T00:00:00Z","citation":{"short":"F. Kondrashov, E. Koonin, Trends in Genetics 20 (2004) 287–291.","mla":"Kondrashov, Fyodor, and Eugene Koonin. “A Common Framework for Understanding the Origin of Genetic Dominance and Evolutionary Fates of Gene Duplications.” <i>Trends in Genetics</i>, vol. 20, no. 7, Elsevier, 2004, pp. 287–91, doi:<a href=\"https://doi.org/10.1016/j.tig.2004.05.001\">10.1016/j.tig.2004.05.001</a>.","apa":"Kondrashov, F., &#38; Koonin, E. (2004). A common framework for understanding the origin of genetic dominance and evolutionary fates of gene duplications. <i>Trends in Genetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tig.2004.05.001\">https://doi.org/10.1016/j.tig.2004.05.001</a>","chicago":"Kondrashov, Fyodor, and Eugene Koonin. “A Common Framework for Understanding the Origin of Genetic Dominance and Evolutionary Fates of Gene Duplications.” <i>Trends in Genetics</i>. Elsevier, 2004. <a href=\"https://doi.org/10.1016/j.tig.2004.05.001\">https://doi.org/10.1016/j.tig.2004.05.001</a>.","ista":"Kondrashov F, Koonin E. 2004. A common framework for understanding the origin of genetic dominance and evolutionary fates of gene duplications. Trends in Genetics. 20(7), 287–291.","ama":"Kondrashov F, Koonin E. A common framework for understanding the origin of genetic dominance and evolutionary fates of gene duplications. <i>Trends in Genetics</i>. 2004;20(7):287-291. doi:<a href=\"https://doi.org/10.1016/j.tig.2004.05.001\">10.1016/j.tig.2004.05.001</a>","ieee":"F. Kondrashov and E. Koonin, “A common framework for understanding the origin of genetic dominance and evolutionary fates of gene duplications,” <i>Trends in Genetics</i>, vol. 20, no. 7. Elsevier, pp. 287–291, 2004."},"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T08:20:54Z","author":[{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov","first_name":"Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694"},{"last_name":"Koonin","first_name":"Eugene","full_name":"Koonin, Eugene V"}]},{"citation":{"ama":"Kern A, Kondrashov F. Mechanisms and convergence of compensatory evolution in mammalian mitochondrial tRNAs. <i>Nature Genetics</i>. 2004;36(11):1207-1212. doi:<a href=\"https://doi.org/10.1038/ng1451\">10.1038/ng1451</a>","ista":"Kern A, Kondrashov F. 2004. Mechanisms and convergence of compensatory evolution in mammalian mitochondrial tRNAs. Nature Genetics. 36(11), 1207–1212.","chicago":"Kern, Andrew, and Fyodor Kondrashov. “Mechanisms and Convergence of Compensatory Evolution in Mammalian Mitochondrial TRNAs.” <i>Nature Genetics</i>. Nature Publishing Group, 2004. <a href=\"https://doi.org/10.1038/ng1451\">https://doi.org/10.1038/ng1451</a>.","apa":"Kern, A., &#38; Kondrashov, F. (2004). Mechanisms and convergence of compensatory evolution in mammalian mitochondrial tRNAs. <i>Nature Genetics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ng1451\">https://doi.org/10.1038/ng1451</a>","ieee":"A. Kern and F. Kondrashov, “Mechanisms and convergence of compensatory evolution in mammalian mitochondrial tRNAs,” <i>Nature Genetics</i>, vol. 36, no. 11. Nature Publishing Group, pp. 1207–1212, 2004.","mla":"Kern, Andrew, and Fyodor Kondrashov. “Mechanisms and Convergence of Compensatory Evolution in Mammalian Mitochondrial TRNAs.” <i>Nature Genetics</i>, vol. 36, no. 11, Nature Publishing Group, 2004, pp. 1207–12, doi:<a href=\"https://doi.org/10.1038/ng1451\">10.1038/ng1451</a>.","short":"A. Kern, F. Kondrashov, Nature Genetics 36 (2004) 1207–1212."},"date_updated":"2021-01-12T08:21:17Z","extern":1,"quality_controlled":0,"author":[{"full_name":"Kern, Andrew D","first_name":"Andrew","last_name":"Kern"},{"first_name":"Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov"}],"issue":"11","abstract":[{"lang":"eng","text":"The function of protein and RNA molecules depends on complex epistatic interactions between sites. Therefore, the deleterious effect of a mutation can be suppressed by a compensatory second-site substitution. In relating a list of 86 pathogenic mutations in human IRNAs encoded by mitochondrial genes to the sequences of their mammalian orthologs, we noted that 52 pathogenic mutations were present in normal tRNAs of one or several nonhuman mammals. We found at least five mechanisms of compensation for 32 pathogenic mutations that destroyed a Watson-Crick pair in one of the four tRNA stems: restoration of the affected Watson-Crick interaction (25 cases), strengthening of another pair (4 cases), creation of a new pair (8 cases), changes of multiple interactions in the affected stem (11 cases) and changes involving the interaction between the loop and stem structures (3 cases). A pathogenic mutation and its compensating substitution are fixed in a lineage in rapid succession, and often a compensatory interaction evolves convergently in different clades. At least 10%, and perhaps as many as 50%, of all nucleotide substitutions in evolving mammalian (RNAs participate in such interactions, indicating that the evolution of tRNAs proceeds along highly epistatic fitness ridges."}],"month":"11","publication_status":"published","title":"Mechanisms and convergence of compensatory evolution in mammalian mitochondrial tRNAs","volume":36,"date_published":"2004-11-01T00:00:00Z","publisher":"Nature Publishing Group","_id":"889","type":"journal_article","date_created":"2018-12-11T11:49:02Z","status":"public","day":"01","page":"1207 - 1212","year":"2004","doi":"10.1038/ng1451","acknowledgement":"We thank J. Gillespie, M. Hahn, L. Horth, A. Kondrashov, A. Kopp, S. Nuzhdin, M. Turelli and D. Weinreich for their contributions. The authors were supported by a grant from the US National Institutes of Health to S. Nuzhdin, and A.D.K. is a Howard Hughes","publication":"Nature Genetics","intvolume":"        36","publist_id":"6759"},{"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T08:21:37Z","citation":{"short":"G. Bazykin, F. Kondrashov, A. Ogurtsov, S. Sunyaev, A. Kondrashov, Nature 429 (2004) 558–562.","mla":"Bazykin, Georgii, et al. “Positive Selection at Sites of Multiple Amino Acid Replacements since Rat-Mouse Divergence.” <i>Nature</i>, vol. 429, no. 6991, Nature Publishing Group, 2004, pp. 558–62, doi:<a href=\"https://doi.org/10.1038/nature02601\">10.1038/nature02601</a>.","apa":"Bazykin, G., Kondrashov, F., Ogurtsov, A., Sunyaev, S., &#38; Kondrashov, A. (2004). Positive selection at sites of multiple amino acid replacements since rat-mouse divergence. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature02601\">https://doi.org/10.1038/nature02601</a>","ama":"Bazykin G, Kondrashov F, Ogurtsov A, Sunyaev S, Kondrashov A. Positive selection at sites of multiple amino acid replacements since rat-mouse divergence. <i>Nature</i>. 2004;429(6991):558-562. doi:<a href=\"https://doi.org/10.1038/nature02601\">10.1038/nature02601</a>","chicago":"Bazykin, Georgii, Fyodor Kondrashov, Aleksey Ogurtsov, Shamil Sunyaev, and Alexey Kondrashov. “Positive Selection at Sites of Multiple Amino Acid Replacements since Rat-Mouse Divergence.” <i>Nature</i>. Nature Publishing Group, 2004. <a href=\"https://doi.org/10.1038/nature02601\">https://doi.org/10.1038/nature02601</a>.","ista":"Bazykin G, Kondrashov F, Ogurtsov A, Sunyaev S, Kondrashov A. 2004. Positive selection at sites of multiple amino acid replacements since rat-mouse divergence. Nature. 429(6991), 558–562.","ieee":"G. Bazykin, F. Kondrashov, A. Ogurtsov, S. Sunyaev, and A. Kondrashov, “Positive selection at sites of multiple amino acid replacements since rat-mouse divergence,” <i>Nature</i>, vol. 429, no. 6991. Nature Publishing Group, pp. 558–562, 2004."},"author":[{"full_name":"Bazykin, Georgii A","first_name":"Georgii","last_name":"Bazykin"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov","first_name":"Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694"},{"first_name":"Aleksey","last_name":"Ogurtsov","full_name":"Ogurtsov, Aleksey Yu"},{"first_name":"Shamil","last_name":"Sunyaev","full_name":"Sunyaev, Shamil R"},{"full_name":"Kondrashov, Alexey S","first_name":"Alexey","last_name":"Kondrashov"}],"publication_status":"published","month":"06","abstract":[{"lang":"eng","text":"New alleles become fixed owing to random drift of nearly neutral mutations or to positive selection of substantially advantageous mutations. After decades of debate, the fraction of fixations driven by selection remains uncertain. Within 9,390 genes, we analysed 28,196 codons at which rat and mouse differ from each other at two nucleotide sites and 1,982 codons with three differences. At codons where rat-mouse divergence involved two non-synonymous substitutions, both of them occurred in the same lineage, either rat or mouse, in 64% of cases; however, independent substitutions would occur in the same lineage with a probability of only 50%. All three non-synonymous substitutions occurred in the same lineage for 46% of codons, instead of the 25% expected. Furthermore, comparison of 12 pairs of prokaryotic genomes also shows clumping of multiple non-synonymous substitutions in the same lineage. This pattern cannot be explained by correlated mutation or episodes of relaxed negative selection, but instead indicates that positive selection acts at many sites of rapid, successive amino acid replacement."}],"issue":"6991","publisher":"Nature Publishing Group","date_published":"2004-06-03T00:00:00Z","volume":429,"title":"Positive selection at sites of multiple amino acid replacements since rat-mouse divergence","date_created":"2018-12-11T11:49:05Z","type":"journal_article","_id":"898","acknowledgement":"We thank N. Bierne for a number of suggestions. G.A.B. was supported by a BWF graduate fellowship. S.S. was supported by Genome Canada Foundation.","status":"public","year":"2004","page":"558 - 562","day":"03","doi":"10.1038/nature02601","publist_id":"6746","intvolume":"       429","publication":"Nature"},{"type":"journal_article","_id":"1963","date_created":"2018-12-11T11:54:56Z","doi":"10.1074/jbc.M401539200","day":"28","page":"23830 - 23836","year":"2004","status":"public","acknowledgement":"This work was supported by the Medical Research Council and by a Royal Society/North Atlantic Treaty Organization postdoctoral fellowship (to A. A. M.)","publication":"Journal of Biological Chemistry","publist_id":"5123","intvolume":"       279","citation":{"mla":"Mamedova, Aygun, et al. “Substrate-Induced Conformational Change in Bacterial Complex I.” <i>Journal of Biological Chemistry</i>, vol. 279, no. 22, American Society for Biochemistry and Molecular Biology, 2004, pp. 23830–36, doi:<a href=\"https://doi.org/10.1074/jbc.M401539200\">10.1074/jbc.M401539200</a>.","short":"A. Mamedova, P. Holt, J. Carroll, L.A. Sazanov, Journal of Biological Chemistry 279 (2004) 23830–23836.","ama":"Mamedova A, Holt P, Carroll J, Sazanov LA. Substrate-induced conformational change in bacterial complex I. <i>Journal of Biological Chemistry</i>. 2004;279(22):23830-23836. doi:<a href=\"https://doi.org/10.1074/jbc.M401539200\">10.1074/jbc.M401539200</a>","chicago":"Mamedova, Aygun, Peter Holt, Joe Carroll, and Leonid A Sazanov. “Substrate-Induced Conformational Change in Bacterial Complex I.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2004. <a href=\"https://doi.org/10.1074/jbc.M401539200\">https://doi.org/10.1074/jbc.M401539200</a>.","ista":"Mamedova A, Holt P, Carroll J, Sazanov LA. 2004. Substrate-induced conformational change in bacterial complex I. Journal of Biological Chemistry. 279(22), 23830–23836.","apa":"Mamedova, A., Holt, P., Carroll, J., &#38; Sazanov, L. A. (2004). Substrate-induced conformational change in bacterial complex I. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M401539200\">https://doi.org/10.1074/jbc.M401539200</a>","ieee":"A. Mamedova, P. Holt, J. Carroll, and L. A. Sazanov, “Substrate-induced conformational change in bacterial complex I,” <i>Journal of Biological Chemistry</i>, vol. 279, no. 22. American Society for Biochemistry and Molecular Biology, pp. 23830–23836, 2004."},"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T06:54:22Z","author":[{"first_name":"Aygun","last_name":"Mamedova","full_name":"Mamedova, Aygun A"},{"full_name":"Holt, Peter J","first_name":"Peter","last_name":"Holt"},{"first_name":"Joe","last_name":"Carroll","full_name":"Carroll, Joe D"},{"full_name":"Leonid Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov"}],"issue":"22","month":"05","publication_status":"published","abstract":[{"lang":"eng","text":"The mechanism coupling electron transfer and proton pumping in respiratory complex I (NADH-ubiquinone oxidoreductase) has not been established, but it has been suggested that it involves conformational changes. Here, the influence of substrates on the conformation of purified complex I from Escherichia coli was studied by cross-linking and electron microscopy. When a zero-length cross-linking reagent was used, the presence of NAD(P)H, in contrast to that of NAD+, prevented the formation of cross-links between the hydrophilic subunits of the complex, including NuoB, NuoI, and NuoCD. Comparisons using different cross-linkers suggested that NuoB, which is likely to coordinate the key iron-sulfur cluster N2, is the most mobile subunit. The presence of NAD(P)H led also to enhanced proteolysis of subunit NuoG. These data indicate that upon NAD(P)H binding, the peripheral arm of the complex adopts a more open conformation, with increased distances between subunits. Single particle analysis showed the nature of this conformational change. The enzyme retains its L-shape in the presence of NADH, but exhibits a significantly more open or expanded structure both in the peripheral arm and, unexpectedly, in the membrane domain also."}],"title":"Substrate-induced conformational change in bacterial complex I","volume":279,"publisher":"American Society for Biochemistry and Molecular Biology","date_published":"2004-05-28T00:00:00Z"},{"date_created":"2018-12-11T11:45:13Z","type":"journal_article","_id":"209","status":"public","year":"2004","day":"17","page":"553 - 573","doi":"10.1007/s00222-004-0360-9","publist_id":"7703","intvolume":"       157","publication":"Inventiones Mathematicae","extern":1,"quality_controlled":0,"date_updated":"2021-01-12T06:55:14Z","citation":{"ama":"Browning TD, Heath Brown R. Equal sums of three powers. <i>Inventiones Mathematicae</i>. 2004;157(3):553-573. doi:<a href=\"https://doi.org/10.1007/s00222-004-0360-9\">10.1007/s00222-004-0360-9</a>","ista":"Browning TD, Heath Brown R. 2004. Equal sums of three powers. Inventiones Mathematicae. 157(3), 553–573.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Equal Sums of Three Powers.” <i>Inventiones Mathematicae</i>. Unknown, 2004. <a href=\"https://doi.org/10.1007/s00222-004-0360-9\">https://doi.org/10.1007/s00222-004-0360-9</a>.","apa":"Browning, T. D., &#38; Heath Brown, R. (2004). Equal sums of three powers. <i>Inventiones Mathematicae</i>. Unknown. <a href=\"https://doi.org/10.1007/s00222-004-0360-9\">https://doi.org/10.1007/s00222-004-0360-9</a>","ieee":"T. D. Browning and R. Heath Brown, “Equal sums of three powers,” <i>Inventiones Mathematicae</i>, vol. 157, no. 3. Unknown, pp. 553–573, 2004.","short":"T.D. Browning, R. Heath Brown, Inventiones Mathematicae 157 (2004) 553–573.","mla":"Browning, Timothy D., and Roger Heath Brown. “Equal Sums of Three Powers.” <i>Inventiones Mathematicae</i>, vol. 157, no. 3, Unknown, 2004, pp. 553–73, doi:<a href=\"https://doi.org/10.1007/s00222-004-0360-9\">10.1007/s00222-004-0360-9</a>."},"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177"},{"full_name":"Heath-Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"month":"03","publication_status":"published","issue":"3","publisher":"Unknown","date_published":"2004-03-17T00:00:00Z","title":"Equal sums of three powers","volume":157},{"status":"public","day":"09","year":"2004","page":"5322 - 5330","doi":"10.1523/JNEUROSCI.1170-04.2004","date_created":"2018-12-11T11:56:54Z","type":"journal_article","_id":"2308","publist_id":"4620","intvolume":"        24","publication":"Journal of Neuroscience","author":[{"orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","full_name":"Gaia Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Cinzia","last_name":"Fabrizi","full_name":"Fabrizi, Cinzia"},{"last_name":"Tonini","first_name":"Raffaella","full_name":"Tonini, Raffaella"},{"full_name":"Denti, Michela A","last_name":"Denti","first_name":"Michela"},{"full_name":"Malchiodi, Albedi F","last_name":"Malchiodi","first_name":"Albedi"},{"last_name":"Lauro","first_name":"Giuliana","full_name":"Lauro, Giuliana M"},{"full_name":"Sacchetti, Benedetto","last_name":"Sacchetti","first_name":"Benedetto"},{"first_name":"Silvia","last_name":"Paradisi","full_name":"Paradisi, Silvia"},{"last_name":"Ferroni","first_name":"Arnaldo","full_name":"Ferroni, Arnaldo"},{"full_name":"Curmi, Paul M G","last_name":"Curmi","first_name":"Paul"},{"full_name":"Breit, Samuel N","first_name":"Samuel","last_name":"Breit"},{"full_name":"Mazzanti, Michele","last_name":"Mazzanti","first_name":"Michele"}],"extern":1,"quality_controlled":0,"date_updated":"2021-01-12T06:56:41Z","citation":{"mla":"Novarino, Gaia, et al. “Involvement of the Intracellular Ion Channel CLIC1 in Microglia-Mediated β-Amyloid-Induced Neurotoxicity.” <i>Journal of Neuroscience</i>, vol. 24, no. 23, Society for Neuroscience, 2004, pp. 5322–30, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1170-04.2004\">10.1523/JNEUROSCI.1170-04.2004</a>.","short":"G. Novarino, C. Fabrizi, R. Tonini, M. Denti, A. Malchiodi, G. Lauro, B. Sacchetti, S. Paradisi, A. Ferroni, P. Curmi, S. Breit, M. Mazzanti, Journal of Neuroscience 24 (2004) 5322–5330.","apa":"Novarino, G., Fabrizi, C., Tonini, R., Denti, M., Malchiodi, A., Lauro, G., … Mazzanti, M. (2004). Involvement of the intracellular ion channel CLIC1 in microglia-mediated β-amyloid-induced neurotoxicity. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1170-04.2004\">https://doi.org/10.1523/JNEUROSCI.1170-04.2004</a>","chicago":"Novarino, Gaia, Cinzia Fabrizi, Raffaella Tonini, Michela Denti, Albedi Malchiodi, Giuliana Lauro, Benedetto Sacchetti, et al. “Involvement of the Intracellular Ion Channel CLIC1 in Microglia-Mediated β-Amyloid-Induced Neurotoxicity.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2004. <a href=\"https://doi.org/10.1523/JNEUROSCI.1170-04.2004\">https://doi.org/10.1523/JNEUROSCI.1170-04.2004</a>.","ama":"Novarino G, Fabrizi C, Tonini R, et al. Involvement of the intracellular ion channel CLIC1 in microglia-mediated β-amyloid-induced neurotoxicity. <i>Journal of Neuroscience</i>. 2004;24(23):5322-5330. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1170-04.2004\">10.1523/JNEUROSCI.1170-04.2004</a>","ista":"Novarino G, Fabrizi C, Tonini R, Denti M, Malchiodi A, Lauro G, Sacchetti B, Paradisi S, Ferroni A, Curmi P, Breit S, Mazzanti M. 2004. Involvement of the intracellular ion channel CLIC1 in microglia-mediated β-amyloid-induced neurotoxicity. Journal of Neuroscience. 24(23), 5322–5330.","ieee":"G. Novarino <i>et al.</i>, “Involvement of the intracellular ion channel CLIC1 in microglia-mediated β-amyloid-induced neurotoxicity,” <i>Journal of Neuroscience</i>, vol. 24, no. 23. Society for Neuroscience, pp. 5322–5330, 2004."},"publisher":"Society for Neuroscience","date_published":"2004-06-09T00:00:00Z","title":"Involvement of the intracellular ion channel CLIC1 in microglia-mediated β-amyloid-induced neurotoxicity","volume":24,"month":"06","publication_status":"published","abstract":[{"text":"It is widely believed that the inflammatory events mediated by microglial activation contribute to several neurodegenerative processes. Alzheimer's disease, for example, is characterized by an accumulation of β-amyloid protein (Aβ) in neuritic plaques that are infiltrated by reactive microglia and astrocytes. Although Aβ and its fragment 25-35 exert a direct toxic effect on neurons, they also activate microglia. Microglial activation is accompanied by morphological changes, cell proliferation, and release of various cytokines and growth factors. A number of scientific reports suggest that the increased proliferation of microglial cells is dependent on ionic membrane currents and in particular on chloride conductances. An unusual chloride ion channel known to be associated with macrophage activation is the chloride intracellular channel-1 (CLIC1). Here we show that Aβ stimulation of neonatal rat microglia specifically leads to the increase in CLIC1 protein and to the functional expression of CLIC1 chloride conductance, both barely detectable on the plasma membrane of quiescent cells. CLIC1 protein expression in microglia increases after 24 hr of incubation with Aβ, simultaneously with the production of reactive nitrogen intermediates and of tumor necrosis factor-α (TNF-α). We demonstrate that reducing CLIC1 chloride conductance by a specific blocker [IAA-94 (R(+)-[(6,7-dichloro-2-cyclopentyl-2,3-dihydro-2-methyl-1-oxo-1H-inden-5yl)-oxy] acetic acid)] prevents neuronal apoptosis in neurons cocultured with Aβ-treated microglia. Furthermore, we show that small interfering RNAs used to knock down CLIC1 expression prevent TNF-α release induced by Aβ stimulation. These results provide a direct link between Aβ-induced microglial activation and CLIC1 functional expression.","lang":"eng"}],"issue":"23"},{"publication":"Journal of Statistical Physics","intvolume":"       115","publist_id":"4568","day":"01","year":"2004","status":"public","page":"185 - 190","main_file_link":[{"url":"http://arxiv.org/abs/math-ph/0210027","open_access":"1"}],"doi":"10.1023/B:JOSS.0000019811.15510.27","_id":"2355","type":"journal_article","date_created":"2018-12-11T11:57:11Z","oa":1,"title":" Equivalent forms of the Bessis-Moussa-Villani conjecture","volume":115,"date_published":"2004-04-01T00:00:00Z","publisher":"Springer","issue":"1-2","abstract":[{"text":"The BMV conjecture for traces, which states that Tr exp(A - λB) is the Laplace transform of a positive measure, is shown to be equivalent to two other statements: (i) The polynomial λ → Tr(A + λB) p has only non-negative coefficients for all A, B ≥ 0, p ∈ ℕ and (ii) λ → Tr(A + λB)-p is the Laplace transform of a positive measure for A, B ≥ 0, p &gt; 0.","lang":"eng"}],"month":"04","publication_status":"published","author":[{"full_name":"Lieb, Élliott H","first_name":"Élliott","last_name":"Lieb"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"citation":{"short":"É. Lieb, R. Seiringer, Journal of Statistical Physics 115 (2004) 185–190.","mla":"Lieb, Élliott, and Robert Seiringer. “ Equivalent Forms of the Bessis-Moussa-Villani Conjecture.” <i>Journal of Statistical Physics</i>, vol. 115, no. 1–2, Springer, 2004, pp. 185–90, doi:<a href=\"https://doi.org/10.1023/B:JOSS.0000019811.15510.27\">10.1023/B:JOSS.0000019811.15510.27</a>.","ama":"Lieb É, Seiringer R.  Equivalent forms of the Bessis-Moussa-Villani conjecture. <i>Journal of Statistical Physics</i>. 2004;115(1-2):185-190. doi:<a href=\"https://doi.org/10.1023/B:JOSS.0000019811.15510.27\">10.1023/B:JOSS.0000019811.15510.27</a>","ista":"Lieb É, Seiringer R. 2004.  Equivalent forms of the Bessis-Moussa-Villani conjecture. Journal of Statistical Physics. 115(1–2), 185–190.","chicago":"Lieb, Élliott, and Robert Seiringer. “ Equivalent Forms of the Bessis-Moussa-Villani Conjecture.” <i>Journal of Statistical Physics</i>. Springer, 2004. <a href=\"https://doi.org/10.1023/B:JOSS.0000019811.15510.27\">https://doi.org/10.1023/B:JOSS.0000019811.15510.27</a>.","apa":"Lieb, É., &#38; Seiringer, R. (2004).  Equivalent forms of the Bessis-Moussa-Villani conjecture. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1023/B:JOSS.0000019811.15510.27\">https://doi.org/10.1023/B:JOSS.0000019811.15510.27</a>","ieee":"É. Lieb and R. Seiringer, “ Equivalent forms of the Bessis-Moussa-Villani conjecture,” <i>Journal of Statistical Physics</i>, vol. 115, no. 1–2. Springer, pp. 185–190, 2004."},"date_updated":"2021-01-12T06:56:59Z","quality_controlled":0,"extern":1},{"publication":"Communications in Mathematical Physics","publist_id":"4569","intvolume":"       244","doi":"10.1007/s00220-003-0993-3","page":"347 - 393","main_file_link":[{"url":"http://arxiv.org/abs/math-ph/0305025","open_access":"1"}],"day":"01","status":"public","year":"2004","_id":"2356","type":"journal_article","oa":1,"date_created":"2018-12-11T11:57:11Z","title":"One-dimensional behavior of dilute, trapped Bose gases","volume":244,"publisher":"Springer","date_published":"2004-01-01T00:00:00Z","issue":"2","month":"01","publication_status":"published","abstract":[{"text":"Recent experimental and theoretical work has shown that there are conditions in which a trapped, low-density Bose gas behaves like the one-dimensional delta-function Bose gas solved years ago by Lieb and Liniger. This is an intrinsically quantum-mechanical phenomenon because it is not necessary to have a trap width that is the size of an atom - as might have been supposed - but it suffices merely to have a trap width such that the energy gap for motion in the transverse direction is large compared to the energy associated with the motion along the trap. Up to now the theoretical arguments have been based on variational - perturbative ideas or numerical investigations. In contrast, this paper gives a rigorous proof of the one-dimensional behavior as far as the ground state energy and particle density are concerned. There are four parameters involved: the particle number, N, transverse and longitudinal dimensions of the trap, r and L, and the scattering length a of the interaction potential. Our main result is that if r/L → 0 and N → ∞ the ground state energy and density can be obtained by minimizing a one-dimensional density functional involving the Lieb-Liniger energy density with coupling constant ∼ a/r 2. This density functional simplifies in various limiting cases and we identify five asymptotic parameter regions altogether. Three of these, corresponding to the weak coupling regime, can also be obtained as limits of a three-dimensional Gross-Pitaevskii theory. We also show that Bose-Einstein condensation in the ground state persists in a part of this regime. In the strong coupling regime the longitudinal motion of the particles is strongly correlated. The Gross-Pitaevskii description is not valid in this regime and new mathematical methods come into play.","lang":"eng"}],"author":[{"full_name":"Lieb, Élliott H","first_name":"Élliott","last_name":"Lieb"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Robert Seiringer","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"},{"full_name":"Yngvason, Jakob","last_name":"Yngvason","first_name":"Jakob"}],"citation":{"short":"É. Lieb, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 244 (2004) 347–393.","mla":"Lieb, Élliott, et al. “One-Dimensional Behavior of Dilute, Trapped Bose Gases.” <i>Communications in Mathematical Physics</i>, vol. 244, no. 2, Springer, 2004, pp. 347–93, doi:<a href=\"https://doi.org/10.1007/s00220-003-0993-3\">10.1007/s00220-003-0993-3</a>.","ieee":"É. Lieb, R. Seiringer, and J. Yngvason, “One-dimensional behavior of dilute, trapped Bose gases,” <i>Communications in Mathematical Physics</i>, vol. 244, no. 2. Springer, pp. 347–393, 2004.","apa":"Lieb, É., Seiringer, R., &#38; Yngvason, J. (2004). One-dimensional behavior of dilute, trapped Bose gases. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-003-0993-3\">https://doi.org/10.1007/s00220-003-0993-3</a>","ista":"Lieb É, Seiringer R, Yngvason J. 2004. One-dimensional behavior of dilute, trapped Bose gases. Communications in Mathematical Physics. 244(2), 347–393.","chicago":"Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “One-Dimensional Behavior of Dilute, Trapped Bose Gases.” <i>Communications in Mathematical Physics</i>. Springer, 2004. <a href=\"https://doi.org/10.1007/s00220-003-0993-3\">https://doi.org/10.1007/s00220-003-0993-3</a>.","ama":"Lieb É, Seiringer R, Yngvason J. One-dimensional behavior of dilute, trapped Bose gases. <i>Communications in Mathematical Physics</i>. 2004;244(2):347-393. doi:<a href=\"https://doi.org/10.1007/s00220-003-0993-3\">10.1007/s00220-003-0993-3</a>"},"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T06:56:59Z"}]