[{"conference":{"end_date":"2016-09-21","location":"Athens, Greece","start_date":"2016-09-19","name":"GD: Graph Drawing and Network Visualization"},"year":"2016","author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"first_name":"Marcus","full_name":"Schaefer, Marcus","last_name":"Schaefer"}],"department":[{"_id":"UlWa"}],"day":"08","publisher":"Springer","arxiv":1,"oa_version":"Preprint","doi":"10.1007/978-3-319-50106-2_36","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"6193","abstract":[{"lang":"eng","text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C1, … , Ck with common center c, and edges are drawn radially: every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. A pair of edges e and f in a graph is independent if e and f do not share a vertex. We show that a graph G is radial planar if G has a radial drawing in which every two independent edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing."}],"publication_status":"published","type":"conference","citation":{"chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity II,” 9801:468–81. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">https://doi.org/10.1007/978-3-319-50106-2_36</a>.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity II. In: Vol 9801. Springer; 2016:468-481. doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">10.1007/978-3-319-50106-2_36</a>","mla":"Fulek, Radoslav, et al. <i>Hanani-Tutte for Radial Planarity II</i>. Vol. 9801, Springer, 2016, pp. 468–81, doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">10.1007/978-3-319-50106-2_36</a>.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.","apa":"Fulek, R., Pelsmajer, M., &#38; Schaefer, M. (2016). Hanani-Tutte for radial planarity II (Vol. 9801, pp. 468–481). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_36\">https://doi.org/10.1007/978-3-319-50106-2_36</a>","short":"R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2016, pp. 468–481.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity II,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 468–481."},"ec_funded":1,"article_processing_charge":"No","date_published":"2016-12-08T00:00:00Z","month":"12","date_updated":"2023-02-23T10:05:57Z","title":"Hanani-Tutte for radial planarity II","external_id":{"arxiv":["1608.08662"]},"date_created":"2018-12-11T11:50:29Z","_id":"1164","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"page":"468 - 481","intvolume":"      9801","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"1113","relation":"later_version","status":"public"},{"id":"1595","status":"public","relation":"earlier_version"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1608.08662","open_access":"1"}],"alternative_title":["LNCS"],"volume":9801,"scopus_import":1},{"quality_controlled":"1","publist_id":"6192","publication_status":"published","abstract":[{"text":"We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"citation":{"ieee":"R. Fulek, “C-planarity of embedded cyclic c-graphs,” presented at the GD: Graph Drawing and Network Visualization, Athens, Greece, 2016, vol. 9801, pp. 94–106.","apa":"Fulek, R. (2016). C-planarity of embedded cyclic c-graphs (Vol. 9801, pp. 94–106). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_8\">https://doi.org/10.1007/978-3-319-50106-2_8</a>","short":"R. Fulek, in:, Springer, 2016, pp. 94–106.","ista":"Fulek R. 2016. C-planarity of embedded cyclic c-graphs. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 94–106.","mla":"Fulek, Radoslav. <i>C-Planarity of Embedded Cyclic c-Graphs</i>. Vol. 9801, Springer, 2016, pp. 94–106, doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_8\">10.1007/978-3-319-50106-2_8</a>.","chicago":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs,” 9801:94–106. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50106-2_8\">https://doi.org/10.1007/978-3-319-50106-2_8</a>.","ama":"Fulek R. C-planarity of embedded cyclic c-graphs. In: Vol 9801. Springer; 2016:94-106. doi:<a href=\"https://doi.org/10.1007/978-3-319-50106-2_8\">10.1007/978-3-319-50106-2_8</a>"},"type":"conference","year":"2016","conference":{"name":"GD: Graph Drawing and Network Visualization","start_date":"2016-09-19","location":"Athens, Greece","end_date":"2016-09-21"},"author":[{"last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"UlWa"}],"publisher":"Springer","day":"08","doi":"10.1007/978-3-319-50106-2_8","oa_version":"Preprint","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"R. Fulek—The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].\r\nI would like to thank Jan Kynčl and Dömötör Pálvölgyi for many comments and suggestions that helped to improve the presentation of the result.","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.01346"}],"related_material":{"record":[{"id":"794","relation":"later_version","status":"public"}]},"alternative_title":["LNCS"],"volume":"9801 ","scopus_import":1,"date_published":"2016-12-08T00:00:00Z","ec_funded":1,"title":"C-planarity of embedded cyclic c-graphs","date_updated":"2023-09-27T12:14:48Z","month":"12","_id":"1165","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"date_created":"2018-12-11T11:50:30Z","page":"94 - 106"},{"ec_funded":1,"date_published":"2016-12-02T00:00:00Z","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Davies, Jessica","last_name":"Davies","id":"378E0060-F248-11E8-B48F-1D18A9856A87","first_name":"Jessica"}],"conference":{"start_date":"2016-02-12","location":"Phoenix, AZ, USA","end_date":"2016-02-17","name":"AAAI: Conference on Artificial Intelligence"},"year":"2016","month":"12","title":"A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps","date_updated":"2023-02-23T12:26:41Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T11:50:30Z","day":"02","_id":"1166","publisher":"AAAI Press","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"page":"3225 - 3232","oa_version":"None","publication":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"      2016","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.","lang":"eng"}],"volume":2016,"publication_status":"published","publist_id":"6191","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5443"}],"link":[{"relation":"table_of_contents","url":"https://dl.acm.org/citation.cfm?id=3016355"}]},"type":"conference","citation":{"ieee":"K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.","short":"K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i> (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.","mla":"Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, vol. 2016, AAAI Press, 2016, pp. 3225–32.","ista":"Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.","ama":"Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In: <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>. Vol 2016. AAAI Press; 2016:3225-3232.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, 2016:3225–32. AAAI Press, 2016."}},{"type":"journal_article","citation":{"ieee":"M. P. Zagórski, Z. Burda, and B. Wacław, “Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks,” <i>PLoS Computational Biology</i>, vol. 12, no. 12. Public Library of Science, 2016.","apa":"Zagórski, M. P., Burda, Z., &#38; Wacław, B. (2016). Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005218\">https://doi.org/10.1371/journal.pcbi.1005218</a>","short":"M.P. Zagórski, Z. Burda, B. Wacław, PLoS Computational Biology 12 (2016).","ista":"Zagórski MP, Burda Z, Wacław B. 2016. Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. PLoS Computational Biology. 12(12), e1005218.","mla":"Zagórski, Marcin P., et al. “Beyond the Hypercube Evolutionary Accessibility of Fitness Landscapes with Realistic Mutational Networks.” <i>PLoS Computational Biology</i>, vol. 12, no. 12, e1005218, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005218\">10.1371/journal.pcbi.1005218</a>.","chicago":"Zagórski, Marcin P, Zdzisław Burda, and Bartłomiej Wacław. “Beyond the Hypercube Evolutionary Accessibility of Fitness Landscapes with Realistic Mutational Networks.” <i>PLoS Computational Biology</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pcbi.1005218\">https://doi.org/10.1371/journal.pcbi.1005218</a>.","ama":"Zagórski MP, Burda Z, Wacław B. Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks. <i>PLoS Computational Biology</i>. 2016;12(12). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005218\">10.1371/journal.pcbi.1005218</a>"},"file":[{"date_created":"2018-12-12T10:12:08Z","creator":"system","file_id":"4926","file_name":"IST-2017-740-v1+1_journal.pcbi.1005218.pdf","access_level":"open_access","checksum":"84f44ae92866c52ff1ca8a574558dca7","relation":"main_file","file_size":3822299,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z"}],"ddc":["570"],"language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","abstract":[{"text":"Evolutionary pathways describe trajectories of biological evolution in the space of different variants of organisms (genotypes). The probability of existence and the number of evolutionary pathways that lead from a given genotype to a better-adapted genotype are important measures of accessibility of local fitness optima and the reproducibility of evolution. Both quantities have been studied in simple mathematical models where genotypes are represented as binary sequences of two types of basic units, and the network of permitted mutations between the genotypes is a hypercube graph. However, it is unclear how these results translate to the biologically relevant case in which genotypes are represented by sequences of more than two units, for example four nucleotides (DNA) or 20 amino acids (proteins), and the mutational graph is not the hypercube. Here we investigate accessibility of the best-adapted genotype in the general case of K &gt; 2 units. Using computer generated and experimental fitness landscapes we show that accessibility of the global fitness maximum increases with K and can be much higher than for binary sequences. The increase in accessibility comes from the increase in the number of indirect trajectories exploited by evolution for higher K. As one of the consequences, the fraction of genotypes that are accessible increases by three orders of magnitude when the number of units K increases from 2 to 16 for landscapes of size N ∼ 106genotypes. This suggests that evolution can follow many different trajectories on such landscapes and the reconstruction of evolutionary pathways from experimental data might be an extremely difficult task.","lang":"eng"}],"publication_status":"published","publist_id":"6190","quality_controlled":"1","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1005218","day":"09","publisher":"Public Library of Science","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"AnKi"}],"author":[{"id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin P","last_name":"Zagórski","orcid":"0000-0001-7896-7762","full_name":"Zagórski, Marcin P"},{"first_name":"Zdzisław","last_name":"Burda","full_name":"Burda, Zdzisław"},{"first_name":"Bartłomiej","last_name":"Wacław","full_name":"Wacław, Bartłomiej"}],"year":"2016","scopus_import":"1","license":"https://creativecommons.org/licenses/by/4.0/","volume":12,"related_material":{"record":[{"relation":"research_data","status":"public","id":"9866"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","acknowledgement":"MZ acknowledges the Polish National Science Centre grant no. DEC-2012/07/N/NZ2/00107. BW was supported by the Scottish Government/Royal Society of Edinburgh Personal Research Fellowship. We thank Marjon de Vos and Oliver Martin for critically reading the manuscript.","issue":"12","oa":1,"intvolume":"        12","article_number":"e1005218","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"740","publication":"PLoS Computational Biology","date_created":"2018-12-11T11:50:30Z","_id":"1167","month":"12","title":"Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks","date_updated":"2023-02-23T14:11:22Z","date_published":"2016-12-09T00:00:00Z","article_processing_charge":"No"},{"publisher":"Society for Industrial and Applied Mathematics ","day":"15","doi":"10.1137/15M103306X","oa_version":"Submitted Version","year":"2016","author":[{"last_name":"Lang","full_name":"Lang, Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","first_name":"Moritz"},{"full_name":"Stelling, Jörg","last_name":"Stelling","first_name":"Jörg"}],"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"ddc":["003","518","570","621"],"file":[{"file_id":"5095","creator":"system","date_created":"2018-12-12T10:14:41Z","file_size":871964,"date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","checksum":"781bc3ffd30b2dd65b7727c5a285fc78","relation":"main_file","access_level":"local","file_name":"IST-2017-811-v1+1_modular_parameter_identification.pdf"}],"citation":{"ista":"Lang M, Stelling J. 2016. Modular parameter identification of biomolecular networks. SIAM Journal on Scientific Computing. 38(6), B988–B1008.","mla":"Lang, Moritz, and Jörg Stelling. “Modular Parameter Identification of Biomolecular Networks.” <i>SIAM Journal on Scientific Computing</i>, vol. 38, no. 6, Society for Industrial and Applied Mathematics , 2016, pp. B988–1008, doi:<a href=\"https://doi.org/10.1137/15M103306X\">10.1137/15M103306X</a>.","ama":"Lang M, Stelling J. Modular parameter identification of biomolecular networks. <i>SIAM Journal on Scientific Computing</i>. 2016;38(6):B988-B1008. doi:<a href=\"https://doi.org/10.1137/15M103306X\">10.1137/15M103306X</a>","chicago":"Lang, Moritz, and Jörg Stelling. “Modular Parameter Identification of Biomolecular Networks.” <i>SIAM Journal on Scientific Computing</i>. Society for Industrial and Applied Mathematics , 2016. <a href=\"https://doi.org/10.1137/15M103306X\">https://doi.org/10.1137/15M103306X</a>.","ieee":"M. Lang and J. Stelling, “Modular parameter identification of biomolecular networks,” <i>SIAM Journal on Scientific Computing</i>, vol. 38, no. 6. Society for Industrial and Applied Mathematics , pp. B988–B1008, 2016.","apa":"Lang, M., &#38; Stelling, J. (2016). Modular parameter identification of biomolecular networks. <i>SIAM Journal on Scientific Computing</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/15M103306X\">https://doi.org/10.1137/15M103306X</a>","short":"M. Lang, J. Stelling, SIAM Journal on Scientific Computing 38 (2016) B988–B1008."},"type":"journal_article","quality_controlled":"1","publist_id":"6186","abstract":[{"lang":"eng","text":"The increasing complexity of dynamic models in systems and synthetic biology poses computational challenges especially for the identification of model parameters. While modularization of the corresponding optimization problems could help reduce the “curse of dimensionality,” abundant feedback and crosstalk mechanisms prohibit a simple decomposition of most biomolecular networks into subnetworks, or modules. Drawing on ideas from network modularization and multiple-shooting optimization, we present here a modular parameter identification approach that explicitly allows for such interdependencies. Interfaces between our modules are given by the experimentally measured molecular species. This definition allows deriving good (initial) estimates for the inter-module communication directly from the experimental data. Given these estimates, the states and parameter sensitivities of different modules can be integrated independently. To achieve consistency between modules, we iteratively adjust the estimates for inter-module communication while optimizing the parameters. After convergence to an optimal parameter set---but not during earlier iterations---the intermodule communication as well as the individual modules\\' state dynamics agree with the dynamics of the nonmodularized network. Our modular parameter identification approach allows for easy parallelization; it can reduce the computational complexity for larger networks and decrease the probability to converge to suboptimal local minima. We demonstrate the algorithm\\'s performance in parameter estimation for two biomolecular networks, a synthetic genetic oscillator and a mammalian signaling pathway."}],"publication_status":"published","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"_id":"1170","date_created":"2018-12-11T11:50:31Z","publication":"SIAM Journal on Scientific Computing","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"811","page":"B988 - B1008","date_published":"2016-11-15T00:00:00Z","date_updated":"2021-01-12T06:48:49Z","title":"Modular parameter identification of biomolecular networks","month":"11","scopus_import":1,"intvolume":"        38","issue":"6","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":38},{"citation":{"chicago":"Tkačik, Gašper. “Understanding Regulatory Networks Requires More than Computing a Multitude of Graph Statistics: Comment on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot; by O. C. Martin et Al.” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.005\">https://doi.org/10.1016/j.plrev.2016.06.005</a>.","ama":"Tkačik G. Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; by O. C. Martin et al. <i>Physics of Life Reviews</i>. 2016;17:166-167. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.005\">10.1016/j.plrev.2016.06.005</a>","mla":"Tkačik, Gašper. “Understanding Regulatory Networks Requires More than Computing a Multitude of Graph Statistics: Comment on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot; by O. C. Martin et Al.” <i>Physics of Life Reviews</i>, vol. 17, Elsevier, 2016, pp. 166–67, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.005\">10.1016/j.plrev.2016.06.005</a>.","ista":"Tkačik G. 2016. Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; by O. C. Martin et al. Physics of Life Reviews. 17, 166–167.","apa":"Tkačik, G. (2016). Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; by O. C. Martin et al. <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.005\">https://doi.org/10.1016/j.plrev.2016.06.005</a>","short":"G. Tkačik, Physics of Life Reviews 17 (2016) 166–167.","ieee":"G. Tkačik, “Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; by O. C. Martin et al.,” <i>Physics of Life Reviews</i>, vol. 17. Elsevier, pp. 166–167, 2016."},"scopus_import":1,"type":"journal_article","status":"public","language":[{"iso":"eng"}],"publist_id":"6185","volume":17,"publication_status":"published","intvolume":"        17","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa_version":"None","page":"166 - 167","doi":"10.1016/j.plrev.2016.06.005","publication":"Physics of Life Reviews","day":"01","date_created":"2018-12-11T11:50:32Z","_id":"1171","publisher":"Elsevier","month":"07","department":[{"_id":"GaTk"}],"title":"Understanding regulatory networks requires more than computing a multitude of graph statistics: Comment on &quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&quot; by O. C. Martin et al.","date_updated":"2021-01-12T06:48:50Z","year":"2016","author":[{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2016-07-01T00:00:00Z"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"NiBa"}],"year":"2016","author":[{"id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani","full_name":"Sachdeva, Himani","last_name":"Sachdeva"},{"full_name":"Barma, Mustansir","last_name":"Barma","first_name":"Mustansir"},{"last_name":"Rao","full_name":"Rao, Madan","first_name":"Madan"}],"oa_version":"Published Version","doi":"10.1038/srep38840","day":"19","publisher":"Nature Publishing Group","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"6183","publication_status":"published","abstract":[{"text":"A central issue in cell biology is the physico-chemical basis of organelle biogenesis in intracellular trafficking pathways, its most impressive manifestation being the biogenesis of Golgi cisternae. At a basic level, such morphologically and chemically distinct compartments should arise from an interplay between the molecular transport and chemical maturation. Here, we formulate analytically tractable, minimalist models, that incorporate this interplay between transport and chemical progression in physical space, and explore the conditions for de novo biogenesis of distinct cisternae. We propose new quantitative measures that can discriminate between the various models of transport in a qualitative manner-this includes measures of the dynamics in steady state and the dynamical response to perturbations of the kind amenable to live-cell imaging.","lang":"eng"}],"quality_controlled":"1","citation":{"apa":"Sachdeva, H., Barma, M., &#38; Rao, M. (2016). Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep38840\">https://doi.org/10.1038/srep38840</a>","short":"H. Sachdeva, M. Barma, M. Rao, Scientific Reports 6 (2016).","ieee":"H. Sachdeva, M. Barma, and M. Rao, “Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae,” <i>Scientific Reports</i>, vol. 6. Nature Publishing Group, 2016.","ama":"Sachdeva H, Barma M, Rao M. Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. <i>Scientific Reports</i>. 2016;6. doi:<a href=\"https://doi.org/10.1038/srep38840\">10.1038/srep38840</a>","chicago":"Sachdeva, Himani, Mustansir Barma, and Madan Rao. “Nonequilibrium Description of de Novo Biogenesis and Transport through Golgi-like Cisternae.” <i>Scientific Reports</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/srep38840\">https://doi.org/10.1038/srep38840</a>.","mla":"Sachdeva, Himani, et al. “Nonequilibrium Description of de Novo Biogenesis and Transport through Golgi-like Cisternae.” <i>Scientific Reports</i>, vol. 6, 38840, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/srep38840\">10.1038/srep38840</a>.","ista":"Sachdeva H, Barma M, Rao M. 2016. Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae. Scientific Reports. 6, 38840."},"type":"journal_article","file":[{"file_size":760967,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","relation":"main_file","checksum":"cb378732da885ea4959ec5b845fb6e52","access_level":"open_access","file_name":"IST-2017-737-v1+1_srep38840.pdf","file_id":"4977","creator":"system","date_created":"2018-12-12T10:12:56Z"}],"ddc":["576"],"month":"12","title":"Nonequilibrium description of de novo biogenesis and transport through Golgi-like cisternae","date_updated":"2021-01-12T06:48:50Z","date_published":"2016-12-19T00:00:00Z","publication":"Scientific Reports","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"737","date_created":"2018-12-11T11:50:32Z","_id":"1172","volume":6,"oa":1,"intvolume":"         6","acknowledgement":"H.S. thanks NCBS for hospitality. We thank Vivek Malhotra and Mukund Thattai for critical discussions and suggestions.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_number":"38840","scopus_import":1},{"date_published":"2016-04-01T00:00:00Z","author":[{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","full_name":"Chatterjee, Sanjit","first_name":"Sanjit"}],"year":"2016","date_updated":"2021-01-12T06:48:52Z","title":"A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound","department":[{"_id":"KrPi"}],"month":"04","_id":"1177","publisher":"Springer","date_created":"2018-12-11T11:50:33Z","day":"01","doi":"10.1007/s00453-015-9997-6","publication":"Algorithmica","oa_version":"Submitted Version","page":"1321 - 1362","quality_controlled":"1","issue":"4","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We are grateful to the anonymous reviewers for their insightful comments. The\r\ndetailed reports helped us a lot to address the technical mistakes as well as to improve the overall presentation of the paper.","oa":1,"intvolume":"        74","abstract":[{"lang":"eng","text":"Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of (Formula presented.) , where (Formula presented.) denotes the upper bound on the underlying random oracle calls and (Formula presented.) , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of ‘dependence’ and ‘independence’ conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of (Formula presented.). By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent."}],"publication_status":"published","volume":74,"publist_id":"6177","main_file_link":[{"url":"http://eprint.iacr.org/2013/651","open_access":"1"}],"language":[{"iso":"eng"}],"status":"public","type":"journal_article","citation":{"ista":"Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.","mla":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:<a href=\"https://doi.org/10.1007/s00453-015-9997-6\">10.1007/s00453-015-9997-6</a>.","ama":"Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. <i>Algorithmica</i>. 2016;74(4):1321-1362. doi:<a href=\"https://doi.org/10.1007/s00453-015-9997-6\">10.1007/s00453-015-9997-6</a>","chicago":"Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00453-015-9997-6\">https://doi.org/10.1007/s00453-015-9997-6</a>.","ieee":"C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” <i>Algorithmica</i>, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.","short":"C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.","apa":"Kamath Hosdurg, C., &#38; Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-015-9997-6\">https://doi.org/10.1007/s00453-015-9997-6</a>"}},{"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/159"}],"alternative_title":["LNCS"],"volume":9985,"intvolume":"      9985","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"K. Pietrzak—Supported by the European Research Council consolidator grant (682815-TOCNeT).\r\nM. Skórski—Supported by the National Science Center, Poland (2015/17/N/ST6/03564).","scopus_import":1,"date_updated":"2021-01-12T06:48:53Z","title":"Pseudoentropy: Lower-bounds for chain rules and transformations","month":"10","date_published":"2016-10-22T00:00:00Z","ec_funded":1,"page":"183 - 203","_id":"1179","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"date_created":"2018-12-11T11:50:34Z","publist_id":"6175","publication_status":"published","abstract":[{"lang":"eng","text":"Computational notions of entropy have recently found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The two main types of results which make computational notions so useful are (1) Chain rules, which quantify by how much the computational entropy of a variable decreases if conditioned on some other variable (2) Transformations, which quantify to which extend one type of entropy implies another.\r\n\r\nSuch chain rules and transformations typically lose a significant amount in quality of the entropy, and are the reason why applying these results one gets rather weak quantitative security bounds. In this paper we for the first time prove lower bounds in this context, showing that existing results for transformations are, unfortunately, basically optimal for non-adaptive black-box reductions (and it’s hard to imagine how non black-box reductions or adaptivity could be useful here.)\r\n\r\nA variable X has k bits of HILL entropy of quality (ϵ,s)\r\nif there exists a variable Y with k bits min-entropy which cannot be distinguished from X with advantage ϵ\r\n\r\nby distinguishing circuits of size s. A weaker notion is Metric entropy, where we switch quantifiers, and only require that for every distinguisher of size s, such a Y exists.\r\n\r\nWe first describe our result concerning transformations. By definition, HILL implies Metric without any loss in quality. Metric entropy often comes up in applications, but must be transformed to HILL for meaningful security guarantees. The best known result states that if a variable X has k bits of Metric entropy of quality (ϵ,s)\r\n, then it has k bits of HILL with quality (2ϵ,s⋅ϵ2). We show that this loss of a factor Ω(ϵ−2)\r\n\r\nin circuit size is necessary. In fact, we show the stronger result that this loss is already necessary when transforming so called deterministic real valued Metric entropy to randomised boolean Metric (both these variants of Metric entropy are implied by HILL without loss in quality).\r\n\r\nThe chain rule for HILL entropy states that if X has k bits of HILL entropy of quality (ϵ,s)\r\n, then for any variable Z of length m, X conditioned on Z has k−m bits of HILL entropy with quality (ϵ,s⋅ϵ2/2m). We show that a loss of Ω(2m/ϵ) in circuit size necessary here. Note that this still leaves a gap of ϵ between the known bound and our lower bound."}],"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","citation":{"ieee":"K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.","short":"K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.","apa":"Pietrzak, K. Z., &#38; Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_8\">https://doi.org/10.1007/978-3-662-53641-4_8</a>","ista":"Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985, 183–203.","mla":"Pietrzak, Krzysztof Z., and Skorski Maciej. <i>Pseudoentropy: Lower-Bounds for Chain Rules and Transformations</i>. Vol. 9985, Springer, 2016, pp. 183–203, doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_8\">10.1007/978-3-662-53641-4_8</a>.","chicago":"Pietrzak, Krzysztof Z, and Skorski Maciej. “Pseudoentropy: Lower-Bounds for Chain Rules and Transformations,” 9985:183–203. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53641-4_8\">https://doi.org/10.1007/978-3-662-53641-4_8</a>.","ama":"Pietrzak KZ, Maciej S. Pseudoentropy: Lower-bounds for chain rules and transformations. In: Vol 9985. Springer; 2016:183-203. doi:<a href=\"https://doi.org/10.1007/978-3-662-53641-4_8\">10.1007/978-3-662-53641-4_8</a>"},"department":[{"_id":"KrPi"}],"year":"2016","conference":{"location":"Beijing, China","start_date":"2016-10-31","end_date":"2016-11-03","name":"TCC: Theory of Cryptography Conference"},"author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Skorski","full_name":"Maciej, Skorski","last_name":"Maciej"}],"doi":"10.1007/978-3-662-53641-4_8","oa_version":"Preprint","publisher":"Springer","day":"22"},{"scopus_import":1,"citation":{"ama":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. <i>Journal of Neuroscience</i>. 2016;36(45):11394-11401. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2359-16.2016\">10.1523/JNEUROSCI.2359-16.2016</a>","chicago":"Dwyer, Noelle, Bin Chen, Shen Chou, Simon Hippenmeyer, Laurent Nguyen, and Troy Ghashghaei. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2016. <a href=\"https://doi.org/10.1523/JNEUROSCI.2359-16.2016\">https://doi.org/10.1523/JNEUROSCI.2359-16.2016</a>.","ista":"Dwyer N, Chen B, Chou S, Hippenmeyer S, Nguyen L, Ghashghaei T. 2016. Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. Journal of Neuroscience. 36(45), 11394–11401.","mla":"Dwyer, Noelle, et al. “Neural Stem Cells to Cerebral Cortex: Emerging Mechanisms Regulating Progenitor Behavior and Productivity.” <i>Journal of Neuroscience</i>, vol. 36, no. 45, Society for Neuroscience, 2016, pp. 11394–401, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2359-16.2016\">10.1523/JNEUROSCI.2359-16.2016</a>.","apa":"Dwyer, N., Chen, B., Chou, S., Hippenmeyer, S., Nguyen, L., &#38; Ghashghaei, T. (2016). Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.2359-16.2016\">https://doi.org/10.1523/JNEUROSCI.2359-16.2016</a>","short":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, T. Ghashghaei, Journal of Neuroscience 36 (2016) 11394–11401.","ieee":"N. Dwyer, B. Chen, S. Chou, S. Hippenmeyer, L. Nguyen, and T. Ghashghaei, “Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity,” <i>Journal of Neuroscience</i>, vol. 36, no. 45. Society for Neuroscience, pp. 11394–11401, 2016."},"type":"journal_article","publication_status":"published","abstract":[{"lang":"eng","text":"This review accompanies a 2016 SFN mini-symposium presenting examples of current studies that address a central question: How do neural stem cells (NSCs) divide in different ways to produce heterogeneous daughter types at the right time and in proper numbers to build a cerebral cortex with the appropriate size and structure? We will focus on four aspects of corticogenesis: cytokinesis events that follow apical mitoses of NSCs; coordinating abscission with delamination from the apical membrane; timing of neurogenesis and its indirect regulation through emergence of intermediate progenitors; and capacity of single NSCs to generate the correct number and laminar fate of cortical neurons. Defects in these mechanisms can cause microcephaly and other brain malformations, and understanding them is critical to designing diagnostic tools and preventive and corrective therapies."}],"volume":36,"publist_id":"6172","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","issue":"45","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by National Institutes of Health Grants R01NS089795 and R01NS098370 to H.T.G., R01NS076640 to N.D.D., and R01MH094589 and R01NS089777 to B.C., Academia Sinica AS-104-TPB09-2 to S.-J.C, European Union FP7-CIG618444 and Human Frontiers Science Program RGP0053 to S.H., and Fonds Léon Fredericq, from the Fondation Médicale Reine Elisabeth, and from the Fonation Simone et Pierre Clerdent to L.N. The authors apologize to colleagues whose work could not be cited due to space limitations.","intvolume":"        36","doi":"10.1523/JNEUROSCI.2359-16.2016","publication":"Journal of Neuroscience","page":"11394 - 11401","oa_version":"None","_id":"1181","project":[{"name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014","_id":"25D7962E-B435-11E9-9278-68D0E5697425"}],"publisher":"Society for Neuroscience","date_created":"2018-12-11T11:50:35Z","day":"09","title":"Neural stem cells to cerebral cortex: Emerging mechanisms regulating progenitor behavior and productivity","date_updated":"2021-01-12T06:48:54Z","department":[{"_id":"SiHi"}],"month":"11","date_published":"2016-11-09T00:00:00Z","author":[{"full_name":"Dwyer, Noelle","last_name":"Dwyer","first_name":"Noelle"},{"last_name":"Chen","full_name":"Chen, Bin","first_name":"Bin"},{"first_name":"Shen","full_name":"Chou, Shen","last_name":"Chou"},{"first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer"},{"last_name":"Nguyen","full_name":"Nguyen, Laurent","first_name":"Laurent"},{"full_name":"Ghashghaei, Troy","last_name":"Ghashghaei","first_name":"Troy"}],"year":"2016"},{"year":"2016","conference":{"start_date":"2016-07-09","location":"New York, NY, USA","end_date":"2016-07-15","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"date_published":"2016-01-01T00:00:00Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec"}],"ec_funded":1,"department":[{"_id":"KrCh"}],"title":"Robust draws in balanced knockout tournaments","date_updated":"2023-02-21T10:04:26Z","month":"01","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"_id":"1182","publisher":"AAAI Press","day":"01","date_created":"2018-12-11T11:50:35Z","page":"172 - 179","oa_version":"Preprint","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://www.ijcai.org/proceedings/2016","relation":"table_of_contents"}]},"publist_id":"6171","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05090v1"}],"abstract":[{"lang":"eng","text":"Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a) there exist deterministic tournaments (where the pairwise winning probabilities are 0 or 1) where one optimal draw is much more robust than the other; and (b) in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws."}],"publication_status":"published","volume":"2016-January","status":"public","language":[{"iso":"eng"}],"scopus_import":1,"citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.","ama":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.","mla":"Chatterjee, Krishnendu, et al. <i>Robust Draws in Balanced Knockout Tournaments</i>. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.","ista":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179."},"type":"conference"},{"issue":"6","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"This work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\nWe thank A.C. Manzano, Mike Liu, and F. Marr for technical assistance, and R. Shigemoto and the IST Austria Electron Microscopy (EM) Facility for assistance. We acknowledge support from CIDR for genome-wide SNP analysis (X01HG008823) and Broad Institute Center for Mendelian Disorders (UM1HG008900 to D. MacArthur), the Yale Center for Mendelian Disorders (U54HG006504 to M.G.), the Gregory M. Kiez and Mehmet Kutman Foundation (M.G.), Italian Ministry of Instruction University and Research (PON01_00937 to C.I.), and NIH (R01-GM108911 to A.S.). This work was supported by NICHD (P01HD070494) and SFARI (grant 275275) to J.G.G., and FWF (SFB35_3523) to G.N.\r\n\r\n#EMFacility","oa":1,"intvolume":"       167","volume":167,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"395"}]},"scopus_import":"1","date_published":"2016-12-01T00:00:00Z","article_processing_charge":"No","month":"12","title":"Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder","date_updated":"2024-03-25T23:30:07Z","date_created":"2018-12-11T11:50:35Z","_id":"1183","project":[{"call_identifier":"FWF","_id":"25473368-B435-11E9-9278-68D0E5697425","grant_number":"F03523","name":"Transmembrane Transporters in Health and Disease"}],"page":"1481 - 1494","pubrep_id":"771","file_date_updated":"2020-07-14T12:44:37Z","publication":"Cell","quality_controlled":"1","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","publication_status":"published","abstract":[{"text":"Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping with other neurological conditions. We previously described abnormalities in the branched-chain amino acid (BCAA) catabolic pathway as a cause of ASD. Here, we show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid transporter localized at the blood brain barrier (BBB), has an essential role in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal mRNA translation, and severe neurological abnormalities. Furthermore, we identified several patients with autistic traits and motor delay carrying deleterious homozygous mutations in the SLC7A5 gene. Finally, we demonstrate that BCAA intracerebroventricular administration ameliorates abnormal behaviors in adult mutant mice. Our data elucidate a neurological syndrome defined by SLC7A5 mutations and support an essential role for the BCAA in human brain function.","lang":"eng"}],"publist_id":"6170","article_type":"original","ddc":["576","616"],"citation":{"chicago":"Tarlungeanu, Dora-Clara, Elena Deliu, Christoph Dotter, Majdi Kara, Philipp Janiesch, Mariafrancesca Scalise, Michele Galluccio, et al. “Impaired Amino Acid Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.” <i>Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">https://doi.org/10.1016/j.cell.2016.11.013</a>.","ama":"Tarlungeanu D-C, Deliu E, Dotter C, et al. Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. <i>Cell</i>. 2016;167(6):1481-1494. doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">10.1016/j.cell.2016.11.013</a>","mla":"Tarlungeanu, Dora-Clara, et al. “Impaired Amino Acid Transport at the Blood Brain Barrier Is a Cause of Autism Spectrum Disorder.” <i>Cell</i>, vol. 167, no. 6, Cell Press, 2016, pp. 1481–94, doi:<a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">10.1016/j.cell.2016.11.013</a>.","ista":"Tarlungeanu D-C, Deliu E, Dotter C, Kara M, Janiesch P, Scalise M, Galluccio M, Tesulov M, Morelli E, Sönmez F, Bilgüvar K, Ohgaki R, Kanai Y, Johansen A, Esharif S, Ben Omran T, Topcu M, Schlessinger A, Indiveri C, Duncan K, Caglayan A, Günel M, Gleeson J, Novarino G. 2016. Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. Cell. 167(6), 1481–1494.","short":"D.-C. Tarlungeanu, E. Deliu, C. Dotter, M. Kara, P. Janiesch, M. Scalise, M. Galluccio, M. Tesulov, E. Morelli, F. Sönmez, K. Bilgüvar, R. Ohgaki, Y. Kanai, A. Johansen, S. Esharif, T. Ben Omran, M. Topcu, A. Schlessinger, C. Indiveri, K. Duncan, A. Caglayan, M. Günel, J. Gleeson, G. Novarino, Cell 167 (2016) 1481–1494.","apa":"Tarlungeanu, D.-C., Deliu, E., Dotter, C., Kara, M., Janiesch, P., Scalise, M., … Novarino, G. (2016). Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2016.11.013\">https://doi.org/10.1016/j.cell.2016.11.013</a>","ieee":"D.-C. Tarlungeanu <i>et al.</i>, “Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder,” <i>Cell</i>, vol. 167, no. 6. Cell Press, pp. 1481–1494, 2016."},"type":"journal_article","file":[{"file_name":"IST-2017-771-v1+1_Tarlungeanu_et_al._Final_edited.pdf","access_level":"open_access","checksum":"7fe01ab12a6610d3db421e0136db2f77","relation":"main_file","file_size":73907957,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:37Z","creator":"system","date_created":"2018-12-12T10:13:44Z","file_id":"5030"}],"author":[{"full_name":"Tarlungeanu, Dora-Clara","last_name":"Tarlungeanu","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87","first_name":"Dora-Clara"},{"last_name":"Deliu","orcid":"0000-0002-7370-5293","full_name":"Deliu, Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","first_name":"Elena"},{"last_name":"Dotter","full_name":"Dotter, Christoph","orcid":"0000-0002-9033-9096","first_name":"Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Majdi","full_name":"Kara, Majdi","last_name":"Kara"},{"first_name":"Philipp","full_name":"Janiesch, Philipp","last_name":"Janiesch"},{"last_name":"Scalise","full_name":"Scalise, Mariafrancesca","first_name":"Mariafrancesca"},{"last_name":"Galluccio","full_name":"Galluccio, Michele","first_name":"Michele"},{"first_name":"Mateja","full_name":"Tesulov, Mateja","last_name":"Tesulov"},{"full_name":"Morelli, Emanuela","last_name":"Morelli","id":"3F4D1282-F248-11E8-B48F-1D18A9856A87","first_name":"Emanuela"},{"last_name":"Sönmez","full_name":"Sönmez, Fatma","first_name":"Fatma"},{"first_name":"Kaya","full_name":"Bilgüvar, Kaya","last_name":"Bilgüvar"},{"full_name":"Ohgaki, Ryuichi","last_name":"Ohgaki","first_name":"Ryuichi"},{"first_name":"Yoshikatsu","full_name":"Kanai, Yoshikatsu","last_name":"Kanai"},{"full_name":"Johansen, Anide","last_name":"Johansen","first_name":"Anide"},{"first_name":"Seham","full_name":"Esharif, Seham","last_name":"Esharif"},{"first_name":"Tawfeg","last_name":"Ben Omran","full_name":"Ben Omran, Tawfeg"},{"last_name":"Topcu","full_name":"Topcu, Meral","first_name":"Meral"},{"first_name":"Avner","full_name":"Schlessinger, Avner","last_name":"Schlessinger"},{"first_name":"Cesare","full_name":"Indiveri, Cesare","last_name":"Indiveri"},{"first_name":"Kent","full_name":"Duncan, Kent","last_name":"Duncan"},{"first_name":"Ahmet","last_name":"Caglayan","full_name":"Caglayan, Ahmet"},{"first_name":"Murat","last_name":"Günel","full_name":"Günel, Murat"},{"first_name":"Joseph","full_name":"Gleeson, Joseph","last_name":"Gleeson"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"}],"year":"2016","department":[{"_id":"GaNo"}],"day":"01","publisher":"Cell Press","oa_version":"Submitted Version","doi":"10.1016/j.cell.2016.11.013"},{"quality_controlled":"1","publication_status":"published","abstract":[{"text":"Across multicellular organisms, the costs of reproduction and self-maintenance result in a life history trade-off between fecundity and longevity. Queens of perennial social Hymenoptera are both highly fertile and long-lived, and thus, this fundamental trade-off is lacking. Whether social insect males similarly evade the fecundity/longevity trade-off remains largely unstudied. Wingless males of the ant genus Cardiocondyla stay in their natal colonies throughout their relatively long lives and mate with multiple female sexuals. Here, we show that Cardiocondyla obscurior males that were allowed to mate with large numbers of female sexuals had a shortened life span compared to males that mated at a low frequency or virgin males. Although frequent mating negatively affects longevity, males clearly benefit from a “live fast, die young strategy” by inseminating as many female sexuals as possible at a cost to their own survival.","lang":"eng"}],"publist_id":"6169","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","ddc":["576","592"],"file":[{"creator":"system","date_created":"2018-12-12T10:14:12Z","file_id":"5062","file_name":"IST-2017-736-v1+1_Metzler_et_al-2016-Ecology_and_Evolution.pdf","access_level":"open_access","checksum":"789026eb9e1be2a0da08376f29f569cf","relation":"main_file","file_size":328414,"date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf"}],"citation":{"ama":"Metzler S, Heinze J, Schrempf A. Mating and longevity in ant males. <i>Ecology and Evolution</i>. 2016;6(24):8903-8906. doi:<a href=\"https://doi.org/10.1002/ece3.2474\">10.1002/ece3.2474</a>","chicago":"Metzler, Sina, Jürgen Heinze, and Alexandra Schrempf. “Mating and Longevity in Ant Males.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1002/ece3.2474\">https://doi.org/10.1002/ece3.2474</a>.","ista":"Metzler S, Heinze J, Schrempf A. 2016. Mating and longevity in ant males. Ecology and Evolution. 6(24), 8903–8906.","mla":"Metzler, Sina, et al. “Mating and Longevity in Ant Males.” <i>Ecology and Evolution</i>, vol. 6, no. 24, Wiley-Blackwell, 2016, pp. 8903–06, doi:<a href=\"https://doi.org/10.1002/ece3.2474\">10.1002/ece3.2474</a>.","short":"S. Metzler, J. Heinze, A. Schrempf, Ecology and Evolution 6 (2016) 8903–8906.","apa":"Metzler, S., Heinze, J., &#38; Schrempf, A. (2016). Mating and longevity in ant males. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.2474\">https://doi.org/10.1002/ece3.2474</a>","ieee":"S. Metzler, J. Heinze, and A. Schrempf, “Mating and longevity in ant males,” <i>Ecology and Evolution</i>, vol. 6, no. 24. Wiley-Blackwell, pp. 8903–8906, 2016."},"type":"journal_article","author":[{"last_name":"Metzler","full_name":"Metzler, Sina","first_name":"Sina","id":"48204546-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"},{"first_name":"Alexandra","full_name":"Schrempf, Alexandra","last_name":"Schrempf"}],"year":"2016","department":[{"_id":"SyCr"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Wiley-Blackwell","day":"01","doi":"10.1002/ece3.2474","oa_version":"Published Version","acknowledgement":"German Science Foundation. Grant Number: SCHR 1135/2-1. We thank M. Adam for handling part of the setups and J. Zoellner for behavioral observations.","issue":"24","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"         6","oa":1,"volume":6,"scopus_import":1,"date_published":"2016-12-01T00:00:00Z","title":"Mating and longevity in ant males","date_updated":"2021-01-12T06:48:55Z","month":"12","_id":"1184","date_created":"2018-12-11T11:50:36Z","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"736","publication":"Ecology and Evolution","page":"8903 - 8906"},{"quality_controlled":"1","intvolume":"       143","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"M.C. was funded by a PhD fellowship from the Università degli Studi di Milano-Bicocca and from Ministero dell'Istruzione, dell'Università e della Ricerca (MIUR) [MIUR-PRIN 2012]. L.C. is also supported by MIUR [MIUR-PRIN 2012]. We would like to thank Andrew MacCabe and Edward Kiegle for editing the paper.","issue":"23","publist_id":"6168","volume":143,"publication_status":"published","abstract":[{"text":"The developmental programme of the pistil is under the control of both auxin and cytokinin. Crosstalk between these factors converges on regulation of the auxin carrier PIN-FORMED 1 (PIN1). Here, we show that in the triple transcription factor mutant cytokinin response factor 2 (crf2) crf3 crf6 both pistil length and ovule number were reduced. PIN1 expression was also lower in the triple mutant and the phenotypes could not be rescued by exogenous cytokinin application. pin1 complementation studies using genomic PIN1 constructs showed that the pistil phenotypes were only rescued when the PCRE1 domain, to which CRFs bind, was present. Without this domain, pin mutants resemble the crf2 crf3 crf6 triple mutant, indicating the pivotal role of CRFs in auxin-cytokinin crosstalk.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"type":"journal_article","scopus_import":1,"citation":{"mla":"Cucinotta, Mara, et al. “Cytokinin Response Factors Integrate Auxin and Cytokinin Pathways for Female Reproductive Organ Development.” <i>Development</i>, vol. 143, no. 23, Company of Biologists, 2016, pp. 4419–24, doi:<a href=\"https://doi.org/10.1242/dev.143545\">10.1242/dev.143545</a>.","ista":"Cucinotta M, Manrique S, Guazzotti A, Quadrelli N, Mendes M, Benková E, Colombo L. 2016. Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. Development. 143(23), 4419–4424.","ama":"Cucinotta M, Manrique S, Guazzotti A, et al. Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. <i>Development</i>. 2016;143(23):4419-4424. doi:<a href=\"https://doi.org/10.1242/dev.143545\">10.1242/dev.143545</a>","chicago":"Cucinotta, Mara, Silvia Manrique, Andrea Guazzotti, Nadia Quadrelli, Marta Mendes, Eva Benková, and Lucia Colombo. “Cytokinin Response Factors Integrate Auxin and Cytokinin Pathways for Female Reproductive Organ Development.” <i>Development</i>. Company of Biologists, 2016. <a href=\"https://doi.org/10.1242/dev.143545\">https://doi.org/10.1242/dev.143545</a>.","ieee":"M. Cucinotta <i>et al.</i>, “Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development,” <i>Development</i>, vol. 143, no. 23. Company of Biologists, pp. 4419–4424, 2016.","apa":"Cucinotta, M., Manrique, S., Guazzotti, A., Quadrelli, N., Mendes, M., Benková, E., &#38; Colombo, L. (2016). Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.143545\">https://doi.org/10.1242/dev.143545</a>","short":"M. Cucinotta, S. Manrique, A. Guazzotti, N. Quadrelli, M. Mendes, E. Benková, L. Colombo, Development 143 (2016) 4419–4424."},"year":"2016","date_published":"2016-12-01T00:00:00Z","author":[{"full_name":"Cucinotta, Mara","last_name":"Cucinotta","first_name":"Mara"},{"last_name":"Manrique","full_name":"Manrique, Silvia","first_name":"Silvia"},{"full_name":"Guazzotti, Andrea","last_name":"Guazzotti","first_name":"Andrea"},{"first_name":"Nadia","last_name":"Quadrelli","full_name":"Quadrelli, Nadia"},{"last_name":"Mendes","full_name":"Mendes, Marta","first_name":"Marta"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková"},{"first_name":"Lucia","last_name":"Colombo","full_name":"Colombo, Lucia"}],"department":[{"_id":"EvBe"}],"date_updated":"2021-01-12T06:48:56Z","title":"Cytokinin response factors integrate auxin and cytokinin pathways for female reproductive organ development","month":"12","_id":"1185","publisher":"Company of Biologists","day":"01","date_created":"2018-12-11T11:50:36Z","publication":"Development","doi":"10.1242/dev.143545","page":"4419 - 4424","oa_version":"None"},{"ddc":["576","610"],"type":"journal_article","citation":{"ama":"Gutierrez-Fernandez J, Saleh M, Alcorlo M, et al. Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. <i>Scientific Reports</i>. 2016;6. doi:<a href=\"https://doi.org/10.1038/srep38094\">10.1038/srep38094</a>","chicago":"Gutierrez-Fernandez, Javier, Malek Saleh, Martín Alcorlo, Alejandro Gómez Mejóa, David Pantoja Uceda, Miguel Treviño, Franziska Vob, et al. “Modular Architecture and Unique Teichoic Acid Recognition Features of Choline-Binding Protein L CbpL Contributing to Pneumococcal Pathogenesis.” <i>Scientific Reports</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/srep38094\">https://doi.org/10.1038/srep38094</a>.","mla":"Gutierrez-Fernandez, Javier, et al. “Modular Architecture and Unique Teichoic Acid Recognition Features of Choline-Binding Protein L CbpL Contributing to Pneumococcal Pathogenesis.” <i>Scientific Reports</i>, vol. 6, 38094, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/srep38094\">10.1038/srep38094</a>.","ista":"Gutierrez-Fernandez J, Saleh M, Alcorlo M, Gómez Mejóa A, Pantoja Uceda D, Treviño M, Vob F, Abdullah M, Galán Bartual S, Seinen J, Sánchez Murcia P, Gago F, Bruix M, Hammerschmidt S, Hermoso J. 2016. Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. Scientific Reports. 6, 38094.","apa":"Gutierrez-Fernandez, J., Saleh, M., Alcorlo, M., Gómez Mejóa, A., Pantoja Uceda, D., Treviño, M., … Hermoso, J. (2016). Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep38094\">https://doi.org/10.1038/srep38094</a>","short":"J. Gutierrez-Fernandez, M. Saleh, M. Alcorlo, A. Gómez Mejóa, D. Pantoja Uceda, M. Treviño, F. Vob, M. Abdullah, S. Galán Bartual, J. Seinen, P. Sánchez Murcia, F. Gago, M. Bruix, S. Hammerschmidt, J. Hermoso, Scientific Reports 6 (2016).","ieee":"J. Gutierrez-Fernandez <i>et al.</i>, “Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis,” <i>Scientific Reports</i>, vol. 6. Nature Publishing Group, 2016."},"file":[{"file_id":"4804","date_created":"2018-12-12T10:10:18Z","creator":"system","date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","file_size":2716045,"checksum":"e007d78b483bc59bf5ab98e9d42a6ec1","relation":"main_file","access_level":"open_access","file_name":"IST-2017-735-v1+1_srep38094.pdf"}],"quality_controlled":"1","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"publist_id":"6167","abstract":[{"lang":"eng","text":"The human pathogen Streptococcus pneumoniae is decorated with a special class of surface-proteins known as choline-binding proteins (CBPs) attached to phosphorylcholine (PCho) moieties from cell-wall teichoic acids. By a combination of X-ray crystallography, NMR, molecular dynamics techniques and in vivo virulence and phagocytosis studies, we provide structural information of choline-binding protein L (CbpL) and demonstrate its impact on pneumococcal pathogenesis and immune evasion. CbpL is a very elongated three-module protein composed of (i) an Excalibur Ca 2+ -binding domain -reported in this work for the very first time-, (ii) an unprecedented anchorage module showing alternate disposition of canonical and non-canonical choline-binding sites that allows vine-like binding of fully-PCho-substituted teichoic acids (with two choline moieties per unit), and (iii) a Ltp-Lipoprotein domain. Our structural and infection assays indicate an important role of the whole multimodular protein allowing both to locate CbpL at specific places on the cell wall and to interact with host components in order to facilitate pneumococcal lung infection and transmigration from nasopharynx to the lungs and blood. CbpL implication in both resistance against killing by phagocytes and pneumococcal pathogenesis further postulate this surface-protein as relevant among the pathogenic arsenal of the pneumococcus."}],"publication_status":"published","day":"05","publisher":"Nature Publishing Group","oa_version":"Published Version","doi":"10.1038/srep38094","year":"2016","author":[{"id":"3D9511BA-F248-11E8-B48F-1D18A9856A87","first_name":"Javier","full_name":"Gutierrez-Fernandez, Javier","last_name":"Gutierrez-Fernandez"},{"last_name":"Saleh","full_name":"Saleh, Malek","first_name":"Malek"},{"first_name":"Martín","full_name":"Alcorlo, Martín","last_name":"Alcorlo"},{"last_name":"Gómez Mejóa","full_name":"Gómez Mejóa, Alejandro","first_name":"Alejandro"},{"last_name":"Pantoja Uceda","full_name":"Pantoja Uceda, David","first_name":"David"},{"last_name":"Treviño","full_name":"Treviño, Miguel","first_name":"Miguel"},{"full_name":"Vob, Franziska","last_name":"Vob","first_name":"Franziska"},{"first_name":"Mohammed","last_name":"Abdullah","full_name":"Abdullah, Mohammed"},{"last_name":"Galán Bartual","full_name":"Galán Bartual, Sergio","first_name":"Sergio"},{"first_name":"Jolien","full_name":"Seinen, Jolien","last_name":"Seinen"},{"first_name":"Pedro","last_name":"Sánchez Murcia","full_name":"Sánchez Murcia, Pedro"},{"last_name":"Gago","full_name":"Gago, Federico","first_name":"Federico"},{"first_name":"Marta","last_name":"Bruix","full_name":"Bruix, Marta"},{"last_name":"Hammerschmidt","full_name":"Hammerschmidt, Sven","first_name":"Sven"},{"first_name":"Juan","full_name":"Hermoso, Juan","last_name":"Hermoso"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"LeSa"}],"scopus_import":1,"intvolume":"         6","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We gratefully acknowledge Karsta Barnekow and Kristine Sievert-Giermann, for technical assistance and Lothar Petruschka for in silico analysis (all Dept. of Genetics, University of Greifswald). We are further grateful to the staff from SLS synchrotron beamline for help in data collection. This work was supported by grants from the Deutsche Forschungsgemeinschaft DFG GRK 1870 (to SH) and the Spanish Ministry of Economy and Competitiveness (BFU2014-59389-P to JAH, CTQ2014-52633-P to MB and SAF2012-39760-C02-02 to FG) and S2010/BMD-2457 (Community of Madrid to JAH and FG).","article_number":"38094","volume":6,"date_created":"2018-12-11T11:50:36Z","_id":"1186","publication":"Scientific Reports","file_date_updated":"2020-07-14T12:44:37Z","pubrep_id":"735","date_published":"2016-12-05T00:00:00Z","month":"12","title":"Modular architecture and unique teichoic acid recognition features of choline-binding protein L CbpL contributing to pneumococcal pathogenesis","date_updated":"2021-01-12T06:48:56Z"},{"article_number":"123502","issue":"12","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"D De Martino is supported by the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007–2013) under REA grant agreement no. [291734]. D Masoero is supported by the FCT scholarship, number SFRH/BPD/75908/2011. D De Martino thanks the Grupo de Física Matemática of the Universidade de Lisboa for the kind hospitality. We also wish to thank Matteo Osella, Vincenzo Vitagliano and Vera Luz Masoero for useful discussions, also late at night.","intvolume":"      2016","oa":1,"volume":2016,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.09048"}],"scopus_import":1,"date_published":"2016-12-30T00:00:00Z","ec_funded":1,"date_updated":"2021-01-12T06:48:57Z","title":"Asymptotic analysis of noisy fitness maximization, applied to metabolism &amp; growth","month":"12","_id":"1188","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"date_created":"2018-12-11T11:50:37Z","publication":" Journal of Statistical Mechanics: Theory and Experiment","quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We consider a population dynamics model coupling cell growth to a diffusion in the space of metabolic phenotypes as it can be obtained from realistic constraints-based modelling. \r\nIn the asymptotic regime of slow\r\ndiffusion, that coincides with the relevant experimental range, the resulting\r\nnon-linear Fokker–Planck equation is solved for the steady state in the WKB\r\napproximation that maps it into the ground state of a quantum particle in an\r\nAiry potential plus a centrifugal term. We retrieve scaling laws for growth rate\r\nfluctuations and time response with respect to the distance from the maximum\r\ngrowth rate suggesting that suboptimal populations can have a faster response\r\nto perturbations."}],"publist_id":"6165","language":[{"iso":"eng"}],"status":"public","citation":{"ieee":"D. De Martino and D. Masoero, “Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth,” <i> Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2016, no. 12. IOPscience, 2016.","short":"D. De Martino, D. Masoero,  Journal of Statistical Mechanics: Theory and Experiment 2016 (2016).","apa":"De Martino, D., &#38; Masoero, D. (2016). Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth. <i> Journal of Statistical Mechanics: Theory and Experiment</i>. IOPscience. <a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">https://doi.org/10.1088/1742-5468/aa4e8f</a>","mla":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &#38;amp; Growth.” <i> Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2016, no. 12, 123502, IOPscience, 2016, doi:<a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">10.1088/1742-5468/aa4e8f</a>.","ista":"De Martino D, Masoero D. 2016. Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth.  Journal of Statistical Mechanics: Theory and Experiment. 2016(12), 123502.","ama":"De Martino D, Masoero D. Asymptotic analysis of noisy fitness maximization, applied to metabolism &#38;amp; growth. <i> Journal of Statistical Mechanics: Theory and Experiment</i>. 2016;2016(12). doi:<a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">10.1088/1742-5468/aa4e8f</a>","chicago":"De Martino, Daniele, and Davide Masoero. “Asymptotic Analysis of Noisy Fitness Maximization, Applied to Metabolism &#38;amp; Growth.” <i> Journal of Statistical Mechanics: Theory and Experiment</i>. IOPscience, 2016. <a href=\"https://doi.org/10.1088/1742-5468/aa4e8f\">https://doi.org/10.1088/1742-5468/aa4e8f</a>."},"type":"journal_article","author":[{"id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","last_name":"De Martino","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706"},{"first_name":"Davide","full_name":"Masoero, Davide","last_name":"Masoero"}],"year":"2016","department":[{"_id":"GaTk"}],"publisher":"IOPscience","day":"30","doi":"10.1088/1742-5468/aa4e8f","oa_version":"Preprint"},{"scopus_import":1,"volume":"2016-December","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547v7"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"5975"}]},"article_number":"7782993","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160","oa":1,"publication":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7"}],"_id":"1193","date_created":"2018-12-11T11:50:38Z","external_id":{"arxiv":["1506.08547"]},"date_updated":"2023-09-19T14:24:57Z","title":"Commutativity in the algorithmic Lovasz local lemma","month":"12","date_published":"2016-12-15T00:00:00Z","article_processing_charge":"No","ec_funded":1,"type":"conference","citation":{"mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2016–December, 7782993, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>.","ista":"Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2016-December. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, Vol. 2016–December. IEEE, 2016. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>.","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, New Brunswick, NJ, USA , 2016, vol. 2016–December.","short":"V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.","apa":"Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid &quot;bad features&quot;, or &quot;flaws&quot;. It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and &quot;resamples&quot; it using a &quot;resampling oracle&quot; provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new &quot;commutativity&quot; condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately."}],"publist_id":"6158","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","doi":"10.1109/FOCS.2016.88","oa_version":"Preprint","arxiv":1,"publisher":"IEEE","day":"15","department":[{"_id":"VlKo"}],"author":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"conference":{"start_date":"2016-09-09","location":"New Brunswick, NJ, USA ","end_date":"2016-09-11","name":"FOCS: Foundations of Computer Science"},"year":"2016"},{"scopus_import":1,"volume":34,"oa":1,"intvolume":"        34","acknowledgement":"The authors thank all members of the Institute of Population\r\nGenetics for discussion and support on the project and par-\r\nticularly N. Barghi for helpful comments on earlier versions of\r\nthe  manuscript.  This  work  was  supported  by  the  European\r\nResearch Council (ERC) grants “ArchAdapt” and “250152”.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"1","page":"174 - 184","publication":"Molecular Biology and Evolution","pubrep_id":"770","file_date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-11T11:50:39Z","_id":"1195","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"month":"10","date_updated":"2021-01-12T06:49:00Z","title":"Reconstruction of haplotype-blocks selected during experimental evolution.","ec_funded":1,"date_published":"2016-10-03T00:00:00Z","type":"journal_article","citation":{"ista":"Franssen S, Barton NH, Schlötterer C. 2016. Reconstruction of haplotype-blocks selected during experimental evolution. Molecular Biology and Evolution. 34(1), 174–184.","mla":"Franssen, Susan, et al. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” <i>Molecular Biology and Evolution</i>, vol. 34, no. 1, Oxford University Press, 2016, pp. 174–84, doi:<a href=\"https://doi.org/10.1093/molbev/msw210\">10.1093/molbev/msw210</a>.","chicago":"Franssen, Susan, Nicholas H Barton, and Christian Schlötterer. “Reconstruction of Haplotype-Blocks Selected during Experimental Evolution.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/molbev/msw210\">https://doi.org/10.1093/molbev/msw210</a>.","ama":"Franssen S, Barton NH, Schlötterer C. Reconstruction of haplotype-blocks selected during experimental evolution. <i>Molecular Biology and Evolution</i>. 2016;34(1):174-184. doi:<a href=\"https://doi.org/10.1093/molbev/msw210\">10.1093/molbev/msw210</a>","ieee":"S. Franssen, N. H. Barton, and C. Schlötterer, “Reconstruction of haplotype-blocks selected during experimental evolution.,” <i>Molecular Biology and Evolution</i>, vol. 34, no. 1. Oxford University Press, pp. 174–184, 2016.","short":"S. Franssen, N.H. Barton, C. Schlötterer, Molecular Biology and Evolution 34 (2016) 174–184.","apa":"Franssen, S., Barton, N. H., &#38; Schlötterer, C. (2016). Reconstruction of haplotype-blocks selected during experimental evolution. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msw210\">https://doi.org/10.1093/molbev/msw210</a>"},"file":[{"date_created":"2018-12-12T10:16:35Z","creator":"system","file_id":"5223","access_level":"open_access","file_name":"IST-2017-770-v1+1_FranssenEtAl_nofigs-1.pdf","file_size":295274,"date_updated":"2020-07-14T12:44:38Z","content_type":"application/pdf","checksum":"1e78d3aaffcb40dc8b02b7b4666019e0","relation":"main_file"},{"file_id":"5224","creator":"system","date_created":"2018-12-12T10:16:36Z","date_updated":"2020-07-14T12:44:38Z","content_type":"application/pdf","file_size":10902625,"checksum":"e13171843283774404c936c581b4543e","relation":"main_file","access_level":"open_access","file_name":"IST-2017-770-v1+2_Fig1.pdf"},{"date_created":"2018-12-12T10:16:37Z","creator":"system","file_id":"5225","access_level":"open_access","file_name":"IST-2017-770-v1+3_Fig2.pdf","file_size":21437,"date_updated":"2020-07-14T12:44:38Z","content_type":"application/pdf","relation":"main_file","checksum":"63bc6e6e61f347594d8c00c37f874a0b"},{"file_id":"5226","date_created":"2018-12-12T10:16:38Z","creator":"system","checksum":"da87cc7c78808837f22a3dae1c8397f9","relation":"main_file","file_size":1172194,"date_updated":"2020-07-14T12:44:38Z","content_type":"application/pdf","file_name":"IST-2017-770-v1+4_Fig3.pdf","access_level":"open_access"},{"checksum":"e47b2a0c32142f423b3100150c0294f8","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:44:38Z","file_size":50045,"file_name":"IST-2017-770-v1+5_Fig4.pdf","access_level":"open_access","file_id":"5227","creator":"system","date_created":"2018-12-12T10:16:38Z"},{"relation":"main_file","checksum":"a5a7d6b32e7e17d35d337d7ec2a9f6c9","content_type":"application/pdf","date_updated":"2020-07-14T12:44:38Z","file_size":50705,"file_name":"IST-2017-770-v1+6_Fig5.pdf","access_level":"open_access","file_id":"5228","creator":"system","date_created":"2018-12-12T10:16:39Z"}],"ddc":["576"],"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"6155","abstract":[{"lang":"eng","text":"The genetic analysis of experimentally evolving populations typically relies on short reads from pooled individuals (Pool-Seq). While this method provides reliable allele frequency estimates, the underlying haplotype structure remains poorly characterized. With small population sizes and adaptive variants that start from low frequencies, the interpretation of selection signatures in most Evolve and Resequencing studies remains challenging. To facilitate the characterization of selection targets, we propose a new approach that reconstructs selected haplotypes from replicated time series, using Pool-Seq data. We identify selected haplotypes through the correlated frequencies of alleles carried by them. Computer simulations indicate that selected haplotype-blocks of several Mb can be reconstructed with high confidence and low error rates, even when allele frequencies change only by 20% across three replicates. Applying this method to real data from D. melanogaster populations adapting to a hot environment, we identify a selected haplotype-block of 6.93 Mb. We confirm the presence of this haplotype-block in evolved populations by experimental haplotyping, demonstrating the power and accuracy of our haplotype reconstruction from Pool-Seq data. We propose that the combination of allele frequency estimates with haplotype information will provide the key to understanding the dynamics of adaptive alleles. "}],"publication_status":"published","quality_controlled":"1","oa_version":"Submitted Version","doi":"10.1093/molbev/msw210","day":"03","publisher":"Oxford University Press","department":[{"_id":"NiBa"}],"year":"2016","author":[{"first_name":"Susan","last_name":"Franssen","full_name":"Franssen, Susan"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Schlötterer, Christian","last_name":"Schlötterer","first_name":"Christian"}]},{"year":"2016","author":[{"first_name":"Jason","full_name":"Prentice, Jason","last_name":"Prentice"},{"first_name":"Olivier","last_name":"Marre","full_name":"Marre, Olivier"},{"first_name":"Mark","full_name":"Ioffe, Mark","last_name":"Ioffe"},{"first_name":"Adrianna","full_name":"Loback, Adrianna","last_name":"Loback"},{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"GaTk"}],"day":"17","publisher":"Public Library of Science","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1005148","quality_controlled":"1","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"6153","publication_status":"published","abstract":[{"lang":"eng","text":"Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina."}],"ddc":["570"],"type":"journal_article","citation":{"ieee":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Error-robust modes of the retinal population code,” <i>PLoS Computational Biology</i>, vol. 12, no. 11. Public Library of Science, 2016.","apa":"Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., &#38; Berry, M. (2016). Error-robust modes of the retinal population code. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">https://doi.org/10.1371/journal.pcbi.1005148</a>","short":"J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, PLoS Computational Biology 12 (2016).","mla":"Prentice, Jason, et al. “Error-Robust Modes of the Retinal Population Code.” <i>PLoS Computational Biology</i>, vol. 12, no. 11, e1005855, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">10.1371/journal.pcbi.1005148</a>.","ista":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2016. Error-robust modes of the retinal population code. PLoS Computational Biology. 12(11), e1005855.","ama":"Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Error-robust modes of the retinal population code. <i>PLoS Computational Biology</i>. 2016;12(11). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">10.1371/journal.pcbi.1005148</a>","chicago":"Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik, and Michael Berry. “Error-Robust Modes of the Retinal Population Code.” <i>PLoS Computational Biology</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pcbi.1005148\">https://doi.org/10.1371/journal.pcbi.1005148</a>."},"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:38Z","file_size":4492021,"checksum":"47b08cbd4dbf32b25ba161f5f4b262cc","relation":"main_file","access_level":"open_access","file_name":"2016_PLOS_Prentice.pdf","file_id":"5884","creator":"kschuh","date_created":"2019-01-25T10:35:00Z"}],"date_published":"2016-11-17T00:00:00Z","month":"11","date_updated":"2023-02-23T14:05:40Z","title":"Error-robust modes of the retinal population code","date_created":"2018-12-11T11:50:40Z","project":[{"name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"_id":"1197","publication":"PLoS Computational Biology","file_date_updated":"2020-07-14T12:44:38Z","oa":1,"intvolume":"        12","acknowledgement":"JSP was supported by a C.V. Starr Fellowship from the Starr Foundation (http://www.starrfoundation.org/). GT was supported by Austrian Research Foundation (https://www.fwf.ac.at/en/) grant FWF P25651. MJB received support from National Eye Institute (https://nei.nih.gov/) grant EY 14196 and from the National Science Foundation grant 1504977. The authors thank Cristina Savin and Vicent Botella-Soler for helpful comments on the manuscript.","issue":"11","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_number":"e1005855","related_material":{"record":[{"relation":"research_data","status":"public","id":"9709"}]},"volume":12,"scopus_import":1},{"volume":19,"oa":1,"intvolume":"        19","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"C.H. acknowledges generous support from the ISTFELLOW program.","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","scopus_import":1,"date_updated":"2021-01-12T06:49:03Z","title":"Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze","month":"12","date_published":"2016-12-01T00:00:00Z","ec_funded":1,"publication":"Physics of Life Reviews","pubrep_id":"798","file_date_updated":"2020-07-14T12:44:39Z","page":"29 - 31","_id":"1200","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"date_created":"2018-12-11T11:50:40Z","publist_id":"6150","publication_status":"published","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"quality_controlled":"1","file":[{"access_level":"open_access","file_name":"IST-2017-798-v1+1_comment_adami.pdf","date_updated":"2020-07-14T12:44:39Z","content_type":"application/pdf","file_size":171352,"relation":"main_file","checksum":"95e6dc78278334b99dacbf8822509364","creator":"system","date_created":"2018-12-12T10:11:02Z","file_id":"4855"}],"type":"journal_article","citation":{"mla":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” <i>Physics of Life Reviews</i>, vol. 19, Elsevier, 2016, pp. 29–31, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>.","ista":"Hilbe C, Traulsen A. 2016. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. Physics of Life Reviews. 19, 29–31.","chicago":"Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>.","ama":"Hilbe C, Traulsen A. Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. <i>Physics of Life Reviews</i>. 2016;19:29-31. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>","ieee":"C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” <i>Physics of Life Reviews</i>, vol. 19. Elsevier, pp. 29–31, 2016.","apa":"Hilbe, C., &#38; Traulsen, A. (2016). Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on “Evolutionary game theory using agent-based methods” by C. Adami, J. Schossau and A. Hintze. <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>","short":"C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31."},"ddc":["530"],"department":[{"_id":"KrCh"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"year":"2016","author":[{"first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe"},{"first_name":"Arne","full_name":"Traulsen, Arne","last_name":"Traulsen"}],"doi":"10.1016/j.plrev.2016.10.004","oa_version":"Submitted Version","publisher":"Elsevier","day":"01"}]