[{"quality_controlled":"1","title":"Noise and information transmission in promoters with multiple internal states","date_published":"2014-03-04T00:00:00Z","volume":106,"publication":"Biophysical Journal","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4026790/","open_access":"1"}],"year":"2014","date_created":"2018-12-11T11:56:28Z","scopus_import":1,"external_id":{"pmid":["24606943"]},"_id":"2231","author":[{"id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Rieckh, Georg","last_name":"Rieckh"},{"last_name":"Tkacik","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","orcid":"0000-0002-6699-1455"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Rieckh G, Tkačik G. 2014. Noise and information transmission in promoters with multiple internal states. Biophysical Journal. 106(5), 1194–1204.","mla":"Rieckh, Georg, and Gašper Tkačik. “Noise and Information Transmission in Promoters with Multiple Internal States.” <i>Biophysical Journal</i>, vol. 106, no. 5, Biophysical Society, 2014, pp. 1194–204, doi:<a href=\"https://doi.org/10.1016/j.bpj.2014.01.014\">10.1016/j.bpj.2014.01.014</a>.","apa":"Rieckh, G., &#38; Tkačik, G. (2014). Noise and information transmission in promoters with multiple internal states. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2014.01.014\">https://doi.org/10.1016/j.bpj.2014.01.014</a>","ama":"Rieckh G, Tkačik G. Noise and information transmission in promoters with multiple internal states. <i>Biophysical Journal</i>. 2014;106(5):1194-1204. doi:<a href=\"https://doi.org/10.1016/j.bpj.2014.01.014\">10.1016/j.bpj.2014.01.014</a>","short":"G. Rieckh, G. Tkačik, Biophysical Journal 106 (2014) 1194–1204.","chicago":"Rieckh, Georg, and Gašper Tkačik. “Noise and Information Transmission in Promoters with Multiple Internal States.” <i>Biophysical Journal</i>. Biophysical Society, 2014. <a href=\"https://doi.org/10.1016/j.bpj.2014.01.014\">https://doi.org/10.1016/j.bpj.2014.01.014</a>.","ieee":"G. Rieckh and G. Tkačik, “Noise and information transmission in promoters with multiple internal states,” <i>Biophysical Journal</i>, vol. 106, no. 5. Biophysical Society, pp. 1194–1204, 2014."},"department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T06:56:10Z","oa_version":"Submitted Version","type":"journal_article","publisher":"Biophysical Society","language":[{"iso":"eng"}],"page":"1194 - 1204","intvolume":"       106","abstract":[{"text":"Based on the measurements of noise in gene expression performed during the past decade, it has become customary to think of gene regulation in terms of a two-state model, where the promoter of a gene can stochastically switch between an ON and an OFF state. As experiments are becoming increasingly precise and the deviations from the two-state model start to be observable, we ask about the experimental signatures of complex multistate promoters, as well as the functional consequences of this additional complexity. In detail, we i), extend the calculations for noise in gene expression to promoters described by state transition diagrams with multiple states, ii), systematically compute the experimentally accessible noise characteristics for these complex promoters, and iii), use information theory to evaluate the channel capacities of complex promoter architectures and compare them with the baseline provided by the two-state model. We find that adding internal states to the promoter generically decreases channel capacity, except in certain cases, three of which (cooperativity, dual-role regulation, promoter cycling) we analyze in detail.","lang":"eng"}],"publist_id":"4730","doi":"10.1016/j.bpj.2014.01.014","issue":"5","publication_identifier":{"issn":["00063495"]},"pmid":1,"status":"public","day":"04","publication_status":"published","month":"03"},{"publisher":"IOP Publishing","article_type":"original","article_number":"P02001","intvolume":"      2014","arxiv":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["17425468"]},"status":"public","abstract":[{"text":"The purpose of this contribution is to summarize and discuss recent advances regarding the onset of turbulence in shear flows. The absence of a clear-cut instability mechanism, the spatio-temporal intermittent character and extremely long lived transients are some of the major difficulties encountered in these flows and have hindered progress towards understanding the transition process. We will show for the case of pipe flow that concepts from nonlinear dynamics and statistical physics can help to explain the onset of turbulence. In particular, the turbulent structures (puffs) observed close to onset are spatially localized chaotic transients and their lifetimes increase super-exponentially with Reynolds number. At the same time fluctuations of individual turbulent puffs can (although very rarely) lead to the nucleation of new puffs. The competition between these two stochastic processes gives rise to a non-equilibrium phase transition where turbulence changes from a super-transient to a sustained state.","lang":"eng"}],"doi":"10.1088/1742-5468/2014/02/P02001","publist_id":"4729","issue":"2","month":"02","day":"01","publication_status":"published","quality_controlled":"1","title":"Deterministic and stochastic aspects of the transition to turbulence","date_published":"2014-02-01T00:00:00Z","date_created":"2018-12-11T11:56:28Z","publication":"Journal of Statistical Mechanics Theory and Experiment","article_processing_charge":"No","volume":2014,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.4516"}],"year":"2014","_id":"2232","external_id":{"arxiv":["1403.4516"]},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2014, no. 2, P02001, IOP Publishing, 2014, doi:<a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">10.1088/1742-5468/2014/02/P02001</a>.","apa":"Song, B., &#38; Hof, B. (2014). Deterministic and stochastic aspects of the transition to turbulence. <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">https://doi.org/10.1088/1742-5468/2014/02/P02001</a>","ista":"Song B, Hof B. 2014. Deterministic and stochastic aspects of the transition to turbulence. Journal of Statistical Mechanics Theory and Experiment. 2014(2), P02001.","ieee":"B. Song and B. Hof, “Deterministic and stochastic aspects of the transition to turbulence,” <i>Journal of Statistical Mechanics Theory and Experiment</i>, vol. 2014, no. 2. IOP Publishing, 2014.","chicago":"Song, Baofang, and Björn Hof. “Deterministic and Stochastic Aspects of the Transition to Turbulence.” <i>Journal of Statistical Mechanics Theory and Experiment</i>. IOP Publishing, 2014. <a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">https://doi.org/10.1088/1742-5468/2014/02/P02001</a>.","short":"B. Song, B. Hof, Journal of Statistical Mechanics Theory and Experiment 2014 (2014).","ama":"Song B, Hof B. Deterministic and stochastic aspects of the transition to turbulence. <i>Journal of Statistical Mechanics Theory and Experiment</i>. 2014;2014(2). doi:<a href=\"https://doi.org/10.1088/1742-5468/2014/02/P02001\">10.1088/1742-5468/2014/02/P02001</a>"},"oa":1,"author":[{"first_name":"Baofang","full_name":"Song, Baofang","id":"a79e57f5-e8a5-11ec-9dc9-83fb8c81cf72","last_name":"Song"},{"last_name":"Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","first_name":"Björn"}],"date_updated":"2022-06-10T10:13:15Z","oa_version":"Submitted Version","department":[{"_id":"BjHo"}]},{"pubrep_id":"389","type":"journal_article","department":[{"_id":"ToHe"}],"file":[{"checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","relation":"main_file","creator":"system","access_level":"open_access","file_id":"4643","date_created":"2018-12-12T10:07:45Z","file_name":"IST-2015-389-v1+1_1401.3957.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_size":550936}],"oa_version":"Published Version","date_updated":"2021-01-12T06:56:11Z","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>.","apa":"Boker, U., &#38; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>.","ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>","short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014."},"has_accepted_license":"1","_id":"2233","scopus_import":1,"file_date_updated":"2020-07-14T12:45:34Z","date_created":"2018-12-11T11:56:28Z","ddc":["000"],"year":"2014","volume":10,"publication":"Logical Methods in Computer Science","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Exact and approximate determinization of discounted-sum automata","date_published":"2014-02-13T00:00:00Z","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","month":"02","publication_status":"published","ec_funded":1,"day":"13","status":"public","publication_identifier":{"issn":["18605974"]},"issue":"1","license":"https://creativecommons.org/licenses/by/4.0/","publist_id":"4728","doi":"10.2168/LMCS-10(1:10)2014","abstract":[{"text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. ","lang":"eng"}],"intvolume":"        10","language":[{"iso":"eng"}],"publisher":"International Federation of Computational Logic"},{"intvolume":"        10","language":[{"iso":"eng"}],"publisher":"International Federation of Computational Logic","month":"02","ec_funded":1,"day":"14","publication_status":"published","publication_identifier":{"issn":["18605974"]},"status":"public","publist_id":"4727","abstract":[{"lang":"eng","text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε &gt; 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε &gt; 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results."}],"doi":"10.2168/LMCS-10(1:13)2014","issue":"1","date_created":"2018-12-11T11:56:29Z","ddc":["000"],"volume":10,"publication":"Logical Methods in Computer Science","main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/428","open_access":"1"}],"year":"2014","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","title":"Markov decision processes with multiple long-run average objectives","date_published":"2014-02-14T00:00:00Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","pubrep_id":"428","oa":1,"author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"full_name":"Brožek, Václav","first_name":"Václav","last_name":"Brožek"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Forejt","full_name":"Forejt, Vojtěch","first_name":"Vojtěch"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>.","ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014.","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>"},"has_accepted_license":"1","department":[{"_id":"KrCh"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_size":375388,"file_name":"IST-2016-428-v1+1_1104.3489.pdf","file_id":"4656","date_created":"2018-12-12T10:07:57Z","access_level":"open_access","creator":"system","checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","relation":"main_file"}],"date_updated":"2021-01-12T06:56:11Z","oa_version":"Published Version","_id":"2234","scopus_import":1,"file_date_updated":"2020-07-14T12:45:34Z"},{"publisher":"Nature Publishing Group","intvolume":"       506","page":"364 - 366","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["00280836"]},"issue":"7488","doi":"10.1038/nature12977","publist_id":"4726","abstract":[{"text":"Emerging infectious diseases (EIDs) pose a risk to human welfare, both directly and indirectly, by affecting managed livestock and wildlife that provide valuable resources and ecosystem services, such as the pollination of crops. Honeybees (Apis mellifera), the prevailing managed insect crop pollinator, suffer from a range of emerging and exotic high-impact pathogens, and population maintenance requires active management by beekeepers to control them. Wild pollinators such as bumblebees (Bombus spp.) are in global decline, one cause of which may be pathogen spillover from managed pollinators like honeybees or commercial colonies of bumblebees. Here we use a combination of infection experiments and landscape-scale field data to show that honeybee EIDs are indeed widespread infectious agents within the pollinator assemblage. The prevalence of deformed wing virus (DWV) and the exotic parasite Nosema ceranae in honeybees and bumblebees is linked; as honeybees have higher DWV prevalence, and sympatric bumblebees and honeybees are infected by the same DWV strains, Apis is the likely source of at least one major EID in wild pollinators. Lessons learned from vertebrates highlight the need for increased pathogen control in managed bee species to maintain wild pollinators, as declines in native pollinators may be caused by interspecies pathogen transmission originating from managed pollinators.","lang":"eng"}],"month":"02","publication_status":"published","day":"20","title":"Disease associations between honeybees and bumblebees as a threat to wild pollinators","date_published":"2014-02-20T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T11:56:29Z","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3985068/","open_access":"1"}],"year":"2014","volume":506,"publication":"Nature","_id":"2235","scopus_import":1,"type":"journal_article","department":[{"_id":"SyCr"}],"date_updated":"2021-01-12T06:56:11Z","oa_version":"Submitted Version","author":[{"orcid":"0000-0002-3712-925X","first_name":"Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87","full_name":"Fürst, Matthias","last_name":"Fürst"},{"last_name":"Mcmahon","full_name":"Mcmahon, Dino","first_name":"Dino"},{"first_name":"Juliet","full_name":"Osborne, Juliet","last_name":"Osborne"},{"first_name":"Robert","full_name":"Paxton, Robert","last_name":"Paxton"},{"first_name":"Mark","full_name":"Brown, Mark","last_name":"Brown"}],"oa":1,"citation":{"ista":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. 2014. Disease associations between honeybees and bumblebees as a threat to wild pollinators. Nature. 506(7488), 364–366.","mla":"Fürst, Matthias, et al. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” <i>Nature</i>, vol. 506, no. 7488, Nature Publishing Group, 2014, pp. 364–66, doi:<a href=\"https://doi.org/10.1038/nature12977\">10.1038/nature12977</a>.","apa":"Fürst, M., Mcmahon, D., Osborne, J., Paxton, R., &#38; Brown, M. (2014). Disease associations between honeybees and bumblebees as a threat to wild pollinators. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature12977\">https://doi.org/10.1038/nature12977</a>","ieee":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, and M. Brown, “Disease associations between honeybees and bumblebees as a threat to wild pollinators,” <i>Nature</i>, vol. 506, no. 7488. Nature Publishing Group, pp. 364–366, 2014.","ama":"Fürst M, Mcmahon D, Osborne J, Paxton R, Brown M. Disease associations between honeybees and bumblebees as a threat to wild pollinators. <i>Nature</i>. 2014;506(7488):364-366. doi:<a href=\"https://doi.org/10.1038/nature12977\">10.1038/nature12977</a>","short":"M. Fürst, D. Mcmahon, J. Osborne, R. Paxton, M. Brown, Nature 506 (2014) 364–366.","chicago":"Fürst, Matthias, Dino Mcmahon, Juliet Osborne, Robert Paxton, and Mark Brown. “Disease Associations between Honeybees and Bumblebees as a Threat to Wild Pollinators.” <i>Nature</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nature12977\">https://doi.org/10.1038/nature12977</a>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Springer","page":"566 - 590","intvolume":"      8349","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-364254241-1"]},"status":"public","doi":"10.1007/978-3-642-54242-8_24","abstract":[{"lang":"eng","text":"Consider a joint distribution (X,A) on a set. We show that for any family of distinguishers, there exists a simulator such that 1 no function in can distinguish (X,A) from (X,h(X)) with advantage ε, 2 h is only O(2 3ℓ ε -2) times less efficient than the functions in. For the most interesting settings of the parameters (in particular, the cryptographic case where X has superlogarithmic min-entropy, ε &gt; 0 is negligible and consists of circuits of polynomial size), we can make the simulator h deterministic. As an illustrative application of our theorem, we give a new security proof for the leakage-resilient stream-cipher from Eurocrypt'09. Our proof is simpler and quantitatively much better than the original proof using the dense model theorem, giving meaningful security guarantees if instantiated with a standard blockcipher like AES. Subsequent to this work, Chung, Lui and Pass gave an interactive variant of our main theorem, and used it to investigate weak notions of Zero-Knowledge. Vadhan and Zheng give a more constructive version of our theorem using their new uniform min-max theorem."}],"publist_id":"4725","month":"02","alternative_title":["LNCS"],"ec_funded":1,"day":"01","publication_status":"published","conference":{"location":"San Diego, USA","start_date":"2014-02-24","end_date":"2014-02-26","name":"TCC: Theory of Cryptography Conference"},"quality_controlled":"1","date_published":"2014-02-01T00:00:00Z","title":"How to fake auxiliary input","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"date_created":"2018-12-11T11:56:29Z","ddc":["004"],"volume":8349,"year":"2014","main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/681"}],"editor":[{"first_name":"Yehuda","full_name":"Lindell, Yehuda","last_name":"Lindell"}],"_id":"2236","file_date_updated":"2020-07-14T12:45:34Z","type":"conference","pubrep_id":"681","oa":1,"author":[{"last_name":"Jetchev","full_name":"Jetchev, Dimitar","first_name":"Dimitar"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"citation":{"ista":"Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349, 566–590.","mla":"Jetchev, Dimitar, and Krzysztof Z. Pietrzak. <i>How to Fake Auxiliary Input</i>. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">10.1007/978-3-642-54242-8_24</a>.","apa":"Jetchev, D., &#38; Pietrzak, K. Z. (2014). How to fake auxiliary input. In Y. Lindell (Ed.) (Vol. 8349, pp. 566–590). Presented at the TCC: Theory of Cryptography Conference, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">https://doi.org/10.1007/978-3-642-54242-8_24</a>","ieee":"D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.","ama":"Jetchev D, Pietrzak KZ. How to fake auxiliary input. In: Lindell Y, ed. Vol 8349. Springer; 2014:566-590. doi:<a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">10.1007/978-3-642-54242-8_24</a>","short":"D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.","chicago":"Jetchev, Dimitar, and Krzysztof Z Pietrzak. “How to Fake Auxiliary Input.” edited by Yehuda Lindell, 8349:566–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54242-8_24\">https://doi.org/10.1007/978-3-642-54242-8_24</a>."},"has_accepted_license":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2016-681-v1+1_869_1_.pdf","file_size":313528,"date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:17:21Z","file_id":"5275","relation":"main_file","checksum":"42960325c29dcd8d832edadcc3ce0045","creator":"system"}],"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T06:56:12Z","oa_version":"Submitted Version"},{"publication":"Theoretical Computer Science","volume":521,"language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1303.3777","open_access":"1"}],"year":"2014","page":"73 - 91","date_created":"2018-12-11T11:56:33Z","intvolume":"       521","quality_controlled":"1","date_published":"2014-02-13T00:00:00Z","title":"Alternating traps in Muller and parity games","publisher":"Elsevier","citation":{"ieee":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” <i>Theoretical Computer Science</i>, vol. 521. Elsevier, pp. 73–91, 2014.","ama":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. Alternating traps in Muller and parity games. <i>Theoretical Computer Science</i>. 2014;521:73-91. doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">10.1016/j.tcs.2013.11.032</a>","short":"A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.","chicago":"Grinshpun, Andrey, Pakawat Phalitnonkiat, Sasha Rubin, and Andrei Tarfulea. “Alternating Traps in Muller and Parity Games.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">https://doi.org/10.1016/j.tcs.2013.11.032</a>.","ista":"Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.","apa":"Grinshpun, A., Phalitnonkiat, P., Rubin, S., &#38; Tarfulea, A. (2014). Alternating traps in Muller and parity games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">https://doi.org/10.1016/j.tcs.2013.11.032</a>","mla":"Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.” <i>Theoretical Computer Science</i>, vol. 521, Elsevier, 2014, pp. 73–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.11.032\">10.1016/j.tcs.2013.11.032</a>."},"day":"13","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"first_name":"Andrey","full_name":"Grinshpun, Andrey","last_name":"Grinshpun"},{"last_name":"Phalitnonkiat","first_name":"Pakawat","full_name":"Phalitnonkiat, Pakawat"},{"last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","full_name":"Rubin, Sasha"},{"first_name":"Andrei","full_name":"Tarfulea, Andrei","last_name":"Tarfulea"}],"publication_status":"published","oa_version":"Submitted Version","date_updated":"2021-01-12T06:56:16Z","department":[{"_id":"KrCh"}],"type":"journal_article","month":"02","abstract":[{"lang":"eng","text":"Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are parity games; these are of particular significance in computational complexity, as they remain one of the few combinatorial problems known to be in NP ∩ co-NP but not known to be in P. We show that winning regions for a Muller game can be determined from the alternating structure of its traps. To every Muller game we then associate a natural number that we call its trap depth; this parameter measures how complicated the trap structure is. We present algorithms for parity games that run in polynomial time for graphs of bounded trap depth, and in general run in time exponential in the trap depth. "}],"publist_id":"4703","doi":"10.1016/j.tcs.2013.11.032","scopus_import":1,"publication_identifier":{"issn":["03043975"]},"status":"public","_id":"2246"},{"language":[{"iso":"eng"}],"intvolume":"        77","page":"97 - 107","publisher":"Wiley-Blackwell","publication_status":"published","day":"01","month":"01","issue":"1","doi":"10.1111/tpj.12373","abstract":[{"lang":"eng","text":"The unfolded protein response (UPR) is a signaling network triggered by overload of protein-folding demand in the endoplasmic reticulum (ER), a condition termed ER stress. The UPR is critical for growth and development; nonetheless, connections between the UPR and other cellular regulatory processes remain largely unknown. Here, we identify a link between the UPR and the phytohormone auxin, a master regulator of plant physiology. We show that ER stress triggers down-regulation of auxin receptors and transporters in Arabidopsis thaliana. We also demonstrate that an Arabidopsis mutant of a conserved ER stress sensor IRE1 exhibits defects in the auxin response and levels. These data not only support that the plant IRE1 is required for auxin homeostasis, they also reveal a species-specific feature of IRE1 in multicellular eukaryotes. Furthermore, by establishing that UPR activation is reduced in mutants of ER-localized auxin transporters, including PIN5, we define a long-neglected biological significance of ER-based auxin regulation. We further examine the functional relationship of IRE1 and PIN5 by showing that an ire1 pin5 triple mutant enhances defects of UPR activation and auxin homeostasis in ire1 or pin5. Our results imply that the plant UPR has evolved a hormone-dependent strategy for coordinating ER function with physiological processes."}],"publist_id":"4699","status":"public","publication_identifier":{"issn":["09607412"]},"year":"2014","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3981873/"}],"publication":"Plant Journal","volume":77,"date_created":"2018-12-11T11:56:34Z","title":"Inter-regulation of the unfolded protein response and auxin signaling","date_published":"2014-01-01T00:00:00Z","quality_controlled":"1","date_updated":"2021-01-12T06:56:17Z","oa_version":"Submitted Version","department":[{"_id":"JiFr"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chen Y, Aung K, Rolčík J, Walicki K, Friml J, Brandizzí F. Inter-regulation of the unfolded protein response and auxin signaling. <i>Plant Journal</i>. 2014;77(1):97-107. doi:<a href=\"https://doi.org/10.1111/tpj.12373\">10.1111/tpj.12373</a>","short":"Y. Chen, K. Aung, J. Rolčík, K. Walicki, J. Friml, F. Brandizzí, Plant Journal 77 (2014) 97–107.","chicago":"Chen, Yani, Kyaw Aung, Jakub Rolčík, Kathryn Walicki, Jiří Friml, and Federica Brandizzí. “Inter-Regulation of the Unfolded Protein Response and Auxin Signaling.” <i>Plant Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1111/tpj.12373\">https://doi.org/10.1111/tpj.12373</a>.","ieee":"Y. Chen, K. Aung, J. Rolčík, K. Walicki, J. Friml, and F. Brandizzí, “Inter-regulation of the unfolded protein response and auxin signaling,” <i>Plant Journal</i>, vol. 77, no. 1. Wiley-Blackwell, pp. 97–107, 2014.","ista":"Chen Y, Aung K, Rolčík J, Walicki K, Friml J, Brandizzí F. 2014. Inter-regulation of the unfolded protein response and auxin signaling. Plant Journal. 77(1), 97–107.","apa":"Chen, Y., Aung, K., Rolčík, J., Walicki, K., Friml, J., &#38; Brandizzí, F. (2014). Inter-regulation of the unfolded protein response and auxin signaling. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/tpj.12373\">https://doi.org/10.1111/tpj.12373</a>","mla":"Chen, Yani, et al. “Inter-Regulation of the Unfolded Protein Response and Auxin Signaling.” <i>Plant Journal</i>, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 97–107, doi:<a href=\"https://doi.org/10.1111/tpj.12373\">10.1111/tpj.12373</a>."},"author":[{"last_name":"Chen","full_name":"Chen, Yani","first_name":"Yani"},{"full_name":"Aung, Kyaw","first_name":"Kyaw","last_name":"Aung"},{"full_name":"Rolčík, Jakub","first_name":"Jakub","last_name":"Rolčík"},{"last_name":"Walicki","full_name":"Walicki, Kathryn","first_name":"Kathryn"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"Brandizzí, Federica","first_name":"Federica","last_name":"Brandizzí"}],"oa":1,"type":"journal_article","scopus_import":1,"_id":"2249"},{"day":"01","publication_status":"published","month":"01","publist_id":"4698","abstract":[{"text":"The genome sequences of new viruses often contain many &quot;orphan&quot; or &quot;taxon-specific&quot; proteins apparently lacking homologs. However, because viral proteins evolve very fast, commonly used sequence similarity detection methods such as BLAST may overlook homologs. We analyzed a data set of proteins from RNA viruses characterized as &quot;genus specific&quot; by BLAST. More powerful methods developed recently, such as HHblits or HHpred (available through web-based, user-friendly interfaces), could detect distant homologs of a quarter of these proteins, suggesting that these methods should be used to annotate viral genomes. In-depth manual analyses of a subset of the remaining sequences, guided by contextual information such as taxonomy, gene order, or domain cooccurrence, identified distant homologs of another third. Thus, a combination of powerful automated methods and manual analyses can uncover distant homologs of many proteins thought to be orphans. We expect these methodological results to be also applicable to cellular organisms, since they generally evolve much more slowly than RNA viruses. As an application, we reanalyzed the genome of a bee pathogen, Chronic bee paralysis virus (CBPV). We could identify homologs of most of its proteins thought to be orphans; in each case, identifying homologs provided functional clues. We discovered that CBPV encodes a domain homologous to the Alphavirus methyltransferase-guanylyltransferase; a putative membrane protein, SP24, with homologs in unrelated insect viruses and insect-transmitted plant viruses having different morphologies (cileviruses, higreviruses, blunerviruses, negeviruses); and a putative virion glycoprotein, ORF2, also found in negeviruses. SP24 and ORF2 are probably major structural components of the virionsd.","lang":"eng"}],"doi":"10.1128/JVI.02595-13","issue":"1","publication_identifier":{"issn":["0022538X"]},"status":"public","language":[{"iso":"eng"}],"page":"10 - 20","intvolume":"        88","publisher":"ASM","oa":1,"author":[{"last_name":"Kuchibhatla","first_name":"Durga","full_name":"Kuchibhatla, Durga"},{"first_name":"Westley","full_name":"Sherman, Westley","last_name":"Sherman"},{"last_name":"Chung","full_name":"Chung, Betty","first_name":"Betty"},{"first_name":"Shelley","full_name":"Cook, Shelley","last_name":"Cook"},{"id":"329095A0-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Schneider, Georg","last_name":"Schneider"},{"first_name":"Birgit","full_name":"Eisenhaber, Birgit","last_name":"Eisenhaber"},{"first_name":"David","full_name":"Karlin, David","last_name":"Karlin"}],"has_accepted_license":"1","citation":{"apa":"Kuchibhatla, D., Sherman, W., Chung, B., Cook, S., Schneider, G., Eisenhaber, B., &#38; Karlin, D. (2014). Powerful sequence similarity search methods and in-depth manual analyses can identify remote homologs in many apparently “orphan” viral proteins. <i>Journal of Virology</i>. ASM. <a href=\"https://doi.org/10.1128/JVI.02595-13\">https://doi.org/10.1128/JVI.02595-13</a>","mla":"Kuchibhatla, Durga, et al. “Powerful Sequence Similarity Search Methods and In-Depth Manual Analyses Can Identify Remote Homologs in Many Apparently ‘Orphan’ Viral Proteins.” <i>Journal of Virology</i>, vol. 88, no. 1, ASM, 2014, pp. 10–20, doi:<a href=\"https://doi.org/10.1128/JVI.02595-13\">10.1128/JVI.02595-13</a>.","ista":"Kuchibhatla D, Sherman W, Chung B, Cook S, Schneider G, Eisenhaber B, Karlin D. 2014. Powerful sequence similarity search methods and in-depth manual analyses can identify remote homologs in many apparently ‘orphan’ viral proteins. Journal of Virology. 88(1), 10–20.","chicago":"Kuchibhatla, Durga, Westley Sherman, Betty Chung, Shelley Cook, Georg Schneider, Birgit Eisenhaber, and David Karlin. “Powerful Sequence Similarity Search Methods and In-Depth Manual Analyses Can Identify Remote Homologs in Many Apparently ‘Orphan’ Viral Proteins.” <i>Journal of Virology</i>. ASM, 2014. <a href=\"https://doi.org/10.1128/JVI.02595-13\">https://doi.org/10.1128/JVI.02595-13</a>.","short":"D. Kuchibhatla, W. Sherman, B. Chung, S. Cook, G. Schneider, B. Eisenhaber, D. Karlin, Journal of Virology 88 (2014) 10–20.","ama":"Kuchibhatla D, Sherman W, Chung B, et al. Powerful sequence similarity search methods and in-depth manual analyses can identify remote homologs in many apparently “orphan” viral proteins. <i>Journal of Virology</i>. 2014;88(1):10-20. doi:<a href=\"https://doi.org/10.1128/JVI.02595-13\">10.1128/JVI.02595-13</a>","ieee":"D. Kuchibhatla <i>et al.</i>, “Powerful sequence similarity search methods and in-depth manual analyses can identify remote homologs in many apparently ‘orphan’ viral proteins,” <i>Journal of Virology</i>, vol. 88, no. 1. ASM, pp. 10–20, 2014."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MD"}],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:13:43Z","file_id":"5029","file_name":"IST-2016-417-v1+1_J._Virol.-2014-Kuchibhatla-10-20.pdf","file_size":825756,"date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf","relation":"main_file","checksum":"2c121b5e884992dfec5605bdf4e659da","creator":"system"}],"oa_version":"Published Version","date_updated":"2021-01-12T06:56:17Z","type":"journal_article","pubrep_id":"417","scopus_import":1,"file_date_updated":"2020-07-14T12:45:34Z","_id":"2250","volume":88,"publication":"Journal of Virology","year":"2014","date_created":"2018-12-11T11:56:34Z","ddc":["570"],"quality_controlled":"1","date_published":"2014-01-01T00:00:00Z","title":"Powerful sequence similarity search methods and in-depth manual analyses can identify remote homologs in many apparently \"orphan\" viral proteins","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"publisher":"Royal Society, The","language":[{"iso":"eng"}],"article_number":"20120528","intvolume":"       369","issue":"1635","abstract":[{"lang":"eng","text":"Sharp wave/ripple (SWR, 150–250 Hz) hippocampal events have long been postulated to be involved in memory consolidation. However, more recent work has investigated SWRs that occur during active waking behaviour: findings that suggest that SWRs may also play a role in cell assembly strengthening or spatial working memory. Do such theories of SWR function apply to animal learning? This review discusses how general theories linking SWRs to memory-related function may explain circuit mechanisms related to rodent spatial learning and to the associated stabilization of new cognitive maps."}],"doi":"10.1098/rstb.2012.0528","publist_id":"4697","status":"public","pmid":1,"publication_identifier":{"issn":["09628436"]},"acknowledgement":"CC BY 3.0","publication_status":"published","day":"05","month":"02","date_published":"2014-02-05T00:00:00Z","title":"Sharp wave/ripple network oscillations and learning-associated hippocampal maps","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2014","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","volume":369,"article_processing_charge":"No","ddc":["570"],"date_created":"2018-12-11T11:56:34Z","external_id":{"pmid":["24366138"]},"file_date_updated":"2020-07-14T12:45:34Z","scopus_import":1,"_id":"2251","date_updated":"2021-01-12T06:56:18Z","oa_version":"Published Version","file":[{"creator":"system","relation":"main_file","checksum":"51beb33de71c9c19e0c205a20d206f9a","file_size":771896,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_name":"IST-2016-527-v1+1_20120528.full.pdf","date_created":"2018-12-12T10:13:24Z","file_id":"5006","access_level":"open_access"}],"department":[{"_id":"JoCs"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"chicago":"Csicsvari, Jozsef L, and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The, 2014. <a href=\"https://doi.org/10.1098/rstb.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>.","ama":"Csicsvari JL, Dupret D. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2014;369(1635). doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>","short":"J.L. Csicsvari, D. Dupret, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 369 (2014).","ieee":"J. L. Csicsvari and D. Dupret, “Sharp wave/ripple network oscillations and learning-associated hippocampal maps,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635. Royal Society, The, 2014.","mla":"Csicsvari, Jozsef L., and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635, 20120528, Royal Society, The, 2014, doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>.","apa":"Csicsvari, J. L., &#38; Dupret, D. (2014). Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rstb.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>","ista":"Csicsvari JL, Dupret D. 2014. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 369(1635), 20120528."},"oa":1,"author":[{"last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"},{"last_name":"Dupret","first_name":"David","full_name":"Dupret, David"}],"pubrep_id":"527","type":"journal_article"},{"month":"01","day":"01","publication_status":"published","publication_identifier":{"issn":["09607412"]},"status":"public","doi":"10.1111/tpj.12369","publist_id":"4694","abstract":[{"lang":"eng","text":"Plant growth is achieved predominantly by cellular elongation, which is thought to be controlled on several levels by apoplastic auxin. Auxin export into the apoplast is achieved by plasma membrane efflux catalysts of the PIN-FORMED (PIN) and ATP-binding cassette protein subfamily B/phosphor- glycoprotein (ABCB/PGP) classes; the latter were shown to depend on interaction with the FKBP42, TWISTED DWARF1 (TWD1). Here by using a transgenic approach in combination with phenotypical, biochemical and cell biological analyses we demonstrate the importance of a putative C-terminal in-plane membrane anchor of TWD1 in the regulation of ABCB-mediated auxin transport. In contrast with dwarfed twd1 loss-of-function alleles, TWD1 gain-of-function lines that lack a putative in-plane membrane anchor (HA-TWD1-Ct) show hypermorphic plant architecture, characterized by enhanced stem length and leaf surface but reduced shoot branching. Greater hypocotyl length is the result of enhanced cell elongation that correlates with reduced polar auxin transport capacity for HA-TWD1-Ct. As a consequence, HA-TWD1-Ct displays higher hypocotyl auxin accumulation, which is shown to result in elevated auxin-induced cell elongation rates. Our data highlight the importance of C-terminal membrane anchoring for TWD1 action, which is required for specific regulation of ABCB-mediated auxin transport. These data support a model in which TWD1 controls lateral ABCB1-mediated export into the apoplast, which is required for auxin-mediated cell elongation."}],"issue":"1","page":"108 - 118","article_type":"original","intvolume":"        77","language":[{"iso":"eng"}],"publisher":"Wiley-Blackwell","type":"journal_article","citation":{"ieee":"A. Bailly <i>et al.</i>, “Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth,” <i>Plant Journal</i>, vol. 77, no. 1. Wiley-Blackwell, pp. 108–118, 2014.","chicago":"Bailly, Aurélien, Bangjun Wang, Marta Zwiewka, Stephan Pollmann, Daniel Schenck, Hartwig Lüthen, Alexander Schulz, Jiří Friml, and Markus Geisler. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” <i>Plant Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1111/tpj.12369\">https://doi.org/10.1111/tpj.12369</a>.","ama":"Bailly A, Wang B, Zwiewka M, et al. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. <i>Plant Journal</i>. 2014;77(1):108-118. doi:<a href=\"https://doi.org/10.1111/tpj.12369\">10.1111/tpj.12369</a>","short":"A. Bailly, B. Wang, M. Zwiewka, S. Pollmann, D. Schenck, H. Lüthen, A. Schulz, J. Friml, M. Geisler, Plant Journal 77 (2014) 108–118.","apa":"Bailly, A., Wang, B., Zwiewka, M., Pollmann, S., Schenck, D., Lüthen, H., … Geisler, M. (2014). Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/tpj.12369\">https://doi.org/10.1111/tpj.12369</a>","mla":"Bailly, Aurélien, et al. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” <i>Plant Journal</i>, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 108–18, doi:<a href=\"https://doi.org/10.1111/tpj.12369\">10.1111/tpj.12369</a>.","ista":"Bailly A, Wang B, Zwiewka M, Pollmann S, Schenck D, Lüthen H, Schulz A, Friml J, Geisler M. 2014. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. Plant Journal. 77(1), 108–118."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"first_name":"Aurélien","full_name":"Bailly, Aurélien","last_name":"Bailly"},{"full_name":"Wang, Bangjun","first_name":"Bangjun","last_name":"Wang"},{"last_name":"Zwiewka","full_name":"Zwiewka, Marta","first_name":"Marta"},{"last_name":"Pollmann","full_name":"Pollmann, Stephan","first_name":"Stephan"},{"full_name":"Schenck, Daniel","first_name":"Daniel","last_name":"Schenck"},{"first_name":"Hartwig","full_name":"Lüthen, Hartwig","last_name":"Lüthen"},{"full_name":"Schulz, Alexander","first_name":"Alexander","last_name":"Schulz"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Geisler","first_name":"Markus","full_name":"Geisler, Markus"}],"oa_version":"Published Version","date_updated":"2021-01-12T06:56:18Z","department":[{"_id":"JiFr"}],"_id":"2253","scopus_import":1,"date_created":"2018-12-11T11:56:35Z","publication":"Plant Journal","volume":77,"article_processing_charge":"No","year":"2014","main_file_link":[{"url":"https://doi.org/10.1111/tpj.12369","open_access":"1"}],"quality_controlled":"1","project":[{"name":"Innovationsförderung in der Grenzregion Österreich – Tschechische Republik durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur","_id":"256BDAB0-B435-11E9-9278-68D0E5697425"}],"title":"Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth","date_published":"2014-01-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"Theta-gamma network oscillations are thought to represent key reference signals for information processing in neuronal ensembles, but the underlying synaptic mechanisms remain unclear. To address this question, we performed whole-cell (WC) patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials at low frequency, consistent with sparse coding in the dentate gyrus. GCs were exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs), primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents (IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence with the field potential predominantly in the theta frequency band, whereas IPSCs showed coherence primarily in the gamma range. Action potentials in GCs were phase locked to network oscillations. Thus, theta-gamma-modulated synaptic currents may provide a framework for sparse temporal coding of information in the dentate gyrus."}],"doi":"10.1016/j.neuron.2013.09.046","publist_id":"4692","issue":"1","publication_identifier":{"issn":["08966273"]},"status":"public","day":"08","ec_funded":1,"publication_status":"published","month":"01","publisher":"Elsevier","language":[{"iso":"eng"}],"page":"140 - 152","intvolume":"        81","file_date_updated":"2020-07-14T12:45:35Z","scopus_import":1,"_id":"2254","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations,” <i>Neuron</i>, vol. 81, no. 1. Elsevier, pp. 140–152, 2014.","chicago":"Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>.","ama":"Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. 2014;81(1):140-152. doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>","short":"A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.","apa":"Pernia-Andrade, A., &#38; Jonas, P. M. (2014). Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>","mla":"Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>.","ista":"Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. 81(1), 140–152."},"has_accepted_license":"1","author":[{"last_name":"Pernia-Andrade","id":"36963E98-F248-11E8-B48F-1D18A9856A87","full_name":"Pernia-Andrade, Alejandro","first_name":"Alejandro"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"}],"oa":1,"oa_version":"Published Version","date_updated":"2021-01-12T06:56:19Z","file":[{"relation":"main_file","checksum":"438547cfcd9045a22f065f2019f07849","creator":"system","file_name":"IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf","file_size":4373072,"date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:09:48Z","file_id":"4773"}],"department":[{"_id":"PeJo"}],"type":"journal_article","pubrep_id":"422","quality_controlled":"1","project":[{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548"},{"grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"}],"date_published":"2014-01-08T00:00:00Z","title":"Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations","publication":"Neuron","volume":81,"year":"2014","ddc":["570"],"date_created":"2018-12-11T11:56:35Z"},{"page":"164 - 177","intvolume":"        50","language":[{"iso":"eng"}],"publisher":"Springer","month":"09","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2843"},{"status":"public","id":"1399","relation":"dissertation_contains"}]},"day":"01","ec_funded":1,"publication_status":"published","publication_identifier":{"issn":["09249907"]},"status":"public","doi":"10.1007/s10851-013-0468-x","publist_id":"4691","abstract":[{"text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm.","lang":"eng"}],"issue":"1","ddc":["000"],"date_created":"2018-12-11T11:56:36Z","publication":"Journal of Mathematical Imaging and Vision","volume":50,"year":"2014","quality_controlled":"1","project":[{"grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"date_published":"2014-09-01T00:00:00Z","title":"Stable length estimates of tube-like shapes","type":"journal_article","pubrep_id":"549","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"apa":"Edelsbrunner, H., &#38; Pausinger, F. (2014). Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>.","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1. Springer, pp. 164–177, 2014.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>.","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. 2014;50(1):164-177. doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177."},"oa":1,"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Pausinger","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768"}],"oa_version":"Submitted Version","date_updated":"2023-09-07T11:41:25Z","file":[{"relation":"main_file","checksum":"2f93f3e63a38a85cd4404d7953913b14","creator":"system","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","file_size":3941391,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","date_created":"2018-12-12T10:16:18Z","file_id":"5204"}],"department":[{"_id":"HeEd"}],"_id":"2255","file_date_updated":"2020-07-14T12:45:35Z","scopus_import":1},{"publisher":"Public Library of Science","intvolume":"        10","article_number":"e1003408","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["1553734X"]},"issue":"1","publist_id":"4689","doi":"10.1371/journal.pcbi.1003408","abstract":[{"text":"Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population's capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction.","lang":"eng"}],"related_material":{"record":[{"id":"5562","relation":"popular_science","status":"public"}]},"month":"01","publication_status":"published","acknowledgement":"\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508, the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation, ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES: ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651.","day":"02","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2014-01-02T00:00:00Z","title":"Searching for collective behavior in a large network of sensory neurons","quality_controlled":"1","date_created":"2018-12-11T11:56:36Z","ddc":["570"],"main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/436","open_access":"1"}],"year":"2014","volume":10,"publication":"PLoS Computational Biology","_id":"2257","scopus_import":1,"file_date_updated":"2020-07-14T12:45:35Z","pubrep_id":"436","type":"journal_article","file":[{"relation":"main_file","checksum":"c720222c5e924a4acb17f23b9381a6ca","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:12:46Z","file_id":"4965","file_name":"IST-2016-436-v1+1_journal.pcbi.1003408.pdf","file_size":2194790,"date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf"}],"department":[{"_id":"GaTk"}],"date_updated":"2024-02-21T13:46:14Z","oa_version":"Published Version","oa":1,"author":[{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper","last_name":"Tkacik"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"first_name":"Dario","full_name":"Amodei, Dario","last_name":"Amodei"},{"last_name":"Schneidman","full_name":"Schneidman, Elad","first_name":"Elad"},{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"},{"full_name":"Berry, Michael","first_name":"Michael","last_name":"Berry"}],"has_accepted_license":"1","citation":{"apa":"Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., &#38; Berry, M. (2014). Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>","mla":"Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>, vol. 10, no. 1, e1003408, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>.","ista":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 10(1), e1003408.","chicago":"Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>.","short":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014).","ama":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>","ieee":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching for collective behavior in a large network of sensory neurons,” <i>PLoS Computational Biology</i>, vol. 10, no. 1. Public Library of Science, 2014."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"month":"03","publication_status":"published","acknowledgement":"California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]. Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]\r\nCC BY 3,0","day":"05","status":"public","issue":"5","abstract":[{"lang":"eng","text":"To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus."}],"publist_id":"4684","doi":"10.1093/nar/gkt1290","intvolume":"        42","article_number":"e34","language":[{"iso":"eng"}],"publisher":"Oxford University Press","pubrep_id":"961","type":"journal_article","department":[{"_id":"SiHi"}],"file":[{"relation":"main_file","checksum":"e9268f5f96a820f04d7ebbf85927c3cb","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:09:15Z","file_id":"4738","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","file_size":11044478,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z"}],"date_updated":"2021-01-12T06:56:22Z","oa_version":"Preprint","oa":1,"author":[{"first_name":"Fangfang","full_name":"Zhu, Fangfang","last_name":"Zhu"},{"full_name":"Gamboa, Matthew","first_name":"Matthew","last_name":"Gamboa"},{"first_name":"Alfonso","full_name":"Farruggio, Alfonso","last_name":"Farruggio"},{"last_name":"Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"},{"first_name":"Bosiljka","full_name":"Tasic, Bosiljka","last_name":"Tasic"},{"full_name":"Schüle, Birgitt","first_name":"Birgitt","last_name":"Schüle"},{"first_name":"Yanru","full_name":"Chen Tsai, Yanru","last_name":"Chen Tsai"},{"first_name":"Michele","full_name":"Calos, Michele","last_name":"Calos"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. 2014;42(5). doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>","chicago":"Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>.","ieee":"F. Zhu <i>et al.</i>, “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” <i>Nucleic Acids Research</i>, vol. 42, no. 5. Oxford University Press, 2014.","ista":"Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 42(5), e34.","apa":"Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B., … Calos, M. (2014). DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>","mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>."},"has_accepted_license":"1","_id":"2261","scopus_import":1,"file_date_updated":"2020-07-14T12:45:35Z","date_created":"2018-12-11T11:56:38Z","ddc":["571","610"],"year":"2014","volume":42,"publication":"Nucleic Acids Research","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","date_published":"2014-03-05T00:00:00Z","quality_controlled":"1"},{"publisher":"IEEE","page":"2936 - 2943","language":[{"iso":"eng"}],"status":"public","publist_id":"4669","doi":"10.1109/ICCV.2013.365","abstract":[{"text":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. \r\nThis partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. \r\nOur main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.\r\n","lang":"eng"}],"month":"03","day":"03","publication_status":"published","conference":{"location":"Sydney, Australia","start_date":"2013-12-01","end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision"},"quality_controlled":"1","date_published":"2014-03-03T00:00:00Z","title":"Partial enumeration and curvature regularization","date_created":"2018-12-11T11:56:42Z","ddc":["000"],"year":"2014","_id":"2275","scopus_import":1,"file_date_updated":"2020-07-14T12:45:36Z","type":"conference","pubrep_id":"566","oa":1,"author":[{"last_name":"Olsson","first_name":"Carl","full_name":"Olsson, Carl"},{"full_name":"Ulen, Johannes","first_name":"Johannes","last_name":"Ulen"},{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>","short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.","ieee":"C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.","apa":"Olsson, C., Ulen, J., Boykov, Y., &#38; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>","mla":"Olsson, Carl, et al. <i>Partial Enumeration and Curvature Regularization</i>. IEEE, 2014, pp. 2936–43, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>.","ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943."},"file":[{"checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","relation":"main_file","creator":"system","access_level":"open_access","file_id":"4754","date_created":"2018-12-12T10:09:30Z","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:36Z","file_size":378601}],"department":[{"_id":"VlKo"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:56:28Z"},{"article_type":"original","page":"141 - 156","intvolume":"       104","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Springer","month":"02","day":"01","publication_status":"published","status":"public","doi":"10.1007/s11005-013-0667-9","abstract":[{"lang":"eng","text":"We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential."}],"publist_id":"4653","issue":"2","date_created":"2018-12-11T11:56:44Z","volume":104,"article_processing_charge":"No","publication":"Letters in Mathematical Physics","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1301.5682"}],"year":"2014","quality_controlled":"1","date_published":"2014-02-01T00:00:00Z","title":"On the mass concentration for Bose-Einstein condensates with attractive interactions","type":"journal_article","author":[{"first_name":"Yujin","full_name":"Guo, Yujin","last_name":"Guo"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>.","short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","ama":"Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. 2014;104(2):141-156. doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>","ieee":"Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2. Springer, pp. 141–156, 2014.","mla":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>.","apa":"Guo, Y., &#38; Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>","ista":"Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156."},"department":[{"_id":"RoSe"}],"date_updated":"2024-02-14T12:19:42Z","oa_version":"Preprint","_id":"2281","scopus_import":"1","external_id":{"arxiv":["1301.5682"]}},{"date_created":"2018-12-11T11:56:46Z","ddc":["570"],"volume":23,"publication":"Hippocampus","year":"2014","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"quality_controlled":"1","title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","date_published":"2014-02-01T00:00:00Z","type":"journal_article","pubrep_id":"461","oa":1,"author":[{"full_name":"Hosp, Jonas","first_name":"Jonas","last_name":"Hosp"},{"full_name":"Strüber, Michael","first_name":"Michael","last_name":"Strüber"},{"first_name":"Yuchio","full_name":"Yanagawa, Yuchio","last_name":"Yanagawa"},{"full_name":"Obata, Kunihiko","first_name":"Kunihiko","last_name":"Obata"},{"last_name":"Vida","full_name":"Vida, Imre","first_name":"Imre"},{"first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"last_name":"Bartos","full_name":"Bartos, Marlene","first_name":"Marlene"}],"has_accepted_license":"1","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 23(2), 189–203.","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>.","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &#38; Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>","ieee":"J. Hosp <i>et al.</i>, “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” <i>Hippocampus</i>, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014.","ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. 2014;23(2):189-203. doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203.","chicago":"Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida, Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>."},"department":[{"_id":"PeJo"}],"file":[{"checksum":"ff6bc75a79dbc985a2e31b79253e6444","relation":"main_file","creator":"system","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:37Z","file_size":801589,"access_level":"open_access","file_id":"5178","date_created":"2018-12-12T10:15:54Z"}],"oa_version":"Published Version","date_updated":"2021-01-12T06:56:32Z","_id":"2285","scopus_import":1,"file_date_updated":"2020-07-14T12:45:37Z","page":"189 - 203","intvolume":"        23","language":[{"iso":"eng"}],"publisher":"Wiley-Blackwell","month":"02","day":"01","acknowledgement":"Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505, SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation); Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript. They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical assistance.","publication_status":"published","status":"public","publist_id":"4646","doi":"10.1002/hipo.22214","abstract":[{"lang":"eng","text":"GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity."}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","issue":"2"},{"year":"2014","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.1780"}],"publication":"Journal of Statistical Physics","volume":154,"language":[{"iso":"eng"}],"intvolume":"       154","date_created":"2018-12-11T11:57:29Z","page":"51 - 57","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"title":"Equivalence of two definitions of the effective mass of a polaron","date_published":"2014-01-01T00:00:00Z","quality_controlled":"1","publisher":"Springer","date_updated":"2021-01-12T06:57:18Z","oa_version":"Submitted Version","publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lieb É, Seiringer R. 2014. Equivalence of two definitions of the effective mass of a polaron. Journal of Statistical Physics. 154(1–2), 51–57.","mla":"Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” <i>Journal of Statistical Physics</i>, vol. 154, no. 1–2, Springer, 2014, pp. 51–57, doi:<a href=\"https://doi.org/10.1007/s10955-013-0791-z\">10.1007/s10955-013-0791-z</a>.","apa":"Lieb, É., &#38; Seiringer, R. (2014). Equivalence of two definitions of the effective mass of a polaron. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-013-0791-z\">https://doi.org/10.1007/s10955-013-0791-z</a>","ieee":"É. Lieb and R. Seiringer, “Equivalence of two definitions of the effective mass of a polaron,” <i>Journal of Statistical Physics</i>, vol. 154, no. 1–2. Springer, pp. 51–57, 2014.","ama":"Lieb É, Seiringer R. Equivalence of two definitions of the effective mass of a polaron. <i>Journal of Statistical Physics</i>. 2014;154(1-2):51-57. doi:<a href=\"https://doi.org/10.1007/s10955-013-0791-z\">10.1007/s10955-013-0791-z</a>","short":"É. Lieb, R. Seiringer, Journal of Statistical Physics 154 (2014) 51–57.","chicago":"Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the Effective Mass of a Polaron.” <i>Journal of Statistical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10955-013-0791-z\">https://doi.org/10.1007/s10955-013-0791-z</a>."},"day":"01","author":[{"full_name":"Lieb, Élliott","first_name":"Élliott","last_name":"Lieb"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"oa":1,"extern":"1","type":"journal_article","month":"01","issue":"1-2","doi":"10.1007/s10955-013-0791-z","abstract":[{"text":"Two definitions of the effective mass of a particle interacting with a quantum field, such as a polaron, are considered and shown to be equal in models similar to the Fröhlich polaron model. These are: 1. the mass defined by the low momentum energy E(P)≈E(0)+P2/2 M of the translation invariant system constrained to have momentum P and 2. the mass M of a simple particle in an arbitrary slowly varying external potential, V, described by the nonrelativistic Schrödinger equation, whose ground state energy equals that of the combined particle/field system in a bound state in the same V.","lang":"eng"}],"publist_id":"4519","status":"public","_id":"2407"},{"doi":"10.1109/tcomm.2014.2345069","abstract":[{"text":"We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smaller error probability than polar codes under MAP decoding. This motivates us to introduce a family of codes that “interpolates” between RM and polar codes, call this family C inter = {C α : α ∈ [0, 1j}, where C α|α=1 is the original polar code, and C α|α=0 is an RM code. Based on numerical observations, we remark that the error probability under MAP decoding is an increasing function of α. MAP decoding has in general exponential complexity, but empirically the performance of polar codes at finite block lengths is boosted by moving along the family Cinter even under low-complexity decoding schemes such as, for instance, belief propagation or successive cancellation list decoder. We demonstrate the performance gain via numerical simulations for transmission over the erasure channel as well as the Gaussian channel.","lang":"eng"}],"issue":"9","publication_identifier":{"issn":["0090-6778"]},"status":"public","extern":"1","day":"01","publication_status":"published","month":"09","publisher":"IEEE","language":[{"iso":"eng"}],"arxiv":1,"page":"3084-3091","intvolume":"        62","external_id":{"arxiv":["1401.3127"]},"_id":"6739","author":[{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"first_name":"Hamed","full_name":"Hassani, Hamed","last_name":"Hassani"},{"last_name":"Urbanke","first_name":"Rudiger","full_name":"Urbanke, Rudiger"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Mondelli, Marco, et al. “From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.” <i>IEEE Transactions on Communications</i>, vol. 62, no. 9, IEEE, 2014, pp. 3084–91, doi:<a href=\"https://doi.org/10.1109/tcomm.2014.2345069\">10.1109/tcomm.2014.2345069</a>.","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2014). From polar to Reed-Muller codes: A technique to improve the finite-length performance. <i>IEEE Transactions on Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/tcomm.2014.2345069\">https://doi.org/10.1109/tcomm.2014.2345069</a>","ista":"Mondelli M, Hassani H, Urbanke R. 2014. From polar to Reed-Muller codes: A technique to improve the finite-length performance. IEEE Transactions on Communications. 62(9), 3084–3091.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “From polar to Reed-Muller codes: A technique to improve the finite-length performance,” <i>IEEE Transactions on Communications</i>, vol. 62, no. 9. IEEE, pp. 3084–3091, 2014.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.” <i>IEEE Transactions on Communications</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/tcomm.2014.2345069\">https://doi.org/10.1109/tcomm.2014.2345069</a>.","ama":"Mondelli M, Hassani H, Urbanke R. From polar to Reed-Muller codes: A technique to improve the finite-length performance. <i>IEEE Transactions on Communications</i>. 2014;62(9):3084-3091. doi:<a href=\"https://doi.org/10.1109/tcomm.2014.2345069\">10.1109/tcomm.2014.2345069</a>","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Communications 62 (2014) 3084–3091."},"oa_version":"Preprint","date_updated":"2021-01-12T08:08:46Z","type":"journal_article","quality_controlled":"1","title":"From polar to Reed-Muller codes: A technique to improve the finite-length performance","date_published":"2014-09-01T00:00:00Z","volume":62,"publication":"IEEE Transactions on Communications","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1401.3127"}],"year":"2014","date_created":"2019-07-31T07:20:21Z"}]