[{"day":"01","department":[{"_id":"CaUh"}],"citation":{"ista":"Yu F, Fienberg S, Slaković A, Uhler C. 2014. Scalable privacy-preserving data sharing methodology for genome-wide association studies. Journal of Biomedical Informatics. 50, 133–141.","short":"F. Yu, S. Fienberg, A. Slaković, C. Uhler, Journal of Biomedical Informatics 50 (2014) 133–141.","ama":"Yu F, Fienberg S, Slaković A, Uhler C. Scalable privacy-preserving data sharing methodology for genome-wide association studies. <i>Journal of Biomedical Informatics</i>. 2014;50:133-141. doi:<a href=\"https://doi.org/10.1016/j.jbi.2014.01.008\">10.1016/j.jbi.2014.01.008</a>","ieee":"F. Yu, S. Fienberg, A. Slaković, and C. Uhler, “Scalable privacy-preserving data sharing methodology for genome-wide association studies,” <i>Journal of Biomedical Informatics</i>, vol. 50. Elsevier, pp. 133–141, 2014.","apa":"Yu, F., Fienberg, S., Slaković, A., &#38; Uhler, C. (2014). Scalable privacy-preserving data sharing methodology for genome-wide association studies. <i>Journal of Biomedical Informatics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jbi.2014.01.008\">https://doi.org/10.1016/j.jbi.2014.01.008</a>","mla":"Yu, Fei, et al. “Scalable Privacy-Preserving Data Sharing Methodology for Genome-Wide Association Studies.” <i>Journal of Biomedical Informatics</i>, vol. 50, Elsevier, 2014, pp. 133–41, doi:<a href=\"https://doi.org/10.1016/j.jbi.2014.01.008\">10.1016/j.jbi.2014.01.008</a>.","chicago":"Yu, Fei, Stephen Fienberg, Alexandra Slaković, and Caroline Uhler. “Scalable Privacy-Preserving Data Sharing Methodology for Genome-Wide Association Studies.” <i>Journal of Biomedical Informatics</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.jbi.2014.01.008\">https://doi.org/10.1016/j.jbi.2014.01.008</a>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5065","month":"08","date_published":"2014-08-01T00:00:00Z","scopus_import":1,"oa_version":"Submitted Version","date_created":"2018-12-11T11:55:12Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1401.5193"}],"intvolume":"        50","publisher":"Elsevier","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"volume":50,"author":[{"first_name":"Fei","full_name":"Yu, Fei","last_name":"Yu"},{"first_name":"Stephen","last_name":"Fienberg","full_name":"Fienberg, Stephen"},{"full_name":"Slaković, Alexandra","last_name":"Slaković","first_name":"Alexandra"},{"orcid":"0000-0002-7008-0216","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","full_name":"Uhler, Caroline"}],"oa":1,"title":"Scalable privacy-preserving data sharing methodology for genome-wide association studies","_id":"2011","year":"2014","abstract":[{"lang":"eng","text":"The protection of privacy of individual-level information in genome-wide association study (GWAS) databases has been a major concern of researchers following the publication of “an attack” on GWAS data by Homer et al. (2008). Traditional statistical methods for confidentiality and privacy protection of statistical databases do not scale well to deal with GWAS data, especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach that provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, Uhler et al. (2013) proposed new methods to release aggregate GWAS data without compromising an individual’s privacy. We extend the methods developed in Uhler et al. (2013) for releasing differentially-private χ2χ2-statistics by allowing for arbitrary number of cases and controls, and for releasing differentially-private allelic test statistics. We also provide a new interpretation by assuming the controls’ data are known, which is a realistic assumption because some GWAS use publicly available data as controls. We assess the performance of the proposed methods through a risk-utility analysis on a real data set consisting of DNA samples collected by the Wellcome Trust Case Control Consortium and compare the methods with the differentially-private release mechanism proposed by Johnson and Shmatikov (2013)."}],"doi":"10.1016/j.jbi.2014.01.008","publication":"Journal of Biomedical Informatics","date_updated":"2021-01-12T06:54:42Z","status":"public","acknowledgement":"This research was partially supported by NSF Awards EMSW21-RTG and BCS-0941518 to the Department of Statistics at Carnegie Mellon University, and by NSF Grant BCS-0941553 to the Department of Statistics at Pennsylvania State University. This work was also supported in part by the National Center for Research Resources, Grant UL1 RR033184, and is now at the National Center for Advancing Translational Sciences, Grant UL1 TR000127 to Pennsylvania State University. The content is solely the responsibility of the authors and does not necessarily represent the official views of the NSF and NIH.","publication_status":"published","page":"133 - 141"},{"title":"Sphere packing with limited overlap","oa":1,"author":[{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8030-9299","last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael"},{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216"}],"_id":"2012","abstract":[{"text":"The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice.","lang":"eng"}],"year":"2014","doi":"10.48550/arXiv.1401.0468","publication":"arXiv","date_updated":"2023-10-18T08:06:45Z","status":"public","acknowledgement":"We thank Herbert Edelsbrunner for his valuable discussions and ideas on the topic of this paper.  The second author has been supported by the Max Planck Center for Visual Computing and Communication","publication_status":"submitted","article_number":"1401.0468","citation":{"mla":"Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.” <i>ArXiv</i>, 1401.0468, doi:<a href=\"https://doi.org/10.48550/arXiv.1401.0468\">10.48550/arXiv.1401.0468</a>.","chicago":"Iglesias Ham, Mabel, Michael Kerber, and Caroline Uhler. “Sphere Packing with Limited Overlap.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1401.0468\">https://doi.org/10.48550/arXiv.1401.0468</a>.","apa":"Iglesias Ham, M., Kerber, M., &#38; Uhler, C. (n.d.). Sphere packing with limited overlap. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1401.0468\">https://doi.org/10.48550/arXiv.1401.0468</a>","ieee":"M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” <i>arXiv</i>. .","short":"M. Iglesias Ham, M. Kerber, C. Uhler, ArXiv (n.d.).","ama":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1401.0468\">10.48550/arXiv.1401.0468</a>","ista":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468."},"day":"01","department":[{"_id":"HeEd"},{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publist_id":"5064","date_published":"2014-01-01T00:00:00Z","external_id":{"arxiv":["1401.0468"]},"oa_version":"Submitted Version","date_created":"2018-12-11T11:55:12Z","main_file_link":[{"open_access":"1","url":"http://cccg.ca/proceedings/2014/papers/paper23.pdf"}],"arxiv":1,"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}]},{"oa":1,"year":"2014","publication":"Foundations of Computational Mathematics","date_updated":"2021-01-12T06:54:43Z","page":"1079 - 1116","department":[{"_id":"CaUh"}],"publist_id":"5063","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-10-10T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:55:12Z","main_file_link":[{"url":"http://arxiv.org/abs/1209.0285","open_access":"1"}],"intvolume":"        14","publisher":"Springer","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"author":[{"first_name":"Shaowei","full_name":"Lin, Shaowei","last_name":"Lin"},{"orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"first_name":"Bernd","full_name":"Sturmfels, Bernd","last_name":"Sturmfels"},{"first_name":"Peter","last_name":"Bühlmann","full_name":"Bühlmann, Peter"}],"title":"Hypersurfaces and their singularities in partial correlation testing","_id":"2013","issue":"5","abstract":[{"text":"An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log canonical thresholds from algebraic geometry. Our analysis involves the computation of the singular loci of correlation hypersurfaces. Statistical applications include the strong-faithfulness assumption for the PC algorithm and the quantification of confounder bias in causal inference. A detailed analysis is presented for trees, bow ties, tripartite graphs, and complete graphs.\r\n","lang":"eng"}],"doi":"10.1007/s10208-014-9205-0","status":"public","acknowledgement":"This work was supported in part by the US National Science Foundation (DMS-0968882) and the Defense Advanced Research Projects Agency (DARPA) Deep Learning program (FA8650-10-C-7020).","publication_status":"published","day":"10","citation":{"apa":"Lin, S., Uhler, C., Sturmfels, B., &#38; Bühlmann, P. (2014). Hypersurfaces and their singularities in partial correlation testing. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-014-9205-0\">https://doi.org/10.1007/s10208-014-9205-0</a>","ieee":"S. Lin, C. Uhler, B. Sturmfels, and P. Bühlmann, “Hypersurfaces and their singularities in partial correlation testing,” <i>Foundations of Computational Mathematics</i>, vol. 14, no. 5. Springer, pp. 1079–1116, 2014.","ista":"Lin S, Uhler C, Sturmfels B, Bühlmann P. 2014. Hypersurfaces and their singularities in partial correlation testing. Foundations of Computational Mathematics. 14(5), 1079–1116.","ama":"Lin S, Uhler C, Sturmfels B, Bühlmann P. Hypersurfaces and their singularities in partial correlation testing. <i>Foundations of Computational Mathematics</i>. 2014;14(5):1079-1116. doi:<a href=\"https://doi.org/10.1007/s10208-014-9205-0\">10.1007/s10208-014-9205-0</a>","short":"S. Lin, C. Uhler, B. Sturmfels, P. Bühlmann, Foundations of Computational Mathematics 14 (2014) 1079–1116.","chicago":"Lin, Shaowei, Caroline Uhler, Bernd Sturmfels, and Peter Bühlmann. “Hypersurfaces and Their Singularities in Partial Correlation Testing.” <i>Foundations of Computational Mathematics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10208-014-9205-0\">https://doi.org/10.1007/s10208-014-9205-0</a>.","mla":"Lin, Shaowei, et al. “Hypersurfaces and Their Singularities in Partial Correlation Testing.” <i>Foundations of Computational Mathematics</i>, vol. 14, no. 5, Springer, 2014, pp. 1079–116, doi:<a href=\"https://doi.org/10.1007/s10208-014-9205-0\">10.1007/s10208-014-9205-0</a>."},"month":"10","oa_version":"Submitted Version","volume":14},{"year":"2014","oa":1,"article_type":"original","page":"15779 - 15792","publication":"Journal of Neuroscience","date_updated":"2022-05-24T08:54:54Z","date_published":"2014-11-19T00:00:00Z","external_id":{"pmid":["25411505"]},"scopus_import":"1","date_created":"2018-12-11T11:55:14Z","department":[{"_id":"RySh"}],"publist_id":"5054","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        34","publisher":"Society for Neuroscience","issue":"47","abstract":[{"text":"Synaptic cell adhesion molecules are increasingly gaining attention for conferring specific properties to individual synapses. Netrin-G1 and netrin-G2 are trans-synaptic adhesion molecules that distribute on distinct axons, and their presence restricts the expression of their cognate receptors, NGL1 and NGL2, respectively, to specific subdendritic segments of target neurons. However, the neural circuits and functional roles of netrin-G isoform complexes remain unclear. Here, we use netrin-G-KO and NGL-KO mice to reveal that netrin-G1/NGL1 and netrin-G2/NGL2 interactions specify excitatory synapses in independent hippocampal pathways. In the hippocampal CA1 area, netrin-G1/NGL1 and netrin-G2/NGL2 were expressed in the temporoammonic and Schaffer collateral pathways, respectively. The lack of presynaptic netrin-Gs led to the dispersion of NGLs from postsynaptic membranes. In accord, netrin-G mutant synapses displayed opposing phenotypes in long-term and short-term plasticity through discrete biochemical pathways. The plasticity phenotypes in netrin-G-KOs were phenocopied in NGL-KOs, with a corresponding loss of netrin-Gs from presynaptic membranes. Our findings show that netrin-G/NGL interactions differentially control synaptic plasticity in distinct circuits via retrograde signaling mechanisms and explain how synaptic inputs are diversified to control neuronal activity.","lang":"eng"}],"doi":"10.1523/JNEUROSCI.1141-14.2014","author":[{"last_name":"Matsukawa","full_name":"Matsukawa, Hiroshi","first_name":"Hiroshi"},{"first_name":"Sachiko","full_name":"Akiyoshi Nishimura, Sachiko","last_name":"Akiyoshi Nishimura"},{"full_name":"Zhang, Qi","last_name":"Zhang","first_name":"Qi"},{"first_name":"Rafael","full_name":"Luján, Rafael","last_name":"Luján"},{"first_name":"Kazuhiko","full_name":"Yamaguchi, Kazuhiko","last_name":"Yamaguchi"},{"first_name":"Hiromichi","full_name":"Goto, Hiromichi","last_name":"Goto"},{"first_name":"Kunio","full_name":"Yaguchi, Kunio","last_name":"Yaguchi"},{"first_name":"Tsutomu","full_name":"Hashikawa, Tsutomu","last_name":"Hashikawa"},{"first_name":"Chie","full_name":"Sano, Chie","last_name":"Sano"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444"},{"first_name":"Toshiaki","last_name":"Nakashiba","full_name":"Nakashiba, Toshiaki"},{"last_name":"Itohara","full_name":"Itohara, Shigeyoshi","first_name":"Shigeyoshi"}],"title":"Netrin-G/NGL complexes encode functional synaptic diversification","_id":"2018","acknowledgement":"This work was supported by “Funding Program for World-Leading Innovative R&D on Science and Technology (FIRST Program)” initiated by the Council for Science and Technology Policy.","publication_status":"published","status":"public","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"oa_version":"Published Version","day":"19","citation":{"apa":"Matsukawa, H., Akiyoshi Nishimura, S., Zhang, Q., Luján, R., Yamaguchi, K., Goto, H., … Itohara, S. (2014). Netrin-G/NGL complexes encode functional synaptic diversification. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1141-14.2014\">https://doi.org/10.1523/JNEUROSCI.1141-14.2014</a>","ieee":"H. Matsukawa <i>et al.</i>, “Netrin-G/NGL complexes encode functional synaptic diversification,” <i>Journal of Neuroscience</i>, vol. 34, no. 47. Society for Neuroscience, pp. 15779–15792, 2014.","short":"H. Matsukawa, S. Akiyoshi Nishimura, Q. Zhang, R. Luján, K. Yamaguchi, H. Goto, K. Yaguchi, T. Hashikawa, C. Sano, R. Shigemoto, T. Nakashiba, S. Itohara, Journal of Neuroscience 34 (2014) 15779–15792.","ama":"Matsukawa H, Akiyoshi Nishimura S, Zhang Q, et al. Netrin-G/NGL complexes encode functional synaptic diversification. <i>Journal of Neuroscience</i>. 2014;34(47):15779-15792. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1141-14.2014\">10.1523/JNEUROSCI.1141-14.2014</a>","ista":"Matsukawa H, Akiyoshi Nishimura S, Zhang Q, Luján R, Yamaguchi K, Goto H, Yaguchi K, Hashikawa T, Sano C, Shigemoto R, Nakashiba T, Itohara S. 2014. Netrin-G/NGL complexes encode functional synaptic diversification. Journal of Neuroscience. 34(47), 15779–15792.","chicago":"Matsukawa, Hiroshi, Sachiko Akiyoshi Nishimura, Qi Zhang, Rafael Luján, Kazuhiko Yamaguchi, Hiromichi Goto, Kunio Yaguchi, et al. “Netrin-G/NGL Complexes Encode Functional Synaptic Diversification.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2014. <a href=\"https://doi.org/10.1523/JNEUROSCI.1141-14.2014\">https://doi.org/10.1523/JNEUROSCI.1141-14.2014</a>.","mla":"Matsukawa, Hiroshi, et al. “Netrin-G/NGL Complexes Encode Functional Synaptic Diversification.” <i>Journal of Neuroscience</i>, vol. 34, no. 47, Society for Neuroscience, 2014, pp. 15779–92, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1141-14.2014\">10.1523/JNEUROSCI.1141-14.2014</a>."},"pmid":1,"month":"11","file_date_updated":"2022-05-24T08:41:41Z","ddc":["570"],"has_accepted_license":"1","volume":34,"article_processing_charge":"No","file":[{"file_id":"11410","date_created":"2022-05-24T08:41:41Z","file_name":"2014_JournNeuroscience_Matsukawa.pdf","file_size":3963728,"creator":"dernst","relation":"main_file","success":1,"date_updated":"2022-05-24T08:41:41Z","access_level":"open_access","content_type":"application/pdf","checksum":"6913e9bc26e9fc1c0441a739a4199229"}]},{"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"Springer","intvolume":"        17","main_file_link":[{"url":"http://arxiv.org/abs/1407.1552","open_access":"1"}],"date_published":"2014-12-17T00:00:00Z","date_created":"2018-12-11T11:55:15Z","scopus_import":1,"department":[{"_id":"LaEr"}],"publist_id":"5053","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"441 - 464","publication":"Mathematical Physics, Analysis and Geometry","date_updated":"2021-01-12T06:54:45Z","year":"2014","oa":1,"volume":17,"oa_version":"Submitted Version","citation":{"chicago":"Erdös, László, and Dominik J Schröder. “Phase Transition in the Density of States of Quantum Spin Glasses.” <i>Mathematical Physics, Analysis and Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11040-014-9164-3\">https://doi.org/10.1007/s11040-014-9164-3</a>.","mla":"Erdös, László, and Dominik J. Schröder. “Phase Transition in the Density of States of Quantum Spin Glasses.” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 17, no. 3–4, Springer, 2014, pp. 441–64, doi:<a href=\"https://doi.org/10.1007/s11040-014-9164-3\">10.1007/s11040-014-9164-3</a>.","ama":"Erdös L, Schröder DJ. Phase transition in the density of states of quantum spin glasses. <i>Mathematical Physics, Analysis and Geometry</i>. 2014;17(3-4):441-464. doi:<a href=\"https://doi.org/10.1007/s11040-014-9164-3\">10.1007/s11040-014-9164-3</a>","short":"L. Erdös, D.J. Schröder, Mathematical Physics, Analysis and Geometry 17 (2014) 441–464.","ista":"Erdös L, Schröder DJ. 2014. Phase transition in the density of states of quantum spin glasses. Mathematical Physics, Analysis and Geometry. 17(3–4), 441–464.","ieee":"L. Erdös and D. J. Schröder, “Phase transition in the density of states of quantum spin glasses,” <i>Mathematical Physics, Analysis and Geometry</i>, vol. 17, no. 3–4. Springer, pp. 441–464, 2014.","apa":"Erdös, L., &#38; Schröder, D. J. (2014). Phase transition in the density of states of quantum spin glasses. <i>Mathematical Physics, Analysis and Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s11040-014-9164-3\">https://doi.org/10.1007/s11040-014-9164-3</a>"},"day":"17","month":"12","publication_status":"published","status":"public","ec_funded":1,"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"abstract":[{"lang":"eng","text":"We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent results of Keating et al. (2014) that were proved for graphs with bounded chromatic number and with symmetric coupling distribution. Furthermore, we generalise the result to arbitrary hypergraphs. We test the optimality of our condition on the maximal degree for p-uniform hypergraphs that correspond to p-spin glass Hamiltonians acting on n distinguishable spin- 1/2 particles. At the critical threshold p = n1/2 we find a sharp classical-quantum phase transition between the normal distribution and the Wigner semicircle law. The former is characteristic to classical systems with commuting variables, while the latter is a signature of noncommutative random matrix theory."}],"issue":"3-4","doi":"10.1007/s11040-014-9164-3","title":"Phase transition in the density of states of quantum spin glasses","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"},{"first_name":"Dominik J","full_name":"Schröder, Dominik J","last_name":"Schröder"}],"_id":"2019"},{"citation":{"chicago":"Ali, Shah, Simon Hippenmeyer, Lily Saadat, Liqun Luo, Irving Weissman, and Reza Ardehali. “Existing Cardiomyocytes Generate Cardiomyocytes at a Low Rate after Birth in Mice.” <i>PNAS</i>. National Academy of Sciences, 2014. <a href=\"https://doi.org/10.1073/pnas.1408233111\">https://doi.org/10.1073/pnas.1408233111</a>.","mla":"Ali, Shah, et al. “Existing Cardiomyocytes Generate Cardiomyocytes at a Low Rate after Birth in Mice.” <i>PNAS</i>, vol. 111, no. 24, National Academy of Sciences, 2014, pp. 8850–55, doi:<a href=\"https://doi.org/10.1073/pnas.1408233111\">10.1073/pnas.1408233111</a>.","apa":"Ali, S., Hippenmeyer, S., Saadat, L., Luo, L., Weissman, I., &#38; Ardehali, R. (2014). Existing cardiomyocytes generate cardiomyocytes at a low rate after birth in mice. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1408233111\">https://doi.org/10.1073/pnas.1408233111</a>","ieee":"S. Ali, S. Hippenmeyer, L. Saadat, L. Luo, I. Weissman, and R. Ardehali, “Existing cardiomyocytes generate cardiomyocytes at a low rate after birth in mice,” <i>PNAS</i>, vol. 111, no. 24. National Academy of Sciences, pp. 8850–8855, 2014.","ama":"Ali S, Hippenmeyer S, Saadat L, Luo L, Weissman I, Ardehali R. Existing cardiomyocytes generate cardiomyocytes at a low rate after birth in mice. <i>PNAS</i>. 2014;111(24):8850-8855. doi:<a href=\"https://doi.org/10.1073/pnas.1408233111\">10.1073/pnas.1408233111</a>","short":"S. Ali, S. Hippenmeyer, L. Saadat, L. Luo, I. Weissman, R. Ardehali, PNAS 111 (2014) 8850–8855.","ista":"Ali S, Hippenmeyer S, Saadat L, Luo L, Weissman I, Ardehali R. 2014. Existing cardiomyocytes generate cardiomyocytes at a low rate after birth in mice. PNAS. 111(24), 8850–8855."},"department":[{"_id":"SiHi"}],"day":"17","month":"06","publist_id":"5052","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-06-17T00:00:00Z","date_created":"2018-12-11T11:55:15Z","oa_version":"None","scopus_import":1,"publisher":"National Academy of Sciences","intvolume":"       111","volume":111,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Existing cardiomyocytes generate cardiomyocytes at a low rate after birth in mice","author":[{"first_name":"Shah","full_name":"Ali, Shah","last_name":"Ali"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer"},{"first_name":"Lily","full_name":"Saadat, Lily","last_name":"Saadat"},{"last_name":"Luo","full_name":"Luo, Liqun","first_name":"Liqun"},{"first_name":"Irving","last_name":"Weissman","full_name":"Weissman, Irving"},{"full_name":"Ardehali, Reza","last_name":"Ardehali","first_name":"Reza"}],"_id":"2020","abstract":[{"text":"The mammalian heart has long been considered a postmitotic organ, implying that the total number of cardiomyocytes is set at birth. Analysis of cell division in the mammalian heart is complicated by cardiomyocyte binucleation shortly after birth, which makes it challenging to interpret traditional assays of cell turnover [Laflamme MA, Murray CE (2011) Nature 473(7347):326–335; Bergmann O, et al. (2009) Science 324(5923):98–102]. An elegant multi-isotope imaging-mass spectrometry technique recently calculated the low, discrete rate of cardiomyocyte generation in mice [Senyo SE, et al. (2013) Nature 493(7432):433–436], yet our cellular-level understanding of postnatal cardiomyogenesis remains limited. Herein, we provide a new line of evidence for the differentiated α-myosin heavy chain-expressing cardiomyocyte as the cell of origin of postnatal cardiomyogenesis using the “mosaic analysis with double markers” mouse model. We show limited, life-long, symmetric division of cardiomyocytes as a rare event that is evident in utero but significantly diminishes after the first month of life in mice; daughter cardiomyocytes divide very seldom, which this study is the first to demonstrate, to our knowledge. Furthermore, ligation of the left anterior descending coronary artery, which causes a myocardial infarction in the mosaic analysis with double-marker mice, did not increase the rate of cardiomyocyte division above the basal level for up to 4 wk after the injury. The clonal analysis described here provides direct evidence of postnatal mammalian cardiomyogenesis.","lang":"eng"}],"year":"2014","issue":"24","doi":"10.1073/pnas.1408233111","publication":"PNAS","date_updated":"2021-01-12T06:54:46Z","status":"public","publication_status":"published","page":"8850 - 8855"},{"volume":346,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"American Association for the Advancement of Science","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4631524/"}],"intvolume":"       346","date_created":"2018-12-11T11:55:15Z","oa_version":"Submitted Version","scopus_import":1,"date_published":"2014-10-31T00:00:00Z","publist_id":"5051","month":"10","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. William, S. Hippenmeyer, and L. Luo, “Dendrite morphogenesis depends on relative levels of NT-3/TrkC signaling,” <i>Science</i>, vol. 346, no. 6209. American Association for the Advancement of Science, pp. 626–629, 2014.","apa":"William, J., Hippenmeyer, S., &#38; Luo, L. (2014). Dendrite morphogenesis depends on relative levels of NT-3/TrkC signaling. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1258996\">https://doi.org/10.1126/science.1258996</a>","ista":"William J, Hippenmeyer S, Luo L. 2014. Dendrite morphogenesis depends on relative levels of NT-3/TrkC signaling. Science. 346(6209), 626–629.","ama":"William J, Hippenmeyer S, Luo L. Dendrite morphogenesis depends on relative levels of NT-3/TrkC signaling. <i>Science</i>. 2014;346(6209):626-629. doi:<a href=\"https://doi.org/10.1126/science.1258996\">10.1126/science.1258996</a>","short":"J. William, S. Hippenmeyer, L. Luo, Science 346 (2014) 626–629.","mla":"William, Joo, et al. “Dendrite Morphogenesis Depends on Relative Levels of NT-3/TrkC Signaling.” <i>Science</i>, vol. 346, no. 6209, American Association for the Advancement of Science, 2014, pp. 626–29, doi:<a href=\"https://doi.org/10.1126/science.1258996\">10.1126/science.1258996</a>.","chicago":"William, Joo, Simon Hippenmeyer, and Liqun Luo. “Dendrite Morphogenesis Depends on Relative Levels of NT-3/TrkC Signaling.” <i>Science</i>. American Association for the Advancement of Science, 2014. <a href=\"https://doi.org/10.1126/science.1258996\">https://doi.org/10.1126/science.1258996</a>."},"department":[{"_id":"SiHi"}],"day":"31","page":"626 - 629","publication_status":"published","status":"public","date_updated":"2021-01-12T06:54:47Z","publication":"Science","doi":"10.1126/science.1258996","abstract":[{"text":"Neurotrophins regulate diverse aspects of neuronal development and plasticity, but their precise in vivo functions during neural circuit assembly in the central brain remain unclear. We show that the neurotrophin receptor tropomyosin-related kinase C (TrkC) is required for dendritic growth and branching of mouse cerebellar Purkinje cells. Sparse TrkC knockout reduced dendrite complexity, but global Purkinje cell knockout had no effect. Removal of the TrkC ligand neurotrophin-3 (NT-3) from cerebellar granule cells, which provide major afferent input to developing Purkinje cell dendrites, rescued the dendrite defects caused by sparse TrkC disruption in Purkinje cells. Our data demonstrate that NT-3 from presynaptic neurons (granule cells) is required for TrkC-dependent competitive dendrite morphogenesis in postsynaptic neurons (Purkinje cells)—a previously unknown mechanism of neural circuit development.","lang":"eng"}],"issue":"6209","year":"2014","_id":"2021","title":"Dendrite morphogenesis depends on relative levels of NT-3/TrkC signaling","oa":1,"author":[{"first_name":"Joo","full_name":"William, Joo","last_name":"William"},{"orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Luo, Liqun","last_name":"Luo","first_name":"Liqun"}]},{"publication":"Cell","date_updated":"2021-01-12T06:54:47Z","page":"775 - 788","oa":1,"year":"2014","publisher":"Cell Press","intvolume":"       159","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"SiHi"},{"_id":"Bio"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5050","date_published":"2014-11-06T00:00:00Z","date_created":"2018-12-11T11:55:16Z","scopus_import":1,"project":[{"grant_number":"618444","_id":"25D61E48-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7"},{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","grant_number":"RGP0053/2014","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level"}],"publication_status":"published","status":"public","ec_funded":1,"title":"Deterministic progenitor behavior and unitary production of neurons in the neocortex","author":[{"full_name":"Gao, Peng","last_name":"Gao","first_name":"Peng"},{"full_name":"Postiglione, Maria P","last_name":"Postiglione","id":"2C67902A-F248-11E8-B48F-1D18A9856A87","first_name":"Maria P"},{"first_name":"Teresa","full_name":"Krieger, Teresa","last_name":"Krieger"},{"full_name":"Hernandez, Luisirene","last_name":"Hernandez","first_name":"Luisirene"},{"last_name":"Wang","full_name":"Wang, Chao","first_name":"Chao"},{"last_name":"Han","full_name":"Han, Zhi","first_name":"Zhi"},{"last_name":"Streicher","full_name":"Streicher, Carmen","first_name":"Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87"},{"id":"41DB591E-F248-11E8-B48F-1D18A9856A87","first_name":"Ekaterina","full_name":"Papusheva, Ekaterina","last_name":"Papusheva"},{"first_name":"Ryan","full_name":"Insolera, Ryan","last_name":"Insolera"},{"last_name":"Chugh","full_name":"Chugh, Kritika","first_name":"Kritika"},{"full_name":"Kodish, Oren","last_name":"Kodish","first_name":"Oren"},{"full_name":"Huang, Kun","last_name":"Huang","first_name":"Kun"},{"first_name":"Benjamin","full_name":"Simons, Benjamin","last_name":"Simons"},{"last_name":"Luo","full_name":"Luo, Liqun","first_name":"Liqun"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","orcid":"0000-0003-2279-1061"},{"first_name":"Song","last_name":"Shi","full_name":"Shi, Song"}],"_id":"2022","abstract":[{"text":"Radial glial progenitors (RGPs) are responsible for producing nearly all neocortical neurons. To gain insight into the patterns of RGP division and neuron production, we quantitatively analyzed excitatory neuron genesis in the mouse neocortex using Mosaic Analysis with Double Markers, which provides single-cell resolution of progenitor division patterns and potential in vivo. We found that RGPs progress through a coherent program in which their proliferative potential diminishes in a predictable manner. Upon entry into the neurogenic phase, individual RGPs produce ∼8–9 neurons distributed in both deep and superficial layers, indicating a unitary output in neuronal production. Removal of OTX1, a transcription factor transiently expressed in RGPs, results in both deep- and superficial-layer neuron loss and a reduction in neuronal unit size. Moreover, ∼1/6 of neurogenic RGPs proceed to produce glia. These results suggest that progenitor behavior and histogenesis in the mammalian neocortex conform to a remarkably orderly and deterministic program.","lang":"eng"}],"issue":"4","doi":"10.1016/j.cell.2014.10.027","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:45:25Z","checksum":"6c5de8329bb2ffa71cba9fda750f14ce","content_type":"application/pdf","access_level":"open_access","creator":"system","file_size":4435787,"relation":"main_file","file_name":"IST-2016-423-v1+1_1-s2.0-S0092867414013154-main.pdf","date_created":"2018-12-12T10:08:47Z","file_id":"4709"}],"has_accepted_license":"1","volume":159,"citation":{"short":"P. Gao, M.P. Postiglione, T. Krieger, L. Hernandez, C. Wang, Z. Han, C. Streicher, E. Papusheva, R. Insolera, K. Chugh, O. Kodish, K. Huang, B. Simons, L. Luo, S. Hippenmeyer, S. Shi, Cell 159 (2014) 775–788.","ama":"Gao P, Postiglione MP, Krieger T, et al. Deterministic progenitor behavior and unitary production of neurons in the neocortex. <i>Cell</i>. 2014;159(4):775-788. doi:<a href=\"https://doi.org/10.1016/j.cell.2014.10.027\">10.1016/j.cell.2014.10.027</a>","ista":"Gao P, Postiglione MP, Krieger T, Hernandez L, Wang C, Han Z, Streicher C, Papusheva E, Insolera R, Chugh K, Kodish O, Huang K, Simons B, Luo L, Hippenmeyer S, Shi S. 2014. Deterministic progenitor behavior and unitary production of neurons in the neocortex. Cell. 159(4), 775–788.","apa":"Gao, P., Postiglione, M. P., Krieger, T., Hernandez, L., Wang, C., Han, Z., … Shi, S. (2014). Deterministic progenitor behavior and unitary production of neurons in the neocortex. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2014.10.027\">https://doi.org/10.1016/j.cell.2014.10.027</a>","ieee":"P. Gao <i>et al.</i>, “Deterministic progenitor behavior and unitary production of neurons in the neocortex,” <i>Cell</i>, vol. 159, no. 4. Cell Press, pp. 775–788, 2014.","chicago":"Gao, Peng, Maria P Postiglione, Teresa Krieger, Luisirene Hernandez, Chao Wang, Zhi Han, Carmen Streicher, et al. “Deterministic Progenitor Behavior and Unitary Production of Neurons in the Neocortex.” <i>Cell</i>. Cell Press, 2014. <a href=\"https://doi.org/10.1016/j.cell.2014.10.027\">https://doi.org/10.1016/j.cell.2014.10.027</a>.","mla":"Gao, Peng, et al. “Deterministic Progenitor Behavior and Unitary Production of Neurons in the Neocortex.” <i>Cell</i>, vol. 159, no. 4, Cell Press, 2014, pp. 775–88, doi:<a href=\"https://doi.org/10.1016/j.cell.2014.10.027\">10.1016/j.cell.2014.10.027</a>."},"pubrep_id":"423","day":"06","month":"11","ddc":["570"],"file_date_updated":"2020-07-14T12:45:25Z","oa_version":"Published Version"},{"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1125"}]},"page":"4589 - 4597","publication":"Ecology and Evolution","date_updated":"2023-09-07T11:55:53Z","year":"2014","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Wiley-Blackwell","intvolume":"         4","date_published":"2014-11-27T00:00:00Z","date_created":"2018-12-11T11:55:16Z","scopus_import":1,"department":[{"_id":"NiBa"}],"publist_id":"5049","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","ec_funded":1,"project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"abstract":[{"lang":"eng","text":"Understanding the evolution of dispersal is essential for understanding and predicting the dynamics of natural populations. Two main factors are known to influence dispersal evolution: spatio-temporal variation in the environment and relatedness between individuals. However, the relation between these factors is still poorly understood, and they are usually treated separately. In this article, I present a theoretical framework that contains and connects effects of both environmental variation and relatedness, and reproduces and extends their known features. Spatial habitat variation selects for balanced dispersal strategies, whereby the population is kept at an ideal free distribution. Within this class of dispersal strategies, I explain how increased dispersal is promoted by perturbations to the dispersal type frequencies. An explicit formula shows the magnitude of the selective advantage of increased dispersal in terms of the spatial variability in the frequencies of the different dispersal strategies present. These variances are capable of capturing various sources of stochasticity and hence establish a common scale for their effects on the evolution of dispersal. The results furthermore indicate an alternative approach to identifying effects of relatedness on dispersal evolution."}],"issue":"24","doi":"10.1002/ece3.1289","title":"Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution","author":[{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","full_name":"Novak, Sebastian","last_name":"Novak","orcid":"0000-0002-2519-824X"}],"_id":"2023","has_accepted_license":"1","volume":4,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:45:25Z","access_level":"open_access","content_type":"application/pdf","checksum":"9ab43db1b0fede7bfe560ed77e177b76","file_name":"IST-2016-462-v1+1_Novak-2014-Ecology_and_Evolution.pdf","creator":"system","relation":"main_file","file_size":118813,"file_id":"4946","date_created":"2018-12-12T10:12:28Z"}],"oa_version":"Published Version","citation":{"mla":"Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” <i>Ecology and Evolution</i>, vol. 4, no. 24, Wiley-Blackwell, 2014, pp. 4589–97, doi:<a href=\"https://doi.org/10.1002/ece3.1289\">10.1002/ece3.1289</a>.","chicago":"Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/ece3.1289\">https://doi.org/10.1002/ece3.1289</a>.","ista":"Novak S. 2014. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. Ecology and Evolution. 4(24), 4589–4597.","short":"S. Novak, Ecology and Evolution 4 (2014) 4589–4597.","ama":"Novak S. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. <i>Ecology and Evolution</i>. 2014;4(24):4589-4597. doi:<a href=\"https://doi.org/10.1002/ece3.1289\">10.1002/ece3.1289</a>","ieee":"S. Novak, “Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution,” <i>Ecology and Evolution</i>, vol. 4, no. 24. Wiley-Blackwell, pp. 4589–4597, 2014.","apa":"Novak, S. (2014). Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.1289\">https://doi.org/10.1002/ece3.1289</a>"},"pubrep_id":"462","day":"27","ddc":["570"],"file_date_updated":"2020-07-14T12:45:25Z","month":"11"},{"date_published":"2014-03-25T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:55:16Z","department":[{"_id":"DaSi"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5048","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"         5","publisher":"Nature Publishing Group","year":"2014","oa":1,"article_number":"3498","publication":"Nature Communications","date_updated":"2021-01-12T06:54:48Z","oa_version":"Submitted Version","day":"25","citation":{"ama":"Toshima J, Nishinoaki S, Sato Y, et al. Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole. <i>Nature Communications</i>. 2014;5. doi:<a href=\"https://doi.org/10.1038/ncomms4498\">10.1038/ncomms4498</a>","ista":"Toshima J, Nishinoaki S, Sato Y, Yamamoto W, Furukawa D, Siekhaus DE, Sawaguchi A, Toshima J. 2014. Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole. Nature Communications. 5, 3498.","short":"J. Toshima, S. Nishinoaki, Y. Sato, W. Yamamoto, D. Furukawa, D.E. Siekhaus, A. Sawaguchi, J. Toshima, Nature Communications 5 (2014).","apa":"Toshima, J., Nishinoaki, S., Sato, Y., Yamamoto, W., Furukawa, D., Siekhaus, D. E., … Toshima, J. (2014). Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms4498\">https://doi.org/10.1038/ncomms4498</a>","ieee":"J. Toshima <i>et al.</i>, “Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole,” <i>Nature Communications</i>, vol. 5. Nature Publishing Group, 2014.","chicago":"Toshima, Junko, Show Nishinoaki, Yoshifumi Sato, Wataru Yamamoto, Daiki Furukawa, Daria E Siekhaus, Akira Sawaguchi, and Jiro Toshima. “Bifurcation of the Endocytic Pathway into Rab5-Dependent and -Independent Transport to the Vacuole.” <i>Nature Communications</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/ncomms4498\">https://doi.org/10.1038/ncomms4498</a>.","mla":"Toshima, Junko, et al. “Bifurcation of the Endocytic Pathway into Rab5-Dependent and -Independent Transport to the Vacuole.” <i>Nature Communications</i>, vol. 5, 3498, Nature Publishing Group, 2014, doi:<a href=\"https://doi.org/10.1038/ncomms4498\">10.1038/ncomms4498</a>."},"pubrep_id":"616","month":"03","file_date_updated":"2020-07-14T12:45:25Z","ddc":["570"],"has_accepted_license":"1","volume":5,"file":[{"file_id":"4864","date_created":"2018-12-12T10:11:11Z","file_name":"IST-2016-616-v1+1_DaSi_Bifurcation_Postprint.pdf","relation":"main_file","creator":"system","file_size":4803515,"access_level":"open_access","content_type":"application/pdf","checksum":"614fb6579c86d1f95bdd95eeb9ab01b0","date_updated":"2020-07-14T12:45:25Z"}],"abstract":[{"text":"The yeast Rab5 homologue, Vps21p, is known to be involved both in the vacuolar protein sorting (VPS) pathway from the trans-Golgi network to the vacuole, and in the endocytic pathway from the plasma membrane to the vacuole. However, the intracellular location at which these two pathways converge remains unclear. In addition, the endocytic pathway is not completely blocked in yeast cells lacking all Rab5 genes, suggesting the existence of an unidentified route that bypasses the Rab5-dependent endocytic pathway. Here we show that convergence of the endocytic and VPS pathways occurs upstream of the requirement for Vps21p in these pathways. We also identify a previously unidentified endocytic pathway mediated by the AP-3 complex. Importantly, the AP-3-mediated pathway appears mostly intact in Rab5-disrupted cells, and thus works as an alternative route to the vacuole/lysosome. We propose that the endocytic traffic branches into two routes to reach the vacuole: a Rab5-dependent VPS pathway and a Rab5-independent AP-3-mediated pathway.","lang":"eng"}],"doi":"10.1038/ncomms4498","author":[{"first_name":"Junko","full_name":"Toshima, Junko","last_name":"Toshima"},{"last_name":"Nishinoaki","full_name":"Nishinoaki, Show","first_name":"Show"},{"first_name":"Yoshifumi","last_name":"Sato","full_name":"Sato, Yoshifumi"},{"last_name":"Yamamoto","full_name":"Yamamoto, Wataru","first_name":"Wataru"},{"full_name":"Furukawa, Daiki","last_name":"Furukawa","first_name":"Daiki"},{"orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","full_name":"Siekhaus, Daria E","last_name":"Siekhaus"},{"full_name":"Sawaguchi, Akira","last_name":"Sawaguchi","first_name":"Akira"},{"first_name":"Jiro","full_name":"Toshima, Jiro","last_name":"Toshima"}],"title":"Bifurcation of the endocytic pathway into Rab5-dependent and -independent transport to the vacuole","_id":"2024","status":"public","publication_status":"published"},{"page":"235 - 241","date_updated":"2021-01-12T06:54:49Z","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","alternative_title":["LNCS"],"year":"2014","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"intvolume":"      8837","publisher":"Springer","date_created":"2018-12-11T11:55:17Z","date_published":"2014-01-01T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5045","department":[{"_id":"ToHe"}],"ec_funded":1,"status":"public","publication_status":"published","acknowledgement":"Sponsor: P202/12/G061; GACR; Czech Science Foundation\r\n\r\n","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"doi":"10.1007/978-3-319-11936-6_17","abstract":[{"text":"We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker PRISM; secondly, deterministic generalized Rabin automata, which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to PRISM and show that this leads to a significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.","lang":"eng"}],"editor":[{"first_name":"Franck","last_name":"Cassez","full_name":"Cassez, Franck"},{"last_name":"Raskin","full_name":"Raskin, Jean-François","first_name":"Jean-François"}],"_id":"2026","author":[{"first_name":"Zuzana","last_name":"Komárková","full_name":"Komárková, Zuzana"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky"}],"title":"Rabinizer 3: Safraless translation of ltl to small deterministic automata","volume":8837,"conference":{"location":"Sydney, Australia","start_date":"2014-11-03","end_date":"2014-11-07","name":"ATVA: Automated Technology for Verification and Analysis"},"oa_version":"None","month":"01","day":"01","citation":{"mla":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 235–41, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">10.1007/978-3-319-11936-6_17</a>.","chicago":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, 8837:235–41. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">https://doi.org/10.1007/978-3-319-11936-6_17</a>.","ieee":"Z. Komárková and J. Kretinsky, “Rabinizer 3: Safraless translation of ltl to small deterministic automata,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Sydney, Australia, 2014, vol. 8837, pp. 235–241.","apa":"Komárková, Z., &#38; Kretinsky, J. (2014). Rabinizer 3: Safraless translation of ltl to small deterministic automata. In F. Cassez &#38; J.-F. Raskin (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8837, pp. 235–241). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">https://doi.org/10.1007/978-3-319-11936-6_17</a>","short":"Z. Komárková, J. Kretinsky, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 235–241.","ama":"Komárková Z, Kretinsky J. Rabinizer 3: Safraless translation of ltl to small deterministic automata. In: Cassez F, Raskin J-F, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8837. Springer; 2014:235-241. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">10.1007/978-3-319-11936-6_17</a>","ista":"Komárková Z, Kretinsky J. 2014. Rabinizer 3: Safraless translation of ltl to small deterministic automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 235–241."}},{"main_file_link":[{"url":"http://arxiv.org/abs/1402.2967","open_access":"1"}],"intvolume":"      8837","publisher":"Society of Industrial and Applied Mathematics","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5046","date_published":"2014-11-01T00:00:00Z","date_created":"2018-12-11T11:55:17Z","publication":" Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","date_updated":"2021-01-12T06:54:49Z","page":"98 - 114","oa":1,"year":"2014","alternative_title":["LNCS"],"volume":8837,"day":"01","citation":{"mla":"Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>.","ieee":"T. Brázdil <i>et al.</i>, “Verification of markov decision processes using learning algorithms,” in <i> Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Sydney, Australia, 2014, vol. 8837, pp. 98–114.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &#38; J.-F. Raskin (Eds.), <i> Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.),  Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Verification of markov decision processes using learning algorithms. In: Cassez F, Raskin J-F, eds. <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8837. Society of Industrial and Applied Mathematics; 2014:98-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>"},"month":"11","conference":{"end_date":"2014-11-07","location":"Sydney, Australia","start_date":"2014-11-03","name":"ALENEX: Algorithm Engineering and Experiments"},"oa_version":"Submitted Version","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"26241A12-B435-11E9-9278-68D0E5697425","grant_number":"24696","name":"LIGHT-REGULATED LIGAND TRAPS FOR SPATIO-TEMPORAL INHIBITION OF CELL SIGNALING"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"status":"public","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 246967 (VERIWARE), by the EU FP7 project HIERATIC, by the Czech Science Foundation grant No P202/12/P612, by EPSRC project EP/K038575/1.","publication_status":"published","ec_funded":1,"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Marta","last_name":"Kwiatkowska","full_name":"Kwiatkowska, Marta"},{"first_name":"David","full_name":"Parker, David","last_name":"Parker"},{"first_name":"Mateusz","last_name":"Ujma","full_name":"Ujma, Mateusz"}],"title":"Verification of markov decision processes using learning algorithms","_id":"2027","editor":[{"full_name":"Cassez, Franck","last_name":"Cassez","first_name":"Franck"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean-François"}],"abstract":[{"lang":"eng","text":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples."}],"doi":"10.1007/978-3-319-11936-6_8"},{"article_processing_charge":"No","volume":365,"has_accepted_license":"1","file":[{"relation":"main_file","file_size":2679222,"creator":"system","file_name":"IST-2016-444-v1+1_1-s2.0-S0022519314005888-main.pdf","checksum":"a9dbae18d3233b3dab6944fd3f2cd49e","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:25Z","date_created":"2018-12-12T10:17:58Z","file_id":"5316"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:25Z","month":"10","ddc":["570"],"day":"12","pubrep_id":"444","citation":{"ista":"Bodova K, Paydarfar D, Forger D. 2014. Characterizing spiking in noisy type II neurons.  Journal of Theoretical Biology. 365, 40–54.","ama":"Bodova K, Paydarfar D, Forger D. Characterizing spiking in noisy type II neurons. <i> Journal of Theoretical Biology</i>. 2014;365:40-54. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">10.1016/j.jtbi.2014.09.041</a>","short":"K. Bodova, D. Paydarfar, D. Forger,  Journal of Theoretical Biology 365 (2014) 40–54.","ieee":"K. Bodova, D. Paydarfar, and D. Forger, “Characterizing spiking in noisy type II neurons,” <i> Journal of Theoretical Biology</i>, vol. 365. Academic Press, pp. 40–54, 2014.","apa":"Bodova, K., Paydarfar, D., &#38; Forger, D. (2014). Characterizing spiking in noisy type II neurons. <i> Journal of Theoretical Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">https://doi.org/10.1016/j.jtbi.2014.09.041</a>","mla":"Bodova, Katarina, et al. “Characterizing Spiking in Noisy Type II Neurons.” <i> Journal of Theoretical Biology</i>, vol. 365, Academic Press, 2014, pp. 40–54, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">10.1016/j.jtbi.2014.09.041</a>.","chicago":"Bodova, Katarina, David Paydarfar, and Daniel Forger. “Characterizing Spiking in Noisy Type II Neurons.” <i> Journal of Theoretical Biology</i>. Academic Press, 2014. <a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">https://doi.org/10.1016/j.jtbi.2014.09.041</a>."},"status":"public","acknowledgement":"This work is supported by AFOSR grant FA 9550-11-1-0165, program grant RPG 24/2012 from the Human Frontiers of Science (DBF) and travel support from the European Commission Marie Curie International Reintegration Grant PIRG04-GA-2008-239429 (KB). DP was supported by NIHR01 GM104987 and the Wyss Institute of Biologically Inspired Engineering. ","publication_status":"published","doi":"10.1016/j.jtbi.2014.09.041","abstract":[{"text":"Understanding the dynamics of noisy neurons remains an important challenge in neuroscience. Here, we describe a simple probabilistic model that accurately describes the firing behavior in a large class (type II) of neurons. To demonstrate the usefulness of this model, we show how it accurately predicts the interspike interval (ISI) distributions, bursting patterns and mean firing rates found by: (1) simulations of the classic Hodgkin-Huxley model with channel noise, (2) experimental data from squid giant axon with a noisy input current and (3) experimental data on noisy firing from a neuron within the suprachiasmatic nucleus (SCN). This simple model has 6 parameters, however, in some cases, two of these parameters are coupled and only 5 parameters account for much of the known behavior. From these parameters, many properties of spiking can be found through simple calculation. Thus, we show how the complex effects of noise can be understood through a simple and general probabilistic model.","lang":"eng"}],"_id":"2028","author":[{"last_name":"Bodova","full_name":"Bodova, Katarina","first_name":"Katarina","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7214-0171"},{"full_name":"Paydarfar, David","last_name":"Paydarfar","first_name":"David"},{"full_name":"Forger, Daniel","last_name":"Forger","first_name":"Daniel"}],"title":"Characterizing spiking in noisy type II neurons","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       365","publisher":"Academic Press","scopus_import":"1","date_created":"2018-12-11T11:55:18Z","date_published":"2014-10-12T00:00:00Z","publist_id":"5043","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaTk"}],"page":"40 - 54","related_material":{"link":[{"url":"https://doi.org/10.1016/j.jtbi.2015.03.013","relation":"erratum"}]},"date_updated":"2022-08-25T14:00:47Z","publication":" Journal of Theoretical Biology","year":"2014","oa":1},{"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       108","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.4717"}],"publisher":"IOP Publishing Ltd.","scopus_import":1,"date_created":"2018-12-11T11:55:18Z","date_published":"2014-10-13T00:00:00Z","publist_id":"5044","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"article_number":"20003","date_updated":"2021-01-12T06:54:50Z","publication":"EPL","year":"2014","oa":1,"volume":108,"oa_version":"Submitted Version","month":"10","day":"13","citation":{"apa":"Correggi, M., Giuliani, A., &#38; Seiringer, R. (2014). Validity of spin-wave theory for the quantum Heisenberg model. <i>EPL</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1209/0295-5075/108/20003\">https://doi.org/10.1209/0295-5075/108/20003</a>","ieee":"M. Correggi, A. Giuliani, and R. Seiringer, “Validity of spin-wave theory for the quantum Heisenberg model,” <i>EPL</i>, vol. 108, no. 2. IOP Publishing Ltd., 2014.","short":"M. Correggi, A. Giuliani, R. Seiringer, EPL 108 (2014).","ama":"Correggi M, Giuliani A, Seiringer R. Validity of spin-wave theory for the quantum Heisenberg model. <i>EPL</i>. 2014;108(2). doi:<a href=\"https://doi.org/10.1209/0295-5075/108/20003\">10.1209/0295-5075/108/20003</a>","ista":"Correggi M, Giuliani A, Seiringer R. 2014. Validity of spin-wave theory for the quantum Heisenberg model. EPL. 108(2), 20003.","chicago":"Correggi, Michele, Alessandro Giuliani, and Robert Seiringer. “Validity of Spin-Wave Theory for the Quantum Heisenberg Model.” <i>EPL</i>. IOP Publishing Ltd., 2014. <a href=\"https://doi.org/10.1209/0295-5075/108/20003\">https://doi.org/10.1209/0295-5075/108/20003</a>.","mla":"Correggi, Michele, et al. “Validity of Spin-Wave Theory for the Quantum Heisenberg Model.” <i>EPL</i>, vol. 108, no. 2, 20003, IOP Publishing Ltd., 2014, doi:<a href=\"https://doi.org/10.1209/0295-5075/108/20003\">10.1209/0295-5075/108/20003</a>."},"acknowledgement":"239694; ERC; European Research Council","status":"public","publication_status":"published","doi":"10.1209/0295-5075/108/20003","issue":"2","abstract":[{"lang":"eng","text":"Spin-wave theory is a key ingredient in our comprehension of quantum spin systems, and is used successfully for understanding a wide range of magnetic phenomena, including magnon condensation and stability of patterns in dipolar systems. Nevertheless, several decades of research failed to establish the validity of spin-wave theory rigorously, even for the simplest models of quantum spins. A rigorous justification of the method for the three-dimensional quantum Heisenberg ferromagnet at low temperatures is presented here. We derive sharp bounds on its free energy by combining a bosonic formulation of the model introduced by Holstein and Primakoff with probabilistic estimates and operator inequalities."}],"_id":"2029","author":[{"last_name":"Correggi","full_name":"Correggi, Michele","first_name":"Michele"},{"first_name":"Alessandro","last_name":"Giuliani","full_name":"Giuliani, Alessandro"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"title":"Validity of spin-wave theory for the quantum Heisenberg model"},{"oa":1,"year":"2014","date_updated":"2021-01-12T06:54:51Z","publication":"eLife","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5041","department":[{"_id":"PeJo"}],"scopus_import":1,"date_created":"2018-12-11T11:55:19Z","date_published":"2014-12-09T00:00:00Z","intvolume":"         3","publisher":"eLife Sciences Publications","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"_id":"2031","author":[{"last_name":"Arai","full_name":"Arai, Itaru","first_name":"Itaru","id":"32A73F6C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas"}],"title":"Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse","doi":"10.7554/eLife.04057","abstract":[{"text":"A puzzling property of synaptic transmission, originally established at the neuromuscular junction, is that the time course of transmitter release is independent of the extracellular Ca2+ concentration ([Ca2+]o), whereas the rate of release is highly [Ca2+]o-dependent. Here, we examine the time course of release at inhibitory basket cell-Purkinje cell synapses and show that it is independent of [Ca2+]o. Modeling of Ca2+-dependent transmitter release suggests that the invariant time course of release critically depends on tight coupling between Ca2+ channels and release sensors. Experiments with exogenous Ca2+ chelators reveal that channel-sensor coupling at basket cell-Purkinje cell synapses is very tight, with a mean distance of 10–20 nm. Thus, tight channel-sensor coupling provides a mechanistic explanation for the apparent [Ca2+]o independence of the time course of release.","lang":"eng"}],"project":[{"grant_number":"P24909-B24","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF"},{"grant_number":"268548","_id":"25C0F108-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons"}],"ec_funded":1,"publication_status":"published","status":"public","file_date_updated":"2020-07-14T12:45:26Z","month":"12","ddc":["570"],"day":"09","pubrep_id":"421","citation":{"ista":"Arai  itaru, Jonas PM. 2014. Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. eLife. 3.","short":"itaru Arai, P.M. Jonas, ELife 3 (2014).","ama":"Arai  itaru, Jonas PM. Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. <i>eLife</i>. 2014;3. doi:<a href=\"https://doi.org/10.7554/eLife.04057\">10.7554/eLife.04057</a>","apa":"Arai,  itaru, &#38; Jonas, P. M. (2014). Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.04057\">https://doi.org/10.7554/eLife.04057</a>","ieee":"itaru Arai and P. M. Jonas, “Nanodomain coupling explains Ca^2+ independence of transmitter release time course at a fast central synapse,” <i>eLife</i>, vol. 3. eLife Sciences Publications, 2014.","chicago":"Arai, itaru, and Peter M Jonas. “Nanodomain Coupling Explains Ca^2+ Independence of Transmitter Release Time Course at a Fast Central Synapse.” <i>ELife</i>. eLife Sciences Publications, 2014. <a href=\"https://doi.org/10.7554/eLife.04057\">https://doi.org/10.7554/eLife.04057</a>.","mla":"Arai, itaru, and Peter M. Jonas. “Nanodomain Coupling Explains Ca^2+ Independence of Transmitter Release Time Course at a Fast Central Synapse.” <i>ELife</i>, vol. 3, eLife Sciences Publications, 2014, doi:<a href=\"https://doi.org/10.7554/eLife.04057\">10.7554/eLife.04057</a>."},"oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","content_type":"application/pdf","checksum":"c240f915450d4ebe8f95043a2a8c7b1a","file_name":"IST-2016-421-v1+1_e04057.full.pdf","file_size":2239563,"relation":"main_file","creator":"system","file_id":"5094","date_created":"2018-12-12T10:14:41Z"}],"volume":3,"has_accepted_license":"1"},{"publication_status":"published","status":"public","issue":"4","abstract":[{"lang":"eng","text":"As light-based control of fundamental signaling pathways is becoming a reality, the field of optogenetics is rapidly moving beyond neuroscience. We have recently developed receptor tyrosine kinases that are activated by light and control cell proliferation, epithelial–mesenchymal transition, and angiogenic sprouting—cell behaviors central to cancer progression."}],"doi":"10.4161/23723548.2014.964045","author":[{"orcid":"0000-0002-5409-8571","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto"},{"orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"},{"last_name":"Schelch","full_name":"Schelch, Karin","first_name":"Karin"},{"orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L"},{"first_name":"Michael","last_name":"Grusch","full_name":"Grusch, Michael"}],"title":"The optogenetic promise for oncology: Episode I","_id":"2032","has_accepted_license":"1","volume":1,"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"file":[{"creator":"kschuh","relation":"main_file","file_size":1765933,"file_name":"2014_Taylor_Alvaro.pdf","date_updated":"2020-07-14T12:45:26Z","content_type":"application/pdf","checksum":"44e17ad40577ab46eb602e88a8b0b8fd","access_level":"open_access","date_created":"2019-05-16T13:39:11Z","file_id":"6464"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","oa_version":"Published Version","day":"31","citation":{"apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Schelch, K., Janovjak, H. L., &#38; Grusch, M. (2014). The optogenetic promise for oncology: Episode I. <i>Molecular and Cellular Oncology</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.4161/23723548.2014.964045\">https://doi.org/10.4161/23723548.2014.964045</a>","ieee":"Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H. L. Janovjak, and M. Grusch, “The optogenetic promise for oncology: Episode I,” <i>Molecular and Cellular Oncology</i>, vol. 1, no. 4. Taylor &#38; Francis, 2014.","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H.L. Janovjak, M. Grusch, Molecular and Cellular Oncology 1 (2014).","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M. The optogenetic promise for oncology: Episode I. <i>Molecular and Cellular Oncology</i>. 2014;1(4). doi:<a href=\"https://doi.org/10.4161/23723548.2014.964045\">10.4161/23723548.2014.964045</a>","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M. 2014. The optogenetic promise for oncology: Episode I. Molecular and Cellular Oncology. 1(4), e964045.","chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Karin Schelch, Harald L Janovjak, and Michael Grusch. “The Optogenetic Promise for Oncology: Episode I.” <i>Molecular and Cellular Oncology</i>. Taylor &#38; Francis, 2014. <a href=\"https://doi.org/10.4161/23723548.2014.964045\">https://doi.org/10.4161/23723548.2014.964045</a>.","mla":"Inglés Prieto, Álvaro, et al. “The Optogenetic Promise for Oncology: Episode I.” <i>Molecular and Cellular Oncology</i>, vol. 1, no. 4, e964045, Taylor &#38; Francis, 2014, doi:<a href=\"https://doi.org/10.4161/23723548.2014.964045\">10.4161/23723548.2014.964045</a>."},"month":"12","ddc":["570"],"file_date_updated":"2020-07-14T12:45:26Z","article_number":"e964045","publication":"Molecular and Cellular Oncology","date_updated":"2021-01-12T06:54:51Z","year":"2014","oa":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":"         1","publisher":"Taylor & Francis","date_published":"2014-12-31T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:55:19Z","department":[{"_id":"HaJa"}],"publist_id":"5040","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"page":"837-845","status":"public","publication_status":"published","date_updated":"2023-02-23T10:25:24Z","publication":"Advances in Neural Information Processing Systems","year":"2014","issue":"January","abstract":[{"text":"The learning with privileged information setting has recently attracted a lot of attention within the machine learning community, as it allows the integration of additional knowledge into the training process of a classifier, even when this comes in the form of a data modality that is not available at test time. Here, we show that privileged information can naturally be treated as noise in the latent function of a Gaussian process classifier (GPC). That is, in contrast to the standard GPC setting, the latent function is not just a nuisance but a feature: it becomes a natural measure of confidence about the training data by modulating the slope of the GPC probit likelihood function. Extensive experiments on public datasets show that the proposed GPC method using privileged noise, called GPC+, improves over a standard GPC without privileged knowledge, and also over the current state-of-the-art SVM-based method, SVM+. Moreover, we show that advanced neural networks and deep learning methods can be compressed as privileged information.","lang":"eng"}],"_id":"2033","author":[{"first_name":"Daniel","full_name":"Hernandez Lobato, Daniel","last_name":"Hernandez Lobato"},{"first_name":"Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308"},{"first_name":"Kristian","full_name":"Kersting, Kristian","last_name":"Kersting"},{"last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"}],"title":"Mind the nuisance: Gaussian process classification using privileged noise","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","volume":1,"main_file_link":[{"open_access":"1","url":"https://papers.nips.cc/paper/5373-mind-the-nuisance-gaussian-process-classification-using-privileged-noise"}],"intvolume":"         1","publisher":"Neural Information Processing Systems","conference":{"name":"NIPS: Neural Information Processing Systems","location":"Montreal, Canada","start_date":"2014-12-08","end_date":"2014-12-13"},"scopus_import":1,"date_created":"2018-12-11T11:55:20Z","oa_version":"Submitted Version","date_published":"2014-12-08T00:00:00Z","publist_id":"5038","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"12","day":"08","department":[{"_id":"ChLa"}],"citation":{"apa":"Hernandez Lobato, D., Sharmanska, V., Kersting, K., Lampert, C., &#38; Quadrianto, N. (2014). Mind the nuisance: Gaussian process classification using privileged noise. In <i>Advances in Neural Information Processing Systems</i> (Vol. 1, pp. 837–845). Montreal, Canada: Neural Information Processing Systems.","ieee":"D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, and N. Quadrianto, “Mind the nuisance: Gaussian process classification using privileged noise,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2014, vol. 1, no. January, pp. 837–845.","ama":"Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. Mind the nuisance: Gaussian process classification using privileged noise. In: <i>Advances in Neural Information Processing Systems</i>. Vol 1. Neural Information Processing Systems; 2014:837-845.","ista":"Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. 2014. Mind the nuisance: Gaussian process classification using privileged noise. Advances in Neural Information Processing Systems. NIPS: Neural Information Processing Systems vol. 1, 837–845.","short":"D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, N. Quadrianto, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems, 2014, pp. 837–845.","chicago":"Hernandez Lobato, Daniel, Viktoriia Sharmanska, Kristian Kersting, Christoph Lampert, and Novi Quadrianto. “Mind the Nuisance: Gaussian Process Classification Using Privileged Noise.” In <i>Advances in Neural Information Processing Systems</i>, 1:837–45. Neural Information Processing Systems, 2014.","mla":"Hernandez Lobato, Daniel, et al. “Mind the Nuisance: Gaussian Process Classification Using Privileged Noise.” <i>Advances in Neural Information Processing Systems</i>, vol. 1, no. January, Neural Information Processing Systems, 2014, pp. 837–45."}},{"year":"2014","oa":1,"article_number":"20141679","related_material":{"record":[{"relation":"research_data","status":"public","id":"9741"}]},"date_updated":"2023-02-23T14:06:44Z","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","date_created":"2018-12-11T11:55:21Z","scopus_import":1,"date_published":"2014-09-17T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5019","department":[{"_id":"CaGu"}],"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"Royal Society, The","intvolume":"       281","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4211454/"}],"doi":"10.1098/rspb.2014.1679","abstract":[{"lang":"eng","text":" In rapidly changing environments, selection history may impact the dynamics of adaptation. Mutations selected in one environment may result in pleiotropic fitness trade-offs in subsequent novel environments, slowing the rates of adaptation. Epistatic interactions between mutations selected in sequential stressful environments may slow or accelerate subsequent rates of adaptation, depending on the nature of that interaction. We explored the dynamics of adaptation during sequential exposure to herbicides with different modes of action in Chlamydomonas reinhardtii. Evolution of resistance to two of the herbicides was largely independent of selection history. For carbetamide, previous adaptation to other herbicide modes of action positively impacted the likelihood of adaptation to this herbicide. Furthermore, while adaptation to all individual herbicides was associated with pleiotropic fitness costs in stress-free environments, we observed that accumulation of resistance mechanisms was accompanied by a reduction in overall fitness costs. We suggest that antagonistic epistasis may be a driving mechanism that enables populations to more readily adapt in novel environments. These findings highlight the potential for sequences of xenobiotics to facilitate the rapid evolution of multiple-drug and -pesticide resistance, as well as the potential for epistatic interactions between adaptive mutations to facilitate evolutionary rescue in rapidly changing environments. "}],"issue":"1794","_id":"2036","title":"Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses","author":[{"full_name":"Lagator, Mato","last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato"},{"first_name":"Nick","last_name":"Colegrave","full_name":"Colegrave, Nick"},{"first_name":"Paul","last_name":"Neve","full_name":"Neve, Paul"}],"publication_status":"published","acknowledgement":"The project was supported by Leverhulme Trust.","status":"public","oa_version":"Submitted Version","month":"09","citation":{"mla":"Lagator, Mato, et al. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794, 20141679, Royal Society, The, 2014, doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>.","chicago":"Lagator, Mato, Nick Colegrave, and Paul Neve. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The, 2014. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>.","ieee":"M. Lagator, N. Colegrave, and P. Neve, “Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794. Royal Society, The, 2014.","apa":"Lagator, M., Colegrave, N., &#38; Neve, P. (2014). Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>","ama":"Lagator M, Colegrave N, Neve P. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2014;281(1794). doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>","short":"M. Lagator, N. Colegrave, P. Neve, Proceedings of the Royal Society of London Series B Biological Sciences 281 (2014).","ista":"Lagator M, Colegrave N, Neve P. 2014. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. Proceedings of the Royal Society of London Series B Biological Sciences. 281(1794), 20141679."},"day":"17","volume":281},{"ec_funded":1,"status":"public","publication_status":"published","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/2629686","abstract":[{"lang":"eng","text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with &quot;controlled accumulation,&quot; allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable."}],"issue":"4","_id":"2038","title":"Temporal specifications with accumulative values","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"article_processing_charge":"No","volume":15,"has_accepted_license":"1","file":[{"file_id":"4851","date_created":"2018-12-12T10:10:59Z","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","relation":"main_file","file_size":346184,"creator":"system","date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","content_type":"application/pdf","checksum":"354c41d37500b56320afce94cf9a99c2"}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:26Z","ddc":["000","004"],"month":"09","pubrep_id":"192","citation":{"apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2014). Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4. ACM, 2014.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2014;15(4). doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>.","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4, 27, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>."},"day":"16","article_number":"27","article_type":"original","related_material":{"record":[{"id":"3356","relation":"earlier_version","status":"public"},{"id":"5385","relation":"earlier_version","status":"public"}]},"date_updated":"2023-02-23T12:23:54Z","publication":"ACM Transactions on Computational Logic (TOCL)","year":"2014","oa":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"ACM","intvolume":"        15","date_created":"2018-12-11T11:55:21Z","scopus_import":1,"date_published":"2014-09-16T00:00:00Z","publist_id":"5013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"KrCh"}]},{"scopus_import":1,"date_created":"2018-12-11T11:55:22Z","date_published":"2014-09-11T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5012","department":[{"_id":"KrCh"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"        10","publisher":"Public Library of Science","year":"2014","oa":1,"article_number":"7p","related_material":{"record":[{"id":"9739","status":"public","relation":"research_data"}]},"date_updated":"2023-02-23T14:06:36Z","publication":"PLoS Computational Biology","oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:26Z","ddc":["510"],"month":"09","day":"11","citation":{"ista":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9), 7p.","ama":"Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. The time scale of evolutionary innovation. <i>PLoS Computational Biology</i>. 2014;10(9). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">10.1371/journal.pcbi.1003818</a>","short":"K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology 10 (2014).","ieee":"K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” <i>PLoS Computational Biology</i>, vol. 10, no. 9. Public Library of Science, 2014.","apa":"Chatterjee, K., Pavlogiannis, A., Adlam, B., &#38; Nowak, M. (2014). The time scale of evolutionary innovation. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">https://doi.org/10.1371/journal.pcbi.1003818</a>","mla":"Chatterjee, Krishnendu, et al. “The Time Scale of Evolutionary Innovation.” <i>PLoS Computational Biology</i>, vol. 10, no. 9, 7p, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">10.1371/journal.pcbi.1003818</a>.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.” <i>PLoS Computational Biology</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pcbi.1003818\">https://doi.org/10.1371/journal.pcbi.1003818</a>."},"pubrep_id":"440","volume":10,"has_accepted_license":"1","file":[{"file_name":"IST-2016-440-v1+1_journal.pcbi.1003818.pdf","relation":"main_file","creator":"system","file_size":1399093,"date_updated":"2020-07-14T12:45:26Z","access_level":"open_access","content_type":"application/pdf","checksum":"712d4c5787ddf97809cfc962507f0738","file_id":"4890","date_created":"2018-12-12T10:11:35Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1371/journal.pcbi.1003818","issue":"9","abstract":[{"text":"A fundamental question in biology is the following: what is the time scale that is needed for evolutionary innovations? There are many results that characterize single steps in terms of the fixation time of new mutants arising in populations of certain size and structure. But here we ask a different question, which is concerned with the much longer time scale of evolutionary trajectories: how long does it take for a population exploring a fitness landscape to find target sequences that encode new biological functions? Our key variable is the length, (Formula presented.) of the genetic sequence that undergoes adaptation. In computer science there is a crucial distinction between problems that require algorithms which take polynomial or exponential time. The latter are considered to be intractable. Here we develop a theoretical approach that allows us to estimate the time of evolution as function of (Formula presented.) We show that adaptation on many fitness landscapes takes time that is exponential in (Formula presented.) even if there are broad selection gradients and many targets uniformly distributed in sequence space. These negative results lead us to search for specific mechanisms that allow evolution to work on polynomial time scales. We study a regeneration process and show that it enables evolution to work in polynomial time.","lang":"eng"}],"_id":"2039","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"},{"last_name":"Adlam","full_name":"Adlam, Ben","first_name":"Ben"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"title":"The time scale of evolutionary innovation","ec_funded":1,"publication_status":"published","status":"public","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]}]