[{"department":[{"_id":"ToBo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["27936615"]},"language":[{"iso":"eng"}],"_id":"520","publication_status":"published","publication_identifier":{"issn":["21615063"]},"abstract":[{"lang":"eng","text":"Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here."}],"type":"journal_article","year":"2017","scopus_import":1,"pmid":1,"oa_version":"None","publist_id":"7298","doi":"10.1021/acssynbio.6b00235","publication":"ACS Synthetic Biology","intvolume":"         6","page":"395 - 401","quality_controlled":"1","publisher":"American Chemical Society","issue":"3","author":[{"full_name":"Du, Wei","first_name":"Wei","last_name":"Du"},{"id":"4677C796-F248-11E8-B48F-1D18A9856A87","full_name":"Angermayr, Andreas","orcid":"0000-0001-8619-2223","last_name":"Angermayr","first_name":"Andreas"},{"first_name":"Joeri","last_name":"Jongbloets","full_name":"Jongbloets, Joeri"},{"full_name":"Molenaar, Douwe","first_name":"Douwe","last_name":"Molenaar"},{"first_name":"Herwig","last_name":"Bachmann","full_name":"Bachmann, Herwig"},{"full_name":"Hellingwerf, Klaas","last_name":"Hellingwerf","first_name":"Klaas"},{"full_name":"Branco Dos Santos, Filipe","last_name":"Branco Dos Santos","first_name":"Filipe"}],"status":"public","title":"Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803","date_updated":"2021-01-12T08:01:21Z","day":"17","citation":{"short":"W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.","apa":"Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf, K., &#38; Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. <i>ACS Synthetic Biology</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acssynbio.6b00235\">https://doi.org/10.1021/acssynbio.6b00235</a>","ieee":"W. Du <i>et al.</i>, “Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803,” <i>ACS Synthetic Biology</i>, vol. 6, no. 3. American Chemical Society, pp. 395–401, 2017.","chicago":"Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann, Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” <i>ACS Synthetic Biology</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acssynbio.6b00235\">https://doi.org/10.1021/acssynbio.6b00235</a>.","ista":"Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 6(3), 395–401.","ama":"Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. <i>ACS Synthetic Biology</i>. 2017;6(3):395-401. doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00235\">10.1021/acssynbio.6b00235</a>","mla":"Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” <i>ACS Synthetic Biology</i>, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00235\">10.1021/acssynbio.6b00235</a>."},"month":"03","date_created":"2018-12-11T11:46:56Z","date_published":"2017-03-17T00:00:00Z","volume":6,"article_type":"letter_note"},{"day":"01","citation":{"short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","apa":"Austin, K., &#38; Virk, Z. (2017). Higson compactification and dimension raising. <i>Topology and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” <i>Topology and its Applications</i>, vol. 215. Elsevier, pp. 45–57, 2017.","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. <i>Topology and its Applications</i>. 2017;215:45-57. doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>, vol. 215, Elsevier, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>."},"date_updated":"2021-01-12T08:01:21Z","type":"journal_article","year":"2017","oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:46:56Z","month":"01","volume":215,"doi":"10.1016/j.topol.2016.10.005","publist_id":"7299","publisher":"Elsevier","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"page":"45 - 57","intvolume":"       215","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"publication":"Topology and its Applications","publication_status":"published","_id":"521","language":[{"iso":"eng"}],"publication_identifier":{"issn":["01668641"]},"oa":1,"author":[{"last_name":"Austin","first_name":"Kyle","full_name":"Austin, Kyle"},{"first_name":"Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","full_name":"Virk, Ziga"}],"abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"title":"Higson compactification and dimension raising","status":"public"},{"status":"public","abstract":[{"lang":"eng","text":"The Casparian strip is an important barrier regulating water and nutrient uptake into root tissues. New research reveals two peptide signals and their co-receptors play critical roles patterning and maintaining barrier integrity. "}],"title":"Plant biology: Building barriers… in roots","extern":1,"author":[{"full_name":"Daniel von Wangenheim","id":"49E91952-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","orcid":"0000-0002-6862-1247","last_name":"Von Wangenheim"},{"full_name":"Goh, Tatsuaki","first_name":"Tatsuaki","last_name":"Goh"},{"full_name":"Dietrich, Daniela","last_name":"Dietrich","first_name":"Daniela"},{"full_name":"Bennett, Malcolm J","last_name":"Bennett","first_name":"Malcolm"}],"acknowledgement":"Biotechnology and Biological Sciences Research Council:\tBBSRC BB/M001806/1 and BB/H020314/1\t","oa":1,"file_date_updated":"2020-07-14T12:46:38Z","_id":"525","publication_status":"published","issue":"5","publication":"Current Biology","intvolume":"        27","quality_controlled":0,"main_file_link":[{"url":"https://repository.ist.ac.at/id/eprint/983","open_access":"1"}],"page":"R172 - R174","publisher":"Cell Press","doi":"10.1016/j.cub.2017.01.060","publist_id":"7294","volume":27,"month":"03","date_published":"2017-03-06T00:00:00Z","date_created":"2018-12-11T11:46:58Z","type":"journal_article","year":"2017","date_updated":"2021-01-12T08:01:23Z","pubrep_id":"983","day":"06","citation":{"short":"D. von Wangenheim, T. Goh, D. Dietrich, M. Bennett, Current Biology 27 (2017) R172–R174.","apa":"von Wangenheim, D., Goh, T., Dietrich, D., &#38; Bennett, M. (2017). Plant biology: Building barriers… in roots. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">https://doi.org/10.1016/j.cub.2017.01.060</a>","ieee":"D. von Wangenheim, T. Goh, D. Dietrich, and M. Bennett, “Plant biology: Building barriers… in roots,” <i>Current Biology</i>, vol. 27, no. 5. Cell Press, pp. R172–R174, 2017.","chicago":"Wangenheim, Daniel von, Tatsuaki Goh, Daniela Dietrich, and Malcolm Bennett. “Plant Biology: Building Barriers… in Roots.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">https://doi.org/10.1016/j.cub.2017.01.060</a>.","ama":"von Wangenheim D, Goh T, Dietrich D, Bennett M. Plant biology: Building barriers… in roots. <i>Current Biology</i>. 2017;27(5):R172-R174. doi:<a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">10.1016/j.cub.2017.01.060</a>","ista":"von Wangenheim D, Goh T, Dietrich D, Bennett M. 2017. Plant biology: Building barriers… in roots. Current Biology. 27(5), R172–R174.","mla":"von Wangenheim, Daniel, et al. “Plant Biology: Building Barriers… in Roots.” <i>Current Biology</i>, vol. 27, no. 5, Cell Press, 2017, pp. R172–74, doi:<a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">10.1016/j.cub.2017.01.060</a>."},"file":[{"checksum":"81fd4475c5a2a2c6f4313beeab215ed9","file_name":"IST-2018-983-v1+1_Plant_biology_Building_barriers__in_roots.pdf","date_updated":"2020-07-14T12:46:38Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:18:11Z","relation":"main_file","file_id":"5330","creator":"system","file_size":2840413}]},{"publication_status":"published","_id":"529","intvolume":"      1657","publication":"Brain Research","publisher":"Elsevier","page":"297 - 303","quality_controlled":0,"status":"public","extern":1,"abstract":[{"lang":"eng","text":"The pituitary adenylyl cyclase-activating polypeptide (PACAP) and its G protein-coupled receptors, PAC1, VPAC1 and VPAC2 form a system involved in a variety of biological processes. Although some sympathetic stimulatory effects of this system have been reported, its central cardiovascular regulatory properties are poorly characterized. VPAC1 receptors are expressed in the nucleus ambiguus (nAmb), a key center controlling cardiac parasympathetic tone. In this study, we report that selective VPAC1 activation in rhodamine-labeled cardiac vagal preganglionic neurons of the rat nAmb produces inositol 1,4,5-trisphosphate receptor-mediated Ca2+ mobilization, membrane depolarization and activation of P/Q-type Ca2+ channels. In vivo, this pathway converges onto transient reduction in heart rate of conscious rats. Therefore we demonstrate a VPAC1-dependent mechanism in the central parasympathetic regulation of the heart rate, adding to the complexity of PACAP-mediated cardiovascular modulation."}],"title":"Effects of VPAC1 activation in nucleus ambiguus neurons","author":[{"full_name":"Gherghina, Florin L","first_name":"Florin","last_name":"Gherghina"},{"first_name":"Andrei","last_name":"Tica","full_name":"Tica, Andrei A"},{"id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","full_name":"Elena Deliu","last_name":"Deliu","orcid":"0000-0002-7370-5293","first_name":"Elena"},{"first_name":"Mary","last_name":"Abood","full_name":"Abood, Mary E"},{"full_name":"Brailoiu, G. Christina","last_name":"Brailoiu","first_name":"G."},{"full_name":"Brǎiloiu, Eugen","last_name":"Brǎiloiu","first_name":"Eugen"}],"acknowledgement":"This study was supported by startup funds from the Jefferson College of Pharmacy, and by the National Institutes of Health DA023204 (to M.E.A) and P30 DA 013429 to Center for Substance Abuse Research, Temple University.","year":"2017","type":"journal_article","date_updated":"2021-01-12T08:01:26Z","day":"15","citation":{"mla":"Gherghina, Florin, et al. “Effects of VPAC1 Activation in Nucleus Ambiguus Neurons.” <i>Brain Research</i>, vol. 1657, Elsevier, 2017, pp. 297–303, doi:<a href=\"https://doi.org/10.1016/j.brainres.2016.12.026\">10.1016/j.brainres.2016.12.026</a>.","ista":"Gherghina F, Tica A, Deliu E, Abood M, Brailoiu G, Brǎiloiu E. 2017. Effects of VPAC1 activation in nucleus ambiguus neurons. Brain Research. 1657, 297–303.","ama":"Gherghina F, Tica A, Deliu E, Abood M, Brailoiu G, Brǎiloiu E. Effects of VPAC1 activation in nucleus ambiguus neurons. <i>Brain Research</i>. 2017;1657:297-303. doi:<a href=\"https://doi.org/10.1016/j.brainres.2016.12.026\">10.1016/j.brainres.2016.12.026</a>","chicago":"Gherghina, Florin, Andrei Tica, Elena Deliu, Mary Abood, G. Brailoiu, and Eugen Brǎiloiu. “Effects of VPAC1 Activation in Nucleus Ambiguus Neurons.” <i>Brain Research</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.brainres.2016.12.026\">https://doi.org/10.1016/j.brainres.2016.12.026</a>.","ieee":"F. Gherghina, A. Tica, E. Deliu, M. Abood, G. Brailoiu, and E. Brǎiloiu, “Effects of VPAC1 activation in nucleus ambiguus neurons,” <i>Brain Research</i>, vol. 1657. Elsevier, pp. 297–303, 2017.","apa":"Gherghina, F., Tica, A., Deliu, E., Abood, M., Brailoiu, G., &#38; Brǎiloiu, E. (2017). Effects of VPAC1 activation in nucleus ambiguus neurons. <i>Brain Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.brainres.2016.12.026\">https://doi.org/10.1016/j.brainres.2016.12.026</a>","short":"F. Gherghina, A. Tica, E. Deliu, M. Abood, G. Brailoiu, E. Brǎiloiu, Brain Research 1657 (2017) 297–303."},"volume":1657,"publist_id":"7290","doi":"10.1016/j.brainres.2016.12.026","month":"02","date_published":"2017-02-15T00:00:00Z","date_created":"2018-12-11T11:46:59Z"},{"year":"2017","arxiv":1,"type":"journal_article","scopus_import":1,"doi":"10.1007/s00454-017-9900-0","publist_id":"7283","oa_version":"Preprint","_id":"534","language":[{"iso":"eng"}],"publication_status":"published","external_id":{"arxiv":["1602.07907"]},"department":[{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"publication_identifier":{"issn":["01795376"]},"article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1379"}]},"day":"09","citation":{"ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4. Springer, pp. 871–888, 2017.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete &#38; Computational Geometry 58 (2017) 871–888.","apa":"Burton, B., de Mesmay, A. N., &#38; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>.","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete &#38; Computational Geometry. 58(4), 871–888.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. 2017;58(4):871-888. doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>."},"date_updated":"2023-02-21T17:01:34Z","volume":58,"article_type":"original","date_created":"2018-12-11T11:47:01Z","date_published":"2017-06-09T00:00:00Z","month":"06","issue":"4","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1602.07907","open_access":"1"}],"page":"871 - 888","publisher":"Springer","publication":"Discrete & Computational Geometry","intvolume":"        58","title":"Finding non-orientable surfaces in 3-Manifolds","status":"public","oa":1,"author":[{"first_name":"Benjamin","last_name":"Burton","full_name":"Burton, Benjamin"},{"full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli"}]},{"issue":"16","page":"4679 - 4682","quality_controlled":"1","publisher":"Wiley","publication":"Angewandte Chemie","intvolume":"       129","title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","status":"public","oa":1,"author":[{"first_name":"Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"first_name":"Manuela","last_name":"Stadler","full_name":"Stadler, Manuela"},{"last_name":"Gschaider-Reichhart","orcid":"0000-0002-7218-7738","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Distel, Martin","first_name":"Martin","last_name":"Distel"},{"first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” <i>Angewandte Chemie</i>, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., &#38; Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. <i>Angewandte Chemie</i>. Wiley. <a href=\"https://doi.org/10.1002/ange.201611998\">https://doi.org/10.1002/ange.201611998</a>","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” <i>Angewandte Chemie</i>. Wiley, 2017. <a href=\"https://doi.org/10.1002/ange.201611998\">https://doi.org/10.1002/ange.201611998</a>.","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” <i>Angewandte Chemie</i>, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:<a href=\"https://doi.org/10.1002/ange.201611998\">10.1002/ange.201611998</a>.","ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. <i>Angewandte Chemie</i>. 2017;129(16):4679-4682. doi:<a href=\"https://doi.org/10.1002/ange.201611998\">10.1002/ange.201611998</a>","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682."},"day":"20","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:24Z","creator":"system","file_id":"5007","relation":"main_file","file_size":1668557,"checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","date_updated":"2020-07-14T12:46:39Z"}],"date_updated":"2021-01-12T08:01:33Z","has_accepted_license":"1","volume":129,"date_published":"2017-05-20T00:00:00Z","date_created":"2018-12-11T11:47:02Z","month":"05","_id":"538","language":[{"iso":"eng"}],"ddc":["571"],"publication_status":"published","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"CaGu"},{"_id":"HaJa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. ","lang":"ger"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:46:39Z","type":"journal_article","year":"2017","pubrep_id":"932","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1002/ange.201611998","publist_id":"7279","oa_version":"Published Version"},{"_id":"540","language":[{"iso":"eng"}],"ddc":["576","616"],"publication_status":"published","department":[{"_id":"GaNo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host."}],"file_date_updated":"2020-07-14T12:46:44Z","publication_identifier":{"issn":["15537366"]},"type":"journal_article","year":"2017","scopus_import":1,"pubrep_id":"931","doi":"10.1371/journal.ppat.1006758","publist_id":"7276","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","issue":"12","publication":"PLoS Pathogens","intvolume":"        13","quality_controlled":"1","publisher":"Public Library of Science","status":"public","title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","article_number":"e1006758","author":[{"last_name":"Khamina","first_name":"Kseniya","full_name":"Khamina, Kseniya"},{"last_name":"Lercher","first_name":"Alexander","full_name":"Lercher, Alexander"},{"last_name":"Caldera","first_name":"Michael","full_name":"Caldera, Michael"},{"last_name":"Schliehe","first_name":"Christopher","full_name":"Schliehe, Christopher"},{"full_name":"Vilagos, Bojan","last_name":"Vilagos","first_name":"Bojan"},{"full_name":"Sahin, Mehmet","last_name":"Sahin","first_name":"Mehmet"},{"full_name":"Kosack, Lindsay","last_name":"Kosack","first_name":"Lindsay"},{"last_name":"Bhattacharya","first_name":"Anannya","full_name":"Bhattacharya, Anannya"},{"last_name":"Májek","first_name":"Peter","full_name":"Májek, Peter"},{"first_name":"Alexey","last_name":"Stukalov","full_name":"Stukalov, Alexey"},{"id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","full_name":"Sacco, Roberto","last_name":"Sacco","first_name":"Roberto"},{"last_name":"James","first_name":"Leo","full_name":"James, Leo"},{"first_name":"Daniel","last_name":"Pinschewer","full_name":"Pinschewer, Daniel"},{"full_name":"Bennett, Keiryn","first_name":"Keiryn","last_name":"Bennett"},{"full_name":"Menche, Jörg","last_name":"Menche","first_name":"Jörg"},{"full_name":"Bergthaler, Andreas","first_name":"Andreas","last_name":"Bergthaler"}],"oa":1,"date_updated":"2021-01-12T08:01:48Z","citation":{"ieee":"K. Khamina <i>et al.</i>, “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” <i>PLoS Pathogens</i>, vol. 13, no. 12. Public Library of Science, 2017.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. <i>PLoS Pathogens</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.ppat.1006758\">https://doi.org/10.1371/journal.ppat.1006758</a>","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” <i>PLoS Pathogens</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.ppat.1006758\">https://doi.org/10.1371/journal.ppat.1006758</a>.","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” <i>PLoS Pathogens</i>, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.ppat.1006758\">10.1371/journal.ppat.1006758</a>.","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. <i>PLoS Pathogens</i>. 2017;13(12). doi:<a href=\"https://doi.org/10.1371/journal.ppat.1006758\">10.1371/journal.ppat.1006758</a>"},"day":"01","file":[{"file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","date_updated":"2020-07-14T12:46:44Z","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","date_created":"2018-12-12T10:12:26Z","relation":"main_file","file_id":"4944","creator":"system","file_size":4106772,"access_level":"open_access","content_type":"application/pdf"}],"volume":13,"has_accepted_license":"1","month":"12","date_created":"2018-12-11T11:47:03Z","date_published":"2017-12-01T00:00:00Z"},{"ec_funded":1,"abstract":[{"text":"While we have good understanding of bacterial metabolism at the population level, we know little about the metabolic behavior of individual cells: do single cells in clonal populations sometimes specialize on different metabolic pathways? Such metabolic specialization could be driven by stochastic gene expression and could provide individual cells with growth benefits of specialization. We measured the degree of phenotypic specialization in two parallel metabolic pathways, the assimilation of glucose and arabinose. We grew Escherichia coli in chemostats, and used isotope-labeled sugars in combination with nanometer-scale secondary ion mass spectrometry and mathematical modeling to quantify sugar assimilation at the single-cell level. We found large variation in metabolic activities between single cells, both in absolute assimilation and in the degree to which individual cells specialize in the assimilation of different sugars. Analysis of transcriptional reporters indicated that this variation was at least partially based on cell-to-cell variation in gene expression. Metabolic differences between cells in clonal populations could potentially reduce metabolic incompatibilities between different pathways, and increase the rate at which parallel reactions can be performed.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:46Z","publication_identifier":{"issn":["15537390"]},"language":[{"iso":"eng"}],"_id":"541","publication_status":"published","ddc":["576","579"],"department":[{"_id":"CaGu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publist_id":"7275","doi":"10.1371/journal.pgen.1007122","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","type":"journal_article","year":"2017","scopus_import":1,"pubrep_id":"959","status":"public","title":"Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations","article_number":"e1007122","author":[{"first_name":"Nela","last_name":"Nikolic","orcid":"0000-0001-9068-6090","full_name":"Nikolic, Nela","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schreiber","first_name":"Frank","full_name":"Schreiber, Frank"},{"full_name":"Dal Co, Alma","last_name":"Dal Co","first_name":"Alma"},{"full_name":"Kiviet, Daniel","first_name":"Daniel","last_name":"Kiviet"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","first_name":"Tobias"},{"full_name":"Littmann, Sten","last_name":"Littmann","first_name":"Sten"},{"full_name":"Kuypers, Marcel","first_name":"Marcel","last_name":"Kuypers"},{"last_name":"Ackermann","first_name":"Martin","full_name":"Ackermann, Martin"}],"oa":1,"issue":"12","publication":"PLoS Genetics","intvolume":"        13","quality_controlled":"1","publisher":"Public Library of Science","volume":13,"has_accepted_license":"1","month":"12","date_published":"2017-12-18T00:00:00Z","date_created":"2018-12-11T11:47:04Z","related_material":{"record":[{"status":"public","id":"9844","relation":"research_data"},{"status":"public","id":"9845","relation":"research_data"},{"relation":"research_data","id":"9846","status":"public"}]},"date_updated":"2023-02-23T14:10:34Z","citation":{"chicago":"Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Cell-to-Cell Variation and Specialization in Sugar Metabolism in Clonal Bacterial Populations.” <i>PLoS Genetics</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pgen.1007122\">https://doi.org/10.1371/journal.pgen.1007122</a>.","mla":"Nikolic, Nela, et al. “Cell-to-Cell Variation and Specialization in Sugar Metabolism in Clonal Bacterial Populations.” <i>PLoS Genetics</i>, vol. 13, no. 12, e1007122, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007122\">10.1371/journal.pgen.1007122</a>.","ista":"Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. PLoS Genetics. 13(12), e1007122.","ama":"Nikolic N, Schreiber F, Dal Co A, et al. Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. <i>PLoS Genetics</i>. 2017;13(12). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007122\">10.1371/journal.pgen.1007122</a>","ieee":"N. Nikolic <i>et al.</i>, “Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations,” <i>PLoS Genetics</i>, vol. 13, no. 12. Public Library of Science, 2017.","apa":"Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007122\">https://doi.org/10.1371/journal.pgen.1007122</a>","short":"N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, PLoS Genetics 13 (2017)."},"day":"18","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":1308475,"relation":"main_file","file_id":"5088","creator":"system","date_created":"2018-12-12T10:14:35Z","checksum":"22426d9382f21554bad5fa5967afcfd0","date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2018-959-v1+1_2017_Nikolic_Cell-to-cell.pdf"}]},{"file":[{"file_name":"IST-2018-929-v1+1_56106.pdf","date_updated":"2020-07-14T12:46:58Z","checksum":"e1f05e5850dfd9f9434d2d373ca61941","date_created":"2018-12-12T10:12:49Z","relation":"main_file","file_id":"4969","creator":"system","file_size":7443683,"access_level":"open_access","content_type":"application/pdf"}],"day":"17","citation":{"chicago":"Mazur, Ewa, and Jiří Friml. “Vascular Tissue Development and Regeneration in the Model Plant Arabidopsis.” In <i>Plant Engineering</i>, edited by Snježana Jurić, 113–40. Plant Engineering. InTech, 2017. <a href=\"https://doi.org/10.5772/intechopen.69712\">https://doi.org/10.5772/intechopen.69712</a>.","ista":"Mazur E, Friml J. 2017.Vascular tissue development and regeneration in the model plant arabidopsis. In: Plant Engineering. Agricultural and Biological Sciences, , 113–140.","ama":"Mazur E, Friml J. Vascular tissue development and regeneration in the model plant arabidopsis. In: Jurić S, ed. <i>Plant Engineering</i>. Plant Engineering. InTech; 2017:113-140. doi:<a href=\"https://doi.org/10.5772/intechopen.69712\">10.5772/intechopen.69712</a>","mla":"Mazur, Ewa, and Jiří Friml. “Vascular Tissue Development and Regeneration in the Model Plant Arabidopsis.” <i>Plant Engineering</i>, edited by Snježana Jurić, InTech, 2017, pp. 113–40, doi:<a href=\"https://doi.org/10.5772/intechopen.69712\">10.5772/intechopen.69712</a>.","apa":"Mazur, E., &#38; Friml, J. (2017). Vascular tissue development and regeneration in the model plant arabidopsis. In S. Jurić (Ed.), <i>Plant Engineering</i> (pp. 113–140). InTech. <a href=\"https://doi.org/10.5772/intechopen.69712\">https://doi.org/10.5772/intechopen.69712</a>","short":"E. Mazur, J. Friml, in:, S. Jurić (Ed.), Plant Engineering, InTech, 2017, pp. 113–140.","ieee":"E. Mazur and J. Friml, “Vascular tissue development and regeneration in the model plant arabidopsis,” in <i>Plant Engineering</i>, S. Jurić, Ed. InTech, 2017, pp. 113–140."},"editor":[{"first_name":"Snježana","last_name":"Jurić","full_name":"Jurić, Snježana"}],"date_updated":"2024-02-12T12:03:42Z","related_material":{"record":[{"relation":"earlier_version","id":"1274","status":"public"}]},"date_published":"2017-11-17T00:00:00Z","date_created":"2018-12-11T11:47:05Z","month":"11","has_accepted_license":"1","publisher":"InTech","page":"113 - 140","quality_controlled":"1","publication":"Plant Engineering","oa":1,"author":[{"first_name":"Ewa","last_name":"Mazur","full_name":"Mazur, Ewa"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"title":"Vascular tissue development and regeneration in the model plant arabidopsis","status":"public","pubrep_id":"929","type":"book_chapter","year":"2017","oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.5772/intechopen.69712","publist_id":"7269","project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"series_title":"Plant Engineering","ddc":["581"],"publication_status":"published","_id":"545","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:58Z","alternative_title":["Agricultural and Biological Sciences"],"abstract":[{"text":"Development of vascular tissue is a remarkable example of intercellular communication and coordinated development involving hormonal signaling and tissue polarity. Thus far, studies on vascular patterning and regeneration have been conducted mainly in trees—woody plants—with a well-developed layer of vascular cambium and secondary tissues. Trees are difficult to use as genetic models, i.e., due to long generation time, unstable environmental conditions, and lack of available mutants and transgenic lines. Therefore, the use of the main genetic model plant Arabidopsis thaliana (L.) Heynh., with a wealth of available marker and transgenic lines, provides a unique opportunity to address molecular mechanism of vascular tissue formation and regeneration. With specific treatments, the tiny weed Arabidopsis can serve as a model to understand the growth of mighty trees and interconnect a tree physiology with molecular genetics and cell biology of Arabidopsis.","lang":"eng"}],"ec_funded":1},{"month":"06","date_published":"2017-06-26T00:00:00Z","date_created":"2018-12-12T11:39:24Z","pubrep_id":"724","date_updated":"2020-07-14T23:05:03Z","file":[{"checksum":"6321792dcfa82bf490f17615a9b22355","date_updated":"2020-07-14T12:46:59Z","file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf","content_type":"application/pdf","access_level":"open_access","file_size":3460985,"creator":"system","relation":"main_file","file_id":"5483","date_created":"2018-12-12T11:53:22Z"}],"citation":{"ama":"Petritsch B. <i>Implementing the Institutional Data Repository IST DataRep</i>. IST Austria; 2017.","ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","mla":"Petritsch, Barbara. <i>Implementing the Institutional Data Repository IST DataRep</i>. IST Austria, 2017.","chicago":"Petritsch, Barbara. <i>Implementing the Institutional Data Repository IST DataRep</i>. IST Austria, 2017.","apa":"Petritsch, B. (2017). <i>Implementing the institutional data repository IST DataRep</i>. IST Austria.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","ieee":"B. Petritsch, <i>Implementing the institutional data repository IST DataRep</i>. IST Austria, 2017."},"day":"26","type":"report","year":"2017","author":[{"first_name":"Barbara","orcid":"0000-0003-2724-4614","last_name":"Petritsch","full_name":"Barbara Petritsch","id":"406048EC-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"file_date_updated":"2020-07-14T12:46:59Z","status":"public","extern":0,"abstract":[{"text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.","lang":"eng"}],"title":"Implementing the institutional data repository IST DataRep","department":[{"_id":"E-Lib"}],"publication_date":"2017-06-26","publisher":"IST Austria","main_file_link":[{"url":"https://repository.ist.ac.at/id/eprint/724.","open_access":"1"}],"_id":"5450"},{"status":"public","title":"Optimal Dyck reachability for data-dependence and alias analysis","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"}],"oa":1,"publisher":"IST Austria","page":"37","has_accepted_license":"1","month":"10","date_published":"2017-10-23T00:00:00Z","date_created":"2018-12-12T11:39:26Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"10416"}]},"date_updated":"2023-02-21T15:54:10Z","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T11:54:02Z","file_size":960491,"creator":"system","file_id":"5524","relation":"main_file","checksum":"177a84a46e3ac17e87b31534ad16a4c9","file_name":"IST-2017-870-v1+1_main.pdf","date_updated":"2020-07-14T12:46:59Z"}],"citation":{"ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, <i>Optimal Dyck reachability for data-dependence and alias analysis</i>. IST Austria, 2017.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","apa":"Chatterjee, K., Choudhary, B., &#38; Pavlogiannis, A. (2017). <i>Optimal Dyck reachability for data-dependence and alias analysis</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2017-870-v1-1\">https://doi.org/10.15479/AT:IST-2017-870-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Optimal Dyck Reachability for Data-Dependence and Alias Analysis</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-870-v1-1\">10.15479/AT:IST-2017-870-v1-1</a>.","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. <i>Optimal Dyck Reachability for Data-Dependence and Alias Analysis</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-870-v1-1\">10.15479/AT:IST-2017-870-v1-1</a>","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. <i>Optimal Dyck Reachability for Data-Dependence and Alias Analysis</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2017-870-v1-1\">https://doi.org/10.15479/AT:IST-2017-870-v1-1</a>."},"day":"23","abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks."}],"alternative_title":["IST Austria Technical Report"],"article_processing_charge":"No","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:59Z","publication_status":"published","ddc":["000"],"_id":"5455","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","doi":"10.15479/AT:IST-2017-870-v1-1","oa_version":"Published Version","type":"technical_report","year":"2017","pubrep_id":"870"},{"date_updated":"2023-02-23T12:26:54Z","pubrep_id":"872","citation":{"chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2017-872-v1-1\">https://doi.org/10.15479/AT:IST-2017-872-v1-1</a>.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-872-v1-1\">10.15479/AT:IST-2017-872-v1-1</a>","mla":"Chalupa, Marek, et al. <i>Data-Centric Dynamic Partial Order Reduction</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2017-872-v1-1\">10.15479/AT:IST-2017-872-v1-1</a>.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &#38; Vaidya, K. (2017). <i>Data-centric dynamic partial order reduction</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2017-872-v1-1\">https://doi.org/10.15479/AT:IST-2017-872-v1-1</a>","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, <i>Data-centric dynamic partial order reduction</i>. IST Austria, 2017."},"day":"23","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5487","file_size":910347,"date_created":"2018-12-12T11:53:26Z","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","date_updated":"2020-07-14T12:46:59Z","file_name":"IST-2017-872-v1+1_main.pdf"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10417"},{"status":"public","id":"5448","relation":"earlier_version"}]},"type":"technical_report","year":"2017","month":"10","date_published":"2017-10-23T00:00:00Z","date_created":"2018-12-12T11:39:26Z","oa_version":"Published Version","doi":"10.15479/AT:IST-2017-872-v1-1","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"page":"36","publisher":"IST Austria","language":[{"iso":"eng"}],"_id":"5456","publication_status":"published","ddc":["000"],"author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"full_name":"Vaidya, Kapil","first_name":"Kapil","last_name":"Vaidya"}],"alternative_title":["IST Austria Technical Report"],"oa":1,"file_date_updated":"2020-07-14T12:46:59Z","publication_identifier":{"issn":["2664-1690"]},"status":"public","title":"Data-centric dynamic partial order reduction","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes."}]},{"intvolume":"        96","publication":"Physical Review E","publisher":"American Physical Society","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1707.00320"}],"issue":"6","author":[{"first_name":"Daniele","last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"status":"public","article_number":"060401","title":"Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes","date_updated":"2023-10-10T13:29:38Z","day":"21","citation":{"ieee":"D. De Martino, “Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes,” <i>Physical Review E</i>, vol. 96, no. 6. American Physical Society, 2017.","short":"D. De Martino, Physical Review E 96 (2017).","apa":"De Martino, D. (2017). Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.96.060401\">https://doi.org/10.1103/PhysRevE.96.060401</a>","mla":"De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by Constraining Growth-Rate Moments Predicts Coexistence of Phenotypes.” <i>Physical Review E</i>, vol. 96, no. 6, 060401, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevE.96.060401\">10.1103/PhysRevE.96.060401</a>.","ista":"De Martino D. 2017. Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes. Physical Review E. 96(6), 060401.","ama":"De Martino D. Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes. <i>Physical Review E</i>. 2017;96(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.96.060401\">10.1103/PhysRevE.96.060401</a>","chicago":"De Martino, Daniele. “Maximum Entropy Modeling of Metabolic Networks by Constraining Growth-Rate Moments Predicts Coexistence of Phenotypes.” <i>Physical Review E</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevE.96.060401\">https://doi.org/10.1103/PhysRevE.96.060401</a>."},"month":"12","date_created":"2018-12-11T11:47:06Z","date_published":"2017-12-21T00:00:00Z","volume":96,"department":[{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"publication_status":"published","_id":"548","language":[{"iso":"eng"}],"article_processing_charge":"No","alternative_title":["Rapid Communications"],"publication_identifier":{"issn":["2470-0045"]},"ec_funded":1,"abstract":[{"text":"In this work maximum entropy distributions in the space of steady states of metabolic networks are considered upon constraining the first and second moments of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux distributions, emerges upon considering control on the average growth (optimization) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of Escherichia coli where it quantifies the metabolic activity of slow growing phenotypes and it provides a quantitative map with metabolic fluxes, opening the possibility to detect coexistence from flux data. A preliminary analysis on data for E. coli cultures in standard conditions shows degeneracy for the inferred parameters that extend in the coexistence region.","lang":"eng"}],"scopus_import":"1","year":"2017","type":"journal_article","oa_version":"Submitted Version","publist_id":"7266","doi":"10.1103/PhysRevE.96.060401"},{"status":"public","title":"Causality-based model checking","author":[{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"last_name":"Kupriyanov","first_name":"Andrey","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87","full_name":"Kupriyanov, Andrey"}],"oa":1,"publication":"Electronic Proceedings in Theoretical Computer Science","intvolume":"       259","quality_controlled":"1","page":"31 - 38","main_file_link":[{"url":"https://arxiv.org/abs/1710.03391v1","open_access":"1"}],"publisher":"Open Publishing Association","volume":259,"has_accepted_license":"1","month":"10","date_published":"2017-10-10T00:00:00Z","date_created":"2018-12-11T11:47:07Z","conference":{"name":"CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies","end_date":"2017-04-29","location":"Uppsala, Sweden","start_date":"2017-04-29"},"date_updated":"2023-10-17T12:02:46Z","citation":{"short":"B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017, pp. 31–38.","apa":"Finkbeiner, B., &#38; Kupriyanov, A. (2017). Causality-based model checking. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 259, pp. 31–38). Uppsala, Sweden: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>","ieee":"B. Finkbeiner and A. Kupriyanov, “Causality-based model checking,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Uppsala, Sweden, 2017, vol. 259, pp. 31–38.","ama":"Finkbeiner B, Kupriyanov A. Causality-based model checking. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 259. Open Publishing Association; 2017:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>","ista":"Finkbeiner B, Kupriyanov A. 2017. Causality-based model checking. Electronic Proceedings in Theoretical Computer Science. CREST: Causal Reasoning for Embedded and Safety-Critical Systems Technologies, EPTCS, vol. 259, 31–38.","mla":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 259, Open Publishing Association, 2017, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.259.3\">10.4204/EPTCS.259.3</a>.","chicago":"Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 259:31–38. Open Publishing Association, 2017. <a href=\"https://doi.org/10.4204/EPTCS.259.3\">https://doi.org/10.4204/EPTCS.259.3</a>."},"day":"10","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:12:21Z","relation":"main_file","creator":"system","file_id":"4939","file_size":209294,"checksum":"6274f6c0da3376a7b079180d81568518","file_name":"IST-2018-925-v1+1_1710.03391v1.pdf","date_updated":"2020-07-14T12:47:00Z"}],"abstract":[{"lang":"eng","text":"Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a new class of model checking algorithms that capture the causal relationships in a special data structure called concurrent traces. Concurrent traces identify key events in an execution history and link them through their cause-effect relationships. The model checker builds a tableau of concurrent traces, where the case splits represent different causal explanations of a hypothetical error. Causality-based model checking has been implemented in the ARCTOR tool, and applied to previously intractable multi-threaded benchmarks."}],"article_processing_charge":"No","alternative_title":["EPTCS"],"file_date_updated":"2020-07-14T12:47:00Z","publication_identifier":{"issn":["2075-2180"]},"language":[{"iso":"eng"}],"_id":"549","ddc":["004"],"publication_status":"published","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"doi":"10.4204/EPTCS.259.3","publist_id":"7264","oa_version":"Submitted Version","type":"conference","year":"2017","scopus_import":"1","pubrep_id":"925"},{"year":"2017","type":"journal_article","scopus_import":1,"pubrep_id":"926","doi":"10.1214/17-ECP97","publist_id":"7265","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","language":[{"iso":"eng"}],"_id":"550","ddc":["539"],"publication_status":"published","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities."}],"file_date_updated":"2020-07-14T12:47:00Z","publication_identifier":{"issn":["1083589X"]},"related_material":{"record":[{"relation":"dissertation_contains","id":"149","status":"public"}]},"date_updated":"2023-09-07T12:38:08Z","citation":{"chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>.","ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","ama":"Alt J. Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>.","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>","short":"J. Alt, Electronic Communications in Probability 22 (2017).","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” <i>Electronic Communications in Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017."},"day":"21","file":[{"file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","date_updated":"2020-07-14T12:47:00Z","checksum":"0ec05303a0de190de145654237984c79","date_created":"2018-12-12T10:08:04Z","file_size":470876,"relation":"main_file","creator":"system","file_id":"4663","access_level":"open_access","content_type":"application/pdf"}],"volume":22,"has_accepted_license":"1","month":"11","date_published":"2017-11-21T00:00:00Z","date_created":"2018-12-11T11:47:07Z","publication":"Electronic Communications in Probability","intvolume":"        22","quality_controlled":"1","publisher":"Institute of Mathematical Statistics","status":"public","title":"Singularities of the density of states of random Gram matrices","article_number":"63","author":[{"last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"}],"oa":1},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","intvolume":"        83","publication":"Leibniz International Proceedings in Informatics","article_number":"61","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","status":"public","oa":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21"},"file":[{"date_created":"2018-12-12T10:18:04Z","creator":"system","relation":"main_file","file_id":"5322","file_size":535077,"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_updated":"2020-07-14T12:47:00Z","checksum":"2eed5224c0e4e259484a1d71acb8ba6a"}],"day":"01","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>."},"date_updated":"2021-01-12T08:02:34Z","has_accepted_license":"1","volume":83,"date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:08Z","month":"11","ddc":["004"],"publication_status":"published","language":[{"iso":"eng"}],"_id":"551","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. "}],"publication_identifier":{"isbn":["978-395977046-0"]},"file_date_updated":"2020-07-14T12:47:00Z","alternative_title":["LIPIcs"],"scopus_import":1,"type":"conference","year":"2017","pubrep_id":"924","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"7263","doi":"10.4230/LIPIcs.MFCS.2017.61","oa_version":"Published Version"},{"status":"public","title":"Faster algorithms for mean-payoff parity games","article_number":"39","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"oa":1,"publication":"Leibniz International Proceedings in Informatics","intvolume":"        83","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":83,"has_accepted_license":"1","month":"11","date_created":"2018-12-11T11:47:08Z","date_published":"2017-11-01T00:00:00Z","conference":{"end_date":"2017-08-25","start_date":"2017-08-21","location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"date_updated":"2023-02-14T10:06:46Z","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Henzinger, M. H., &#38; Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>.","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>"},"day":"01","file":[{"checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_updated":"2020-07-14T12:47:00Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:16:57Z","relation":"main_file","creator":"system","file_id":"5248","file_size":610339}],"ec_funded":1,"abstract":[{"text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).","lang":"eng"}],"alternative_title":["LIPIcs"],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:00Z","publication_identifier":{"isbn":["978-395977046-0"]},"language":[{"iso":"eng"}],"_id":"552","ddc":["004"],"publication_status":"published","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"publist_id":"7262","doi":"10.4230/LIPIcs.MFCS.2017.39","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"oa_version":"Published Version","type":"conference","year":"2017","scopus_import":"1","pubrep_id":"923"},{"abstract":[{"lang":"eng","text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. "}],"publication_identifier":{"isbn":["978-395977046-0"]},"file_date_updated":"2020-07-14T12:47:00Z","alternative_title":["LIPIcs"],"ddc":["004"],"publication_status":"published","_id":"553","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"7261","doi":"10.4230/LIPIcs.MFCS.2017.55","oa_version":"Published Version","scopus_import":1,"year":"2017","type":"conference","pubrep_id":"922","article_number":"55","title":"Strategy complexity of concurrent safety games","status":"public","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Hansen","first_name":"Kristofer","full_name":"Hansen, Kristofer"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.02434"}],"quality_controlled":"1","intvolume":"        83","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","volume":83,"date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:08Z","month":"11","conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"file":[{"file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_updated":"2020-07-14T12:47:00Z","checksum":"7101facb56ade363205c695d72dbd173","date_created":"2018-12-12T10:09:29Z","file_size":549967,"relation":"main_file","creator":"system","file_id":"4753","access_level":"open_access","content_type":"application/pdf"}],"citation":{"chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>.","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>.","apa":"Chatterjee, K., Hansen, K., &#38; Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83."},"day":"01","date_updated":"2021-01-12T08:02:35Z"},{"related_material":{"record":[{"relation":"research_paper","id":"5452","status":"public"},{"relation":"research_paper","id":"5751","status":"public"}]},"type":"research_data","year":"2017","date_updated":"2024-02-21T13:48:42Z","day":"02","citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. 2017. Strong amplifiers of natural selection, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. Strong amplifiers of natural selection. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>","mla":"Pavlogiannis, Andreas, et al. <i>Strong Amplifiers of Natural Selection</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>."},"file":[{"content_type":"video/mp4","access_level":"open_access","creator":"system","file_id":"5644","relation":"main_file","file_size":32987015,"date_created":"2018-12-12T13:05:18Z","checksum":"b427dd46a30096a1911b245640c47af8","date_updated":"2020-07-14T12:47:02Z","file_name":"IST-2017-51-v1+2_illustration.mp4"}],"doi":"10.15479/AT:ISTA:51","has_accepted_license":"1","month":"01","date_created":"2018-12-12T12:31:32Z","date_published":"2017-01-02T00:00:00Z","oa_version":"Published Version","_id":"5559","ddc":["519"],"datarep_id":"51","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"keyword":["natural selection"],"project":[{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"status":"public","title":"Strong amplifiers of natural selection","abstract":[{"lang":"eng","text":"Strong amplifiers of natural selection"}],"article_processing_charge":"No","author":[{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak , Martin","first_name":"Martin","last_name":"Nowak "}],"oa":1,"file_date_updated":"2020-07-14T12:47:02Z"},{"author":[{"last_name":"Bergmiller","orcid":"0000-0001-5396-4346","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias"},{"full_name":"Andersson, Anna M","id":"2B8A40DA-F248-11E8-B48F-1D18A9856A87","first_name":"Anna M","orcid":"0000-0003-2912-6769","last_name":"Andersson"},{"first_name":"Kathrin","orcid":"0000-0003-3768-877X","last_name":"Tomasek","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","full_name":"Tomasek, Kathrin"},{"last_name":"Balleza","first_name":"Enrique","full_name":"Balleza, Enrique"},{"first_name":"Daniel","last_name":"Kiviet","full_name":"Kiviet, Daniel"},{"orcid":"0000-0001-9843-3522","last_name":"Hauschild","first_name":"Robert","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:03Z","oa":1,"status":"public","title":"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity","abstract":[{"lang":"eng","text":"This repository contains the data collected for the manuscript \"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity\".\r\nThe data is compressed into a single archive. Within the archive, different folders correspond to figures of the main text and the SI of the related publication.\r\nData is saved as plain text, with each folder containing a separate readme file describing the format. Typically, the data is from fluorescence microscopy measurements of single cells growing in a microfluidic \"mother machine\" device, and consists of relevant values (primarily arbitrary unit or normalized fluorescence measurements, and division times / growth rates) after raw microscopy images have been processed, segmented, and their features extracted, as described in the methods section of the related publication."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"Bio"}],"keyword":["single cell microscopy","mother machine microfluidic device","AcrAB-TolC pump","multi-drug efflux","Escherichia coli"],"publisher":"Institute of Science and Technology Austria","_id":"5560","ddc":["571"],"datarep_id":"53","month":"03","license":"https://creativecommons.org/publicdomain/zero/1.0/","date_created":"2018-12-12T12:31:32Z","date_published":"2017-03-10T00:00:00Z","oa_version":"Published Version","doi":"10.15479/AT:ISTA:53","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:49:00Z","day":"10","citation":{"ama":"Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>","ista":"Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik G, Guet CC. 2017. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>.","mla":"Bergmiller, Tobias, et al. <i>Biased Partitioning of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</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 Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>.","apa":"Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild, R., … Guet, C. C. (2017). Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>","short":"T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild, G. Tkačik, C.C. Guet, (2017).","ieee":"T. Bergmiller <i>et al.</i>, “Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity.” Institute of Science and Technology Austria, 2017."},"file":[{"content_type":"application/zip","access_level":"open_access","file_id":"5603","relation":"main_file","creator":"system","file_size":6773204,"date_created":"2018-12-12T13:02:38Z","checksum":"d77859af757ac8025c50c7b12b52eaf3","date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-53-v1+1_Data_MDE.zip"}],"related_material":{"record":[{"status":"public","relation":"research_paper","id":"665"}]},"type":"research_data","year":"2017"}]