[{"alternative_title":["LNCS"],"publisher":"Springer","arxiv":1,"oa":1,"day":"13","month":"07","author":[{"first_name":"Pranav","last_name":"Ashok","full_name":"Ashok, Pranav"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"},{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"}],"doi":"10.1007/978-3-319-63387-9_10","oa_version":"Submitted Version","scopus_import":"1","volume":10426,"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"quality_controlled":"1","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"status":"public","conference":{"location":"Heidelberg, Germany","end_date":"2017-07-28","name":"CAV: Computer Aided Verification","start_date":"2017-07-24"},"department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000432196400010"],"arxiv":["1705.02326"]},"editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"publication_identifier":{"isbn":["978-331963386-2"]},"title":"Value iteration for long run average reward in markov decision processes","type":"conference","date_updated":"2025-09-11T07:18:04Z","intvolume":"     10426","isi":1,"publication_status":"published","language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &#38; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>","mla":"Ashok, Pranav, et al. <i>Value Iteration for Long Run Average Reward in Markov Decision Processes</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>.","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221."},"year":"2017","date_created":"2018-12-11T11:47:41Z","date_published":"2017-07-13T00:00:00Z","publist_id":"7135","_id":"645","page":"201 - 221"},{"alternative_title":["LNCS"],"publisher":"Springer","arxiv":1,"oa":1,"day":"01","month":"06","doi":"10.1007/978-3-319-58771-4_19","author":[{"full_name":"Kuske, Jan","first_name":"Jan","last_name":"Kuske"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"full_name":"Petra, Stefanie","last_name":"Petra","first_name":"Stefanie"}],"oa_version":"Submitted Version","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","volume":10302,"quality_controlled":"1","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}],"abstract":[{"text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.","lang":"eng"}],"conference":{"name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04","location":"Kolding, Denmark","end_date":"2017-06-08"},"status":"public","department":[{"_id":"VlKo"}],"external_id":{"arxiv":["1703.03769"],"isi":["000432210900019"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","editor":[{"full_name":"Lauze, François","last_name":"Lauze","first_name":"François"},{"full_name":"Dong, Yiqiu","last_name":"Dong","first_name":"Yiqiu"},{"first_name":"Anders","last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders"}],"publication_identifier":{"isbn":["978-331958770-7"]},"title":"A novel convex relaxation for non binary discrete tomography","date_updated":"2025-09-11T07:16:00Z","intvolume":"     10302","type":"conference","isi":1,"citation":{"ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","mla":"Kuske, Jan, et al. <i>A Novel Convex Relaxation for Non Binary Discrete Tomography</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>.","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>.","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>","apa":"Kuske, J., Swoboda, P., &#38; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>"},"language":[{"iso":"eng"}],"article_processing_charge":"No","publication_status":"published","date_published":"2017-06-01T00:00:00Z","publist_id":"7132","date_created":"2018-12-11T11:47:41Z","year":"2017","_id":"646","page":"235 - 246"},{"status":"public","conference":{"name":"TAMC: Theory and Applications of Models of Computation","start_date":"2017-04-20","end_date":"2017-04-22","location":"Bern, Switzerland"},"abstract":[{"text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method.","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2016/1186.pdf","open_access":"1"}],"quality_controlled":"1","oa_version":"Submitted Version","corr_author":"1","scopus_import":"1","volume":10185,"month":"04","author":[{"last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","full_name":"Skórski, Maciej"}],"doi":"10.1007/978-3-319-55911-7_43","oa":1,"day":"01","alternative_title":["LNCS"],"publisher":"Springer","_id":"648","page":"600 - 613","publication_status":"published","citation":{"ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>.","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &#38; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>","ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","mla":"Skórski, Maciej. <i>On the Complexity of Breaking Pseudoentropy</i>. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>.","ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613."},"language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T11:47:42Z","year":"2017","publist_id":"7125","date_published":"2017-04-01T00:00:00Z","type":"conference","date_updated":"2025-09-11T07:14:42Z","intvolume":"     10185","isi":1,"title":"On the complexity of breaking pseudoentropy","publication_identifier":{"isbn":["978-331955910-0"]},"editor":[{"full_name":"Jäger, Gerhard","last_name":"Jäger","first_name":"Gerhard"},{"last_name":"Steila","first_name":"Silvia","full_name":"Steila, Silvia"}],"department":[{"_id":"KrPi"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000425175500043"]}},{"volume":541,"scopus_import":"1","corr_author":"1","oa_version":"None","author":[{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754"}],"doi":"10.1038/541161a","month":"01","day":"11","publication":"Nature","publisher":"Nature Publishing Group","status":"public","abstract":[{"text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n","lang":"eng"}],"quality_controlled":"1","title":"Fluid dynamics: Water flows out of touch","publication_identifier":{"issn":["0028-0836"]},"issue":"7636","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000396125500023"]},"department":[{"_id":"BjHo"}],"page":"161 - 162","_id":"651","year":"2017","date_created":"2018-12-11T11:47:43Z","date_published":"2017-01-11T00:00:00Z","publist_id":"7116","publication_status":"published","language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"ama":"Hof B. Fluid dynamics: Water flows out of touch. <i>Nature</i>. 2017;541(7636):161-162. doi:<a href=\"https://doi.org/10.1038/541161a\">10.1038/541161a</a>","chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” <i>Nature</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/541161a\">https://doi.org/10.1038/541161a</a>.","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/541161a\">https://doi.org/10.1038/541161a</a>","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” <i>Nature</i>, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:<a href=\"https://doi.org/10.1038/541161a\">10.1038/541161a</a>.","short":"B. Hof, Nature 541 (2017) 161–162.","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” <i>Nature</i>, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017."},"isi":1,"type":"journal_article","date_updated":"2025-09-11T07:13:33Z","intvolume":"       541"},{"publication_status":"published","language":[{"iso":"eng"}],"citation":{"short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","mla":"Fulek, Radoslav. <i>Embedding Graphs into Embedded Graphs</i>. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">10.4230/LIPICS.ISAAC.2017.34</a>.","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">https://doi.org/10.4230/LIPICS.ISAAC.2017.34</a>","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">https://doi.org/10.4230/LIPICS.ISAAC.2017.34</a>.","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">10.4230/LIPICS.ISAAC.2017.34</a>"},"date_created":"2019-06-04T12:11:52Z","year":"2017","date_published":"2017-12-01T00:00:00Z","type":"conference","date_updated":"2024-10-09T20:58:52Z","intvolume":"        92","_id":"6517","file":[{"date_updated":"2020-07-14T12:47:33Z","checksum":"fc7a643e29621c8bbe49d36b39081f31","date_created":"2019-06-04T12:20:35Z","file_id":"6518","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":588982,"relation":"main_file","file_name":"2017_LIPIcs-Fulek.pdf"}],"file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"UlWa"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Embedding graphs into embedded graphs","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"quality_controlled":"1","ddc":["510"],"status":"public","conference":{"end_date":"2017-12-22","location":"Phuket, Thailand","name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2017-12-09"},"article_number":"34","abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","corr_author":"1","scopus_import":1,"volume":92,"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"M02281","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"12","author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"}],"doi":"10.4230/LIPICS.ISAAC.2017.34"},{"publication_status":"published","article_processing_charge":"No","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">https://doi.org/10.4230/LIPICS.CSL.2017.18</a>.","ama":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">10.4230/LIPICS.CSL.2017.18</a>","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">https://doi.org/10.4230/LIPICS.CSL.2017.18</a>","ista":"Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Set-Based Symbolic Algorithms for Parity Games</i>. Vol. 82, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">10.4230/LIPICS.CSL.2017.18</a>.","short":"K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82."},"year":"2017","date_created":"2019-06-04T12:42:43Z","date_published":"2017-08-01T00:00:00Z","type":"conference","date_updated":"2025-05-14T10:53:47Z","intvolume":"        82","_id":"6519","file":[{"creator":"kschuh","access_level":"open_access","content_type":"application/pdf","file_size":710185,"file_name":"2017_LIPIcs-Chatterjee.pdf","relation":"main_file","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:56:52Z","checksum":"7c2c9d09970af79026d7e37d9b632ef8","file_id":"6520"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Improved set-based symbolic algorithms for parity games","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"has_accepted_license":"1","ec_funded":1,"quality_controlled":"1","ddc":["004"],"status":"public","conference":{"end_date":"2017-08-24","location":"Stockholm, Sweden","start_date":"2017-08-20","name":"CSL: Conference on Computer Science Logic"},"article_number":"18","abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"oa":1,"day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","scopus_import":"1","volume":82,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"month":"08","doi":"10.4230/LIPICS.CSL.2017.18","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}]},{"_id":"652","status":"public","conference":{"end_date":"2016-09-22","location":"Cergy-Pontoise, France","start_date":"2016-09-19","name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics "},"abstract":[{"text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed.","lang":"eng"}],"article_number":"7846789","publication_status":"published","language":[{"iso":"eng"}],"citation":{"ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. <a href=\"https://doi.org/10.1109/DEVLRN.2016.7846789\">https://doi.org/10.1109/DEVLRN.2016.7846789</a>.","ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/DEVLRN.2016.7846789\">10.1109/DEVLRN.2016.7846789</a>","apa":"Der, R., &#38; Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. <a href=\"https://doi.org/10.1109/DEVLRN.2016.7846789\">https://doi.org/10.1109/DEVLRN.2016.7846789</a>","ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","mla":"Der, Ralf, and Georg S. Martius. <i>Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots</i>. 7846789, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/DEVLRN.2016.7846789\">10.1109/DEVLRN.2016.7846789</a>."},"date_created":"2018-12-11T11:47:43Z","year":"2017","date_published":"2017-02-07T00:00:00Z","publist_id":"7100","type":"conference","quality_controlled":"1","date_updated":"2021-01-12T08:07:51Z","title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","oa_version":"None","scopus_import":1,"publication_identifier":{"isbn":["978-150905069-7"]},"month":"02","doi":"10.1109/DEVLRN.2016.7846789","author":[{"full_name":"Der, Ralf","first_name":"Ralf","last_name":"Der"},{"full_name":"Martius, Georg S","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius"}],"day":"07","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE"},{"_id":"6526","type":"conference","date_updated":"2021-01-12T08:07:53Z","date_created":"2019-06-06T12:53:09Z","year":"2017","date_published":"2017-08-09T00:00:00Z","publication_status":"published","language":[{"iso":"eng"}],"citation":{"ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, Aachen, Germany, 2017.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, 8006529, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>.","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>.","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>"},"publication_identifier":{"isbn":["9781509040964"]},"title":"On the complexity of estimating Rènyi divergences","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1702.01666"]},"department":[{"_id":"KrPi"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}],"article_number":"8006529","status":"public","conference":{"location":"Aachen, Germany","end_date":"2017-06-30","start_date":"2017-06-25","name":"ISIT: International Symposium on Information Theory"},"quality_controlled":"1","ec_funded":1,"author":[{"full_name":"Skórski, Maciej","last_name":"Skórski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"doi":"10.1109/isit.2017.8006529","month":"08","scopus_import":1,"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"oa_version":"Preprint","publisher":"IEEE","day":"09","oa":1,"publication":"2017 IEEE International Symposium on Information Theory (ISIT)","arxiv":1},{"oa_version":"Submitted Version","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"scopus_import":"1","month":"10","doi":"10.1145/3133956.3134031","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"full_name":"Harsha, Ben","first_name":"Ben","last_name":"Harsha"}],"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","oa":1,"day":"30","publisher":"ACM","conference":{"end_date":"2017-11-03","location":"Dallas, TX, USA","name":"CCS: Conference on Computer and Communications Security","start_date":"2017-10-30"},"status":"public","abstract":[{"lang":"eng","text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/443"}],"ec_funded":1,"quality_controlled":"1","title":"Practical graphs for optimal side-channel resistant memory-hard functions","publication_identifier":{"isbn":["9781450349468"]},"department":[{"_id":"KrPi"}],"external_id":{"isi":["000440307700063"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"6527","page":"1001-1017","citation":{"ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, Dallas, TX, USA, 2017, pp. 1001–1017.","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM, 2017, pp. 1001–1017.","apa":"Alwen, J. F., Blocki, J., &#38; Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 1001–1017). Dallas, TX, USA: ACM. <a href=\"https://doi.org/10.1145/3133956.3134031\">https://doi.org/10.1145/3133956.3134031</a>","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, 1001–17. ACM, 2017. <a href=\"https://doi.org/10.1145/3133956.3134031\">https://doi.org/10.1145/3133956.3134031</a>.","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM; 2017:1001-1017. doi:<a href=\"https://doi.org/10.1145/3133956.3134031\">10.1145/3133956.3134031</a>","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, ACM, 2017, pp. 1001–17, doi:<a href=\"https://doi.org/10.1145/3133956.3134031\">10.1145/3133956.3134031</a>.","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017."},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_status":"published","date_published":"2017-10-30T00:00:00Z","year":"2017","date_created":"2019-06-06T13:21:29Z","date_updated":"2025-09-18T10:40:38Z","type":"conference","isi":1},{"acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","isi":1,"intvolume":"        49","date_updated":"2025-09-11T07:12:56Z","type":"journal_article","date_published":"2017-03-01T00:00:00Z","publist_id":"7092","year":"2017","date_created":"2018-12-11T11:47:43Z","article_processing_charge":"No","language":[{"iso":"eng"}],"citation":{"short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ieee":"A. Makohon Moore <i>et al.</i>, “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” <i>Nature Genetics</i>, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. <i>Nature Genetics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ng.3764\">https://doi.org/10.1038/ng.3764</a>","chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” <i>Nature Genetics</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ng.3764\">https://doi.org/10.1038/ng.3764</a>.","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. <i>Nature Genetics</i>. 2017;49(3):358-366. doi:<a href=\"https://doi.org/10.1038/ng.3764\">10.1038/ng.3764</a>","mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” <i>Nature Genetics</i>, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:<a href=\"https://doi.org/10.1038/ng.3764\">10.1038/ng.3764</a>.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366."},"publication_status":"published","page":"358 - 366","_id":"653","external_id":{"isi":["000394917800009"],"pmid":["28092682"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrCh"}],"issue":"3","file":[{"access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":908099,"relation":"main_file","file_name":"2017_NatureGenetics_Makohon.pdf","date_updated":"2020-07-14T12:47:33Z","checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","date_created":"2019-11-19T08:13:50Z","file_id":"7050"}],"publication_identifier":{"issn":["1061-4036"]},"has_accepted_license":"1","title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","ddc":["000"],"quality_controlled":"1","ec_funded":1,"abstract":[{"text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease.","lang":"eng"}],"status":"public","publisher":"Nature Publishing Group","publication":"Nature Genetics","oa":1,"day":"01","doi":"10.1038/ng.3764","author":[{"first_name":"Alvin","last_name":"Makohon Moore","full_name":"Makohon Moore, Alvin"},{"full_name":"Zhang, Ming","last_name":"Zhang","first_name":"Ming"},{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"last_name":"Božić","first_name":"Ivana","full_name":"Božić, Ivana"},{"full_name":"Allen, Benjamin","last_name":"Allen","first_name":"Benjamin"},{"full_name":"Kundu, Deepanjan","id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan","last_name":"Kundu"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wong, Fay","last_name":"Wong","first_name":"Fay"},{"full_name":"Jiao, Yuchen","first_name":"Yuchen","last_name":"Jiao"},{"last_name":"Kohutek","first_name":"Zachary","full_name":"Kohutek, Zachary"},{"last_name":"Hong","first_name":"Jungeui","full_name":"Hong, Jungeui"},{"full_name":"Attiyeh, Marc","last_name":"Attiyeh","first_name":"Marc"},{"full_name":"Javier, Breanna","last_name":"Javier","first_name":"Breanna"},{"last_name":"Wood","first_name":"Laura","full_name":"Wood, Laura"},{"full_name":"Hruban, Ralph","first_name":"Ralph","last_name":"Hruban"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"},{"full_name":"Papadopoulos, Nickolas","last_name":"Papadopoulos","first_name":"Nickolas"},{"full_name":"Kinzler, Kenneth","first_name":"Kenneth","last_name":"Kinzler"},{"first_name":"Bert","last_name":"Vogelstein","full_name":"Vogelstein, Bert"},{"full_name":"Iacobuzio Donahue, Christine","last_name":"Iacobuzio Donahue","first_name":"Christine"}],"month":"03","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"pmid":1,"article_type":"original","volume":49,"scopus_import":"1","oa_version":"Submitted Version"},{"status":"public","article_number":"e23136","abstract":[{"text":"The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell.","lang":"eng"}],"ddc":["579"],"quality_controlled":"1","volume":6,"scopus_import":"1","oa_version":"Published Version","author":[{"last_name":"Renault","first_name":"Thibaud","full_name":"Renault, Thibaud"},{"last_name":"Abraham","first_name":"Anthony","full_name":"Abraham, Anthony"},{"orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller"},{"first_name":"Guillaume","last_name":"Paradis","full_name":"Paradis, Guillaume"},{"full_name":"Rainville, Simon","last_name":"Rainville","first_name":"Simon"},{"last_name":"Charpentier","first_name":"Emmanuelle","full_name":"Charpentier, Emmanuelle"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"last_name":"Tu","first_name":"Yuhai","full_name":"Tu, Yuhai"},{"full_name":"Namba, Keiichi","last_name":"Namba","first_name":"Keiichi"},{"full_name":"Keener, James","last_name":"Keener","first_name":"James"},{"last_name":"Minamino","first_name":"Tohru","full_name":"Minamino, Tohru"},{"full_name":"Erhardt, Marc","first_name":"Marc","last_name":"Erhardt"}],"doi":"10.7554/eLife.23136","pubrep_id":"904","month":"03","publication":"eLife","day":"06","oa":1,"publisher":"eLife Sciences Publications","_id":"655","date_published":"2017-03-06T00:00:00Z","publist_id":"7082","date_created":"2018-12-11T11:47:44Z","year":"2017","article_processing_charge":"No","citation":{"ieee":"T. Renault <i>et al.</i>, “Bacterial flagella grow through an injection diffusion mechanism,” <i>eLife</i>, vol. 6. eLife Sciences Publications, 2017.","short":"T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).","apa":"Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.23136\">https://doi.org/10.7554/eLife.23136</a>","chicago":"Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” <i>ELife</i>. eLife Sciences Publications, 2017. <a href=\"https://doi.org/10.7554/eLife.23136\">https://doi.org/10.7554/eLife.23136</a>.","ama":"Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. <i>eLife</i>. 2017;6. doi:<a href=\"https://doi.org/10.7554/eLife.23136\">10.7554/eLife.23136</a>","mla":"Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” <i>ELife</i>, vol. 6, e23136, eLife Sciences Publications, 2017, doi:<a href=\"https://doi.org/10.7554/eLife.23136\">10.7554/eLife.23136</a>.","ista":"Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136."},"language":[{"iso":"eng"}],"publication_status":"published","isi":1,"intvolume":"         6","date_updated":"2025-09-11T07:11:19Z","type":"journal_article","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","title":"Bacterial flagella grow through an injection diffusion mechanism","publication_identifier":{"issn":["2050-084X"]},"file":[{"date_updated":"2020-07-14T12:47:33Z","file_id":"4716","date_created":"2018-12-12T10:08:53Z","checksum":"39e1c3e82ddac83a30422fa72fa1a383","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_name":"IST-2017-904-v1+1_elife-23136-v2.pdf","file_size":5520359},{"file_size":11242920,"relation":"main_file","file_name":"IST-2017-904-v1+2_elife-23136-figures-v2.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:08:54Z","checksum":"a6d542253028f52e00aa29739ddffe8f","file_id":"4717","date_updated":"2020-07-14T12:47:33Z"}],"external_id":{"isi":["000398680700001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:47:33Z"},{"publication_identifier":{"issn":["1946-6234"]},"title":"Modeling Alzheimer's disease in mice with human neurons","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaNo"}],"issue":"381","_id":"656","type":"journal_article","intvolume":"         9","date_updated":"2025-07-10T11:53:32Z","date_created":"2018-12-11T11:47:45Z","year":"2017","publist_id":"7079","date_published":"2017-03-15T00:00:00Z","publication_status":"published","citation":{"ieee":"G. Novarino, “Modeling Alzheimer’s disease in mice with human neurons,” <i>Science Translational Medicine</i>, vol. 9, no. 381. American Association for the Advancement of Science, 2017.","short":"G. Novarino, Science Translational Medicine 9 (2017).","ista":"Novarino G. 2017. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 9(381), eaam9867.","mla":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” <i>Science Translational Medicine</i>, vol. 9, no. 381, eaam9867, American Association for the Advancement of Science, 2017, doi:<a href=\"https://doi.org/10.1126/scitranslmed.aam9867\">10.1126/scitranslmed.aam9867</a>.","ama":"Novarino G. Modeling Alzheimer’s disease in mice with human neurons. <i>Science Translational Medicine</i>. 2017;9(381). doi:<a href=\"https://doi.org/10.1126/scitranslmed.aam9867\">10.1126/scitranslmed.aam9867</a>","chicago":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” <i>Science Translational Medicine</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/scitranslmed.aam9867\">https://doi.org/10.1126/scitranslmed.aam9867</a>.","apa":"Novarino, G. (2017). Modeling Alzheimer’s disease in mice with human neurons. <i>Science Translational Medicine</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scitranslmed.aam9867\">https://doi.org/10.1126/scitranslmed.aam9867</a>"},"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1126/scitranslmed.aam9867","author":[{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"}],"month":"03","scopus_import":"1","volume":9,"corr_author":"1","oa_version":"None","publisher":"American Association for the Advancement of Science","day":"15","publication":"Science Translational Medicine","abstract":[{"text":"Human neurons transplanted into a mouse model for Alzheimer’s disease show human-specific vulnerability to β-amyloid plaques and may help to identify new therapeutic targets.","lang":"eng"}],"article_number":"eaam9867","status":"public","quality_controlled":"1"},{"quality_controlled":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/","open_access":"1"}],"abstract":[{"text":"Plant organs are typically organized into three main tissue layers. The middle ground tissue layer comprises the majority of the plant body and serves a wide range of functions, including photosynthesis, selective nutrient uptake and storage, and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are controlled by a well-established gene network revolving around the key regulator SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity is first specified from totipotent precursor cells in the embryo. The plant signaling molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors, is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts both cell-autonomously and noncell-autonomously to control embryonic vascular tissue formation and root initiation, respectively. Here we show that auxin response and ARF activity cell-autonomously control the asymmetric division of the first ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally initiates the ground tissue lineage and acts upstream of the regulatory network that controls ground tissue patterning and maintenance. Strikingly, whereas the SHR network depends on MP, this MP function is, at least in part, SHR independent. Our study therefore identifies auxin response as a regulator of ground tissue specification in the embryonic root, and reveals that ground tissue initiation and maintenance use different regulators and mechanisms. Moreover, our data provide a framework for the simultaneous formation of multiple cell types by the same transcriptional regulator.","lang":"eng"}],"status":"public","publisher":"National Academy of Sciences","publication":"PNAS","oa":1,"day":"21","author":[{"last_name":"Möller","first_name":"Barbara","full_name":"Möller, Barbara"},{"full_name":"Ten Hove, Colette","last_name":"Ten Hove","first_name":"Colette"},{"first_name":"Daoquan","last_name":"Xiang","full_name":"Xiang, Daoquan"},{"last_name":"Williams","first_name":"Nerys","full_name":"Williams, Nerys"},{"full_name":"López, Lorena","last_name":"López","first_name":"Lorena"},{"id":"2E46069C-F248-11E8-B48F-1D18A9856A87","first_name":"Saiko","last_name":"Yoshida","full_name":"Yoshida, Saiko"},{"first_name":"Margot","last_name":"Smit","full_name":"Smit, Margot"},{"first_name":"Raju","last_name":"Datla","full_name":"Datla, Raju"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"}],"doi":"10.1073/pnas.1616493114","month":"03","pmid":1,"volume":114,"scopus_import":"1","oa_version":"Submitted Version","isi":1,"intvolume":"       114","date_updated":"2025-09-11T07:09:58Z","type":"journal_article","publist_id":"7076","date_published":"2017-03-21T00:00:00Z","date_created":"2018-12-11T11:47:45Z","year":"2017","language":[{"iso":"eng"}],"citation":{"apa":"Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S., … Weijers, D. (2017). Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1616493114\">https://doi.org/10.1073/pnas.1616493114</a>","ama":"Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. <i>PNAS</i>. 2017;114(12):E2533-E2539. doi:<a href=\"https://doi.org/10.1073/pnas.1616493114\">10.1073/pnas.1616493114</a>","chicago":"Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1616493114\">https://doi.org/10.1073/pnas.1616493114</a>.","mla":"Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” <i>PNAS</i>, vol. 114, no. 12, National Academy of Sciences, 2017, pp. E2533–39, doi:<a href=\"https://doi.org/10.1073/pnas.1616493114\">10.1073/pnas.1616493114</a>.","ista":"Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539.","ieee":"B. Möller <i>et al.</i>, “Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo,” <i>PNAS</i>, vol. 114, no. 12. National Academy of Sciences, pp. E2533–E2539, 2017.","short":"B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit, R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539."},"article_processing_charge":"No","publication_status":"published","page":"E2533 - E2539","_id":"657","external_id":{"pmid":["28265057"],"isi":["000396893600033"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"JiFr"}],"issue":"12","publication_identifier":{"issn":["0027-8424"]},"title":"Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo"},{"department":[{"_id":"ChLa"},{"_id":"GaTk"}],"file_date_updated":"2020-07-14T12:47:33Z","external_id":{"isi":["000396303400001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"MAR","file":[{"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-903-v1+1_fnbot-11-00008.pdf","relation":"main_file","file_size":8439566,"date_updated":"2020-07-14T12:47:33Z","file_id":"5371","checksum":"b1bc43f96d1df3313c03032c2a46388d","date_created":"2018-12-12T10:18:49Z"}],"publication_identifier":{"issn":["1662-5218"]},"title":"Self organized behavior generation for musculoskeletal robots","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-09-11T07:10:33Z","intvolume":"        11","type":"journal_article","isi":1,"language":[{"iso":"eng"}],"citation":{"ieee":"R. Der and G. S. Martius, “Self organized behavior generation for musculoskeletal robots,” <i>Frontiers in Neurorobotics</i>, vol. 11, no. MAR. Frontiers Research Foundation, 2017.","short":"R. Der, G.S. Martius, Frontiers in Neurorobotics 11 (2017).","mla":"Der, Ralf, and Georg S. Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” <i>Frontiers in Neurorobotics</i>, vol. 11, no. MAR, 00008, Frontiers Research Foundation, 2017, doi:<a href=\"https://doi.org/10.3389/fnbot.2017.00008\">10.3389/fnbot.2017.00008</a>.","ista":"Der R, Martius GS. 2017. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 11(MAR), 00008.","apa":"Der, R., &#38; Martius, G. S. (2017). Self organized behavior generation for musculoskeletal robots. <i>Frontiers in Neurorobotics</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnbot.2017.00008\">https://doi.org/10.3389/fnbot.2017.00008</a>","ama":"Der R, Martius GS. Self organized behavior generation for musculoskeletal robots. <i>Frontiers in Neurorobotics</i>. 2017;11(MAR). doi:<a href=\"https://doi.org/10.3389/fnbot.2017.00008\">10.3389/fnbot.2017.00008</a>","chicago":"Der, Ralf, and Georg S Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” <i>Frontiers in Neurorobotics</i>. Frontiers Research Foundation, 2017. <a href=\"https://doi.org/10.3389/fnbot.2017.00008\">https://doi.org/10.3389/fnbot.2017.00008</a>."},"article_processing_charge":"Yes","publication_status":"published","date_published":"2017-03-16T00:00:00Z","publist_id":"7078","date_created":"2018-12-11T11:47:45Z","year":"2017","_id":"658","publisher":"Frontiers Research Foundation","publication":"Frontiers in Neurorobotics","oa":1,"day":"16","month":"03","pubrep_id":"903","author":[{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"},{"first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","full_name":"Martius, Georg S"}],"doi":"10.3389/fnbot.2017.00008","corr_author":"1","oa_version":"Published Version","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"volume":11,"scopus_import":"1","quality_controlled":"1","ddc":["006"],"ec_funded":1,"article_number":"00008","abstract":[{"text":"With the accelerated development of robot technologies, control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of specific objectives for the task at hand. While very successful in many applications, self-organized control schemes seem to be favored in large complex systems with unknown dynamics or which are difficult to model. Reasons are the expected scalability, robustness, and resilience of self-organizing systems. The paper presents a self-learning neurocontroller based on extrinsic differential plasticity introduced recently, applying it to an anthropomorphic musculoskeletal robot arm with attached objects of unknown physical dynamics. The central finding of the paper is the following effect: by the mere feedback through the internal dynamics of the object, the robot is learning to relate each of the objects with a very specific sensorimotor pattern. Specifically, an attached pendulum pilots the arm into a circular motion, a half-filled bottle produces axis oriented shaking behavior, a wheel is getting rotated, and wiping patterns emerge automatically in a table-plus-brush setting. By these object-specific dynamical patterns, the robot may be said to recognize the object's identity, or in other words, it discovers dynamical affordances of objects. Furthermore, when including hand coordinates obtained from a camera, a dedicated hand-eye coordination self-organizes spontaneously. These phenomena are discussed from a specific dynamical system perspective. Central is the dedicated working regime at the border to instability with its potentially infinite reservoir of (limit cycle) attractors &quot;waiting&quot; to be excited. Besides converging toward one of these attractors, variate behavior is also arising from a self-induced attractor morphing driven by the learning rule. We claim that experimental investigations with this anthropomorphic, self-learning robot not only generate interesting and potentially useful behaviors, but may also help to better understand what subjective human muscle feelings are, how they can be rooted in sensorimotor patterns, and how these concepts may feed back on robotics.","lang":"eng"}],"status":"public"},{"publication_status":"published","citation":{"mla":"Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” <i>Nature Communications</i>, vol. 8, 14832, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/ncomms14832\">10.1038/ncomms14832</a>.","ista":"Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial force generation. Nature Communications. 8, 14832.","apa":"Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A., … Rottner, K. (2017). FMNL formins boost lamellipodial force generation. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms14832\">https://doi.org/10.1038/ncomms14832</a>","ama":"Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. <i>Nature Communications</i>. 2017;8. doi:<a href=\"https://doi.org/10.1038/ncomms14832\">10.1038/ncomms14832</a>","chicago":"Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncomms14832\">https://doi.org/10.1038/ncomms14832</a>.","ieee":"F. Kage <i>et al.</i>, “FMNL formins boost lamellipodial force generation,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.","short":"F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S. Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch, T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications 8 (2017)."},"language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2017","date_created":"2018-12-11T11:47:46Z","date_published":"2017-03-22T00:00:00Z","publist_id":"7075","type":"journal_article","intvolume":"         8","date_updated":"2025-09-11T07:09:28Z","isi":1,"_id":"659","file":[{"file_name":"IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf","relation":"main_file","file_size":9523746,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_id":"5072","date_created":"2018-12-12T10:14:21Z","checksum":"dae30190291c3630e8102d8714a8d23e","date_updated":"2020-07-14T12:47:34Z"}],"department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:34Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000396993700001"]},"title":"FMNL formins boost lamellipodial force generation","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","ddc":["570"],"status":"public","abstract":[{"text":"Migration frequently involves Rac-mediated protrusion of lamellipodia, formed by Arp2/3 complex-dependent branching thought to be crucial for force generation and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors targeting to the lamellipodium tip and shown here to nucleate and elongate actin filaments with complementary activities in vitro. In migrating B16-F1 melanoma cells, both formins contribute to the velocity of lamellipodium protrusion. Loss of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width, actin filament density and -bundling, without changing patterns of Arp2/3 complex incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost completely abolishes protrusion forces exerted by lamellipodia and modifies their ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3 in fibroblasts reduces both migration and capability of cells to move against viscous media. Together, we conclude that force generation in lamellipodia strongly depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent filament branching.","lang":"eng"}],"article_number":"14832","day":"22","oa":1,"publication":"Nature Communications","publisher":"Nature Publishing Group","oa_version":"Published Version","scopus_import":"1","volume":8,"pubrep_id":"902","month":"03","author":[{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"last_name":"Winterhoff","first_name":"Moritz","full_name":"Winterhoff, Moritz"},{"first_name":"Vanessa","last_name":"Dimchev","full_name":"Dimchev, Vanessa"},{"full_name":"Müller, Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","first_name":"Jan","last_name":"Müller"},{"full_name":"Thalheim, Tobias","last_name":"Thalheim","first_name":"Tobias"},{"last_name":"Freise","first_name":"Anika","full_name":"Freise, Anika"},{"last_name":"Brühmann","first_name":"Stefan","full_name":"Brühmann, Stefan"},{"last_name":"Kollasser","first_name":"Jana","full_name":"Kollasser, Jana"},{"full_name":"Block, Jennifer","last_name":"Block","first_name":"Jennifer"},{"full_name":"Dimchev, Georgi A","first_name":"Georgi A","last_name":"Dimchev"},{"last_name":"Geyer","first_name":"Matthias","full_name":"Geyer, Matthias"},{"last_name":"Schnittler","first_name":"Hams","full_name":"Schnittler, Hams"},{"full_name":"Brakebusch, Cord","first_name":"Cord","last_name":"Brakebusch"},{"last_name":"Stradal","first_name":"Theresia","full_name":"Stradal, Theresia"},{"first_name":"Marie","last_name":"Carlier","full_name":"Carlier, Marie"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"},{"full_name":"Käs, Josef","last_name":"Käs","first_name":"Josef"},{"first_name":"Jan","last_name":"Faix","full_name":"Faix, Jan"},{"last_name":"Rottner","first_name":"Klemens","full_name":"Rottner, Klemens"}],"doi":"10.1038/ncomms14832"},{"date_updated":"2025-09-11T07:08:20Z","intvolume":"       114","type":"journal_article","isi":1,"acknowledgement":"We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner for data analysis advice. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK Grant FC001163, Medical Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was also supported by European Research Council Advanced Grant Project 323042 (to C.D. and T.S.).","language":[{"iso":"eng"}],"citation":{"mla":"Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” <i>PNAS</i>, vol. 114, no. 13, National Academy of Sciences, 2017, pp. 3427–32, doi:<a href=\"https://doi.org/10.1073/pnas.1620274114\">10.1073/pnas.1620274114</a>.","ista":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 114(13), 3427–3432.","apa":"Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., &#38; Surrey, T. (2017). Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1620274114\">https://doi.org/10.1073/pnas.1620274114</a>","chicago":"Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” <i>PNAS</i>. National Academy of Sciences, 2017. <a href=\"https://doi.org/10.1073/pnas.1620274114\">https://doi.org/10.1073/pnas.1620274114</a>.","ama":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. <i>PNAS</i>. 2017;114(13):3427-3432. doi:<a href=\"https://doi.org/10.1073/pnas.1620274114\">10.1073/pnas.1620274114</a>","short":"J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017) 3427–3432.","ieee":"J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation,” <i>PNAS</i>, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017."},"article_processing_charge":"No","publication_status":"published","publist_id":"7073","date_published":"2017-03-28T00:00:00Z","year":"2017","date_created":"2018-12-11T11:47:46Z","_id":"660","page":"3427 - 3432","department":[{"_id":"MaLo"}],"external_id":{"pmid":["28280102"],"isi":["000397607300065"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"13","publication_identifier":{"issn":["0027-8424"]},"title":"Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation","quality_controlled":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/","open_access":"1"}],"abstract":[{"lang":"eng","text":"Growing microtubules are protected from depolymerization by the presence of a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing cap, allowing monitoring of its size in real time. The cap size has been shown to correlate with instantaneous microtubule stability. Here we have quantitatively characterized the properties of cap size fluctuations during steadystate growth and have developed a theory predicting their timescale and amplitude from the kinetics of microtubule growth and cap maturation. In contrast to growth speed fluctuations, cap size fluctuations show a characteristic timescale, which is defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude of cap size fluctuations; however, cap size does not affect growth speed, indicating that microtubules are far from instability during most of their time of growth. Our theory provides the basis for a quantitative understanding of microtubule stability fluctuations during steady-state growth."}],"status":"public","publisher":"National Academy of Sciences","publication":"PNAS","oa":1,"day":"28","month":"03","doi":"10.1073/pnas.1620274114","author":[{"last_name":"Rickman","first_name":"Jamie","full_name":"Rickman, Jamie"},{"first_name":"Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","full_name":"Düllberg, Christian F","orcid":"0000-0001-6335-9748"},{"full_name":"Cade, Nicholas","last_name":"Cade","first_name":"Nicholas"},{"full_name":"Griffin, Lewis","last_name":"Griffin","first_name":"Lewis"},{"last_name":"Surrey","first_name":"Thomas","full_name":"Surrey, Thomas"}],"oa_version":"Submitted Version","pmid":1,"volume":114,"scopus_import":"1"},{"article_number":"044107","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01714"}],"abstract":[{"lang":"eng","text":"We report a direct-numerical-simulation study of the Taylor-Couette flow in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian rotating flow has been investigated for decades as a simplified model system to study the origin of turbulence in accretion disks that is not fully understood. The flow in this study is axially periodic and thus the experimental end-wall effects on the stability of the flow are avoided. Using optimal linear perturbations as initial conditions, our simulations find no sustained turbulence: the strong initial perturbations distort the velocity profile and trigger turbulence that eventually decays."}],"status":"public","quality_controlled":"1","author":[{"full_name":"Shi, Liang","last_name":"Shi","first_name":"Liang"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"},{"last_name":"Rampp","first_name":"Markus","full_name":"Rampp, Markus"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"}],"doi":"10.1063/1.4981525","month":"04","project":[{"grant_number":"SFB 963  TP A8","_id":"2511D90C-B435-11E9-9278-68D0E5697425","name":"Astrophysical instability of currents and turbulences"}],"scopus_import":"1","volume":29,"oa_version":"Submitted Version","publisher":"American Institute of Physics","publication":"Physics of Fluids","oa":1,"day":"01","arxiv":1,"_id":"662","isi":1,"intvolume":"        29","date_updated":"2025-09-11T07:06:55Z","type":"journal_article","publist_id":"7072","date_published":"2017-04-01T00:00:00Z","year":"2017","date_created":"2018-12-11T11:47:47Z","language":[{"iso":"eng"}],"citation":{"short":"L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017).","ieee":"L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi Keplerian rotating flows,” <i>Physics of Fluids</i>, vol. 29, no. 4. American Institute of Physics, 2017.","mla":"Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” <i>Physics of Fluids</i>, vol. 29, no. 4, 044107, American Institute of Physics, 2017, doi:<a href=\"https://doi.org/10.1063/1.4981525\">10.1063/1.4981525</a>.","ista":"Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 29(4), 044107.","apa":"Shi, L., Hof, B., Rampp, M., &#38; Avila, M. (2017). Hydrodynamic turbulence in quasi Keplerian rotating flows. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4981525\">https://doi.org/10.1063/1.4981525</a>","chicago":"Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” <i>Physics of Fluids</i>. American Institute of Physics, 2017. <a href=\"https://doi.org/10.1063/1.4981525\">https://doi.org/10.1063/1.4981525</a>.","ama":"Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian rotating flows. <i>Physics of Fluids</i>. 2017;29(4). doi:<a href=\"https://doi.org/10.1063/1.4981525\">10.1063/1.4981525</a>"},"article_processing_charge":"No","publication_status":"published","publication_identifier":{"issn":["1070-6631"]},"title":"Hydrodynamic turbulence in quasi Keplerian rotating flows","external_id":{"arxiv":["1703.01714"],"isi":["000400384100022"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"BjHo"}],"issue":"4"},{"publication":"Proceedings of the 20th International Conference on Hybrid Systems","day":"01","oa":1,"publisher":"ACM","scopus_import":"1","oa_version":"Submitted Version","author":[{"full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"},{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"doi":"10.1145/3049797.3049814","pubrep_id":"817","month":"04","ddc":["000"],"quality_controlled":"1","conference":{"name":"HSCC: Hybrid Systems - Computation and Control ","start_date":"2017-04-18","location":"Pittsburgh, PA, United States","end_date":"2017-04-20"},"status":"public","abstract":[{"text":"In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. ","lang":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_name":"IST-2017-817-v1+1_p163-kong.pdf","file_size":1650530,"date_updated":"2020-07-14T12:47:34Z","file_id":"4873","date_created":"2018-12-12T10:11:20Z","checksum":"b7667434cbf5b5f0ade3bea1dbe5bf63"}],"external_id":{"isi":["000615962400019"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:47:34Z","department":[{"_id":"ToHe"}],"has_accepted_license":"1","title":"Safety verification of nonlinear hybrid systems based on invariant clusters","publication_identifier":{"isbn":["978-145034590-3"]},"date_published":"2017-04-01T00:00:00Z","publist_id":"7067","date_created":"2018-12-11T11:47:47Z","year":"2017","citation":{"apa":"Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., &#38; Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In <i>Proceedings of the 20th International Conference on Hybrid Systems</i> (pp. 163–172). Pittsburgh, PA, United States: ACM. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>","chicago":"Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, 163–72. ACM, 2017. <a href=\"https://doi.org/10.1145/3049797.3049814\">https://doi.org/10.1145/3049797.3049814</a>.","ama":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: <i>Proceedings of the 20th International Conference on Hybrid Systems</i>. ACM; 2017:163-172. doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>","mla":"Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, ACM, 2017, pp. 163–72, doi:<a href=\"https://doi.org/10.1145/3049797.3049814\">10.1145/3049797.3049814</a>.","ista":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems - Computation and Control , 163–172.","short":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.","ieee":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in <i>Proceedings of the 20th International Conference on Hybrid Systems</i>, Pittsburgh, PA, United States, 2017, pp. 163–172."},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_status":"published","isi":1,"date_updated":"2025-09-11T07:06:15Z","type":"conference","page":"163 - 172","_id":"663"},{"day":"21","publication":"Science","publisher":"American Association for the Advancement of Science","oa_version":"None","corr_author":"1","article_type":"original","scopus_import":"1","volume":356,"project":[{"name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P28844-B27"}],"month":"04","author":[{"orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"},{"last_name":"Andersson","first_name":"Anna M","id":"2B8A40DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2912-6769","full_name":"Andersson, Anna M"},{"full_name":"Tomasek, Kathrin","orcid":"0000-0003-3768-877X","last_name":"Tomasek","first_name":"Kathrin","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Balleza, Enrique","last_name":"Balleza","first_name":"Enrique"},{"full_name":"Kiviet, Daniel","last_name":"Kiviet","first_name":"Daniel"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper"},{"orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1126/science.aaf4762","quality_controlled":"1","status":"public","abstract":[{"text":"The molecular mechanisms underlying phenotypic variation in isogenic bacterial populations remain poorly understood.We report that AcrAB-TolC, the main multidrug efflux pump of Escherichia coli, exhibits a strong partitioning bias for old cell poles by a segregation mechanism that is mediated by ternary AcrAB-TolC complex formation. Mother cells inheriting old poles are phenotypically distinct and display increased drug efflux activity relative to daughters. Consequently, we find systematic and long-lived growth differences between mother and daughter cells in the presence of subinhibitory drug concentrations. A simple model for biased partitioning predicts a population structure of long-lived and highly heterogeneous phenotypes. This straightforward mechanism of generating sustained growth rate differences at subinhibitory antibiotic concentrations has implications for understanding the emergence of multidrug resistance in bacteria.","lang":"eng"}],"issue":"6335","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"Bio"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000399540100060"]},"title":"Biased partitioning of the multidrug efflux pump AcrAB TolC underlies long lived phenotypic heterogeneity","publication_identifier":{"issn":["0036-8075"]},"publication_status":"published","citation":{"apa":"Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild, R., … Guet, C. C. (2017). Biased partitioning of the multidrug efflux pump AcrAB TolC underlies long lived phenotypic heterogeneity. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aaf4762\">https://doi.org/10.1126/science.aaf4762</a>","ama":"Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multidrug efflux pump AcrAB TolC underlies long lived phenotypic heterogeneity. <i>Science</i>. 2017;356(6335):311-315. doi:<a href=\"https://doi.org/10.1126/science.aaf4762\">10.1126/science.aaf4762</a>","chicago":"Bergmiller, Tobias, Anna M Andersson, Kathrin Tomasek, Enrique Balleza, Daniel Kiviet, Robert Hauschild, Gašper Tkačik, and Calin C Guet. “Biased Partitioning of the Multidrug Efflux Pump AcrAB TolC Underlies Long Lived Phenotypic Heterogeneity.” <i>Science</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/science.aaf4762\">https://doi.org/10.1126/science.aaf4762</a>.","mla":"Bergmiller, Tobias, et al. “Biased Partitioning of the Multidrug Efflux Pump AcrAB TolC Underlies Long Lived Phenotypic Heterogeneity.” <i>Science</i>, vol. 356, no. 6335, American Association for the Advancement of Science, 2017, pp. 311–15, doi:<a href=\"https://doi.org/10.1126/science.aaf4762\">10.1126/science.aaf4762</a>.","ista":"Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik G, Guet CC. 2017. Biased partitioning of the multidrug efflux pump AcrAB TolC underlies long lived phenotypic heterogeneity. Science. 356(6335), 311–315.","short":"T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild, G. Tkačik, C.C. Guet, Science 356 (2017) 311–315.","ieee":"T. Bergmiller <i>et al.</i>, “Biased partitioning of the multidrug efflux pump AcrAB TolC underlies long lived phenotypic heterogeneity,” <i>Science</i>, vol. 356, no. 6335. American Association for the Advancement of Science, pp. 311–315, 2017."},"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","date_created":"2018-12-11T11:47:48Z","publist_id":"7064","date_published":"2017-04-21T00:00:00Z","type":"journal_article","intvolume":"       356","date_updated":"2025-09-11T07:05:04Z","isi":1,"related_material":{"record":[{"relation":"popular_science","status":"public","id":"5560"}]},"_id":"665","page":"311 - 315"},{"publist_id":"7060","date_published":"2017-04-26T00:00:00Z","date_created":"2018-12-11T11:47:48Z","year":"2017","article_processing_charge":"No","citation":{"ieee":"G. Novarino, “The antisocial side of antibiotics,” <i>Science Translational Medicine</i>, vol. 9, no. 387. American Association for the Advancement of Science, 2017.","short":"G. Novarino, Science Translational Medicine 9 (2017).","chicago":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” <i>Science Translational Medicine</i>. American Association for the Advancement of Science, 2017. <a href=\"https://doi.org/10.1126/scitranslmed.aan2786\">https://doi.org/10.1126/scitranslmed.aan2786</a>.","ama":"Novarino G. The antisocial side of antibiotics. <i>Science Translational Medicine</i>. 2017;9(387). doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan2786\">10.1126/scitranslmed.aan2786</a>","apa":"Novarino, G. (2017). The antisocial side of antibiotics. <i>Science Translational Medicine</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scitranslmed.aan2786\">https://doi.org/10.1126/scitranslmed.aan2786</a>","ista":"Novarino G. 2017. The antisocial side of antibiotics. Science Translational Medicine. 9(387), 2786.","mla":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” <i>Science Translational Medicine</i>, vol. 9, no. 387, 2786, American Association for the Advancement of Science, 2017, doi:<a href=\"https://doi.org/10.1126/scitranslmed.aan2786\">10.1126/scitranslmed.aan2786</a>."},"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2025-07-10T11:53:44Z","intvolume":"         9","type":"journal_article","_id":"667","issue":"387","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaNo"}],"title":"The antisocial side of antibiotics","publication_identifier":{"issn":["1946-6234"]},"quality_controlled":"1","status":"public","abstract":[{"lang":"eng","text":"Perinatal exposure to penicillin may result in longlasting gut and behavioral changes."}],"article_number":"2786","publication":"Science Translational Medicine","day":"26","publisher":"American Association for the Advancement of Science","scopus_import":"1","volume":9,"oa_version":"None","corr_author":"1","doi":"10.1126/scitranslmed.aan2786","author":[{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"}],"month":"04"}]