[{"publisher":"ACM","doi":"10.1145/3355089.3356576","article_processing_charge":"No","type":"journal_article","date_updated":"2024-03-25T23:30:26Z","_id":"7117","ddc":["000"],"quality_controlled":"1","external_id":{"isi":["000498397300007"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12897"}]},"year":"2019","isi":1,"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"status":"public","publication":"ACM Transactions on Graphics","date_published":"2019-11-06T00:00:00Z","ec_funded":1,"title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","oa_version":"Submitted Version","author":[{"last_name":"Hafner","full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"first_name":"Christian","last_name":"Schumacher","full_name":"Schumacher, Christian"},{"full_name":"Knoop, Espen","last_name":"Knoop","first_name":"Espen"},{"last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","first_name":"Thomas"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"},{"first_name":"Moritz","last_name":"Bächer","full_name":"Bächer, Moritz"}],"day":"06","scopus_import":"1","article_type":"original","date_created":"2019-11-26T14:22:09Z","volume":38,"abstract":[{"text":"We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models.","lang":"eng"}],"intvolume":"        38","has_accepted_license":"1","publication_identifier":{"issn":["0730-0301"]},"publication_status":"published","file_date_updated":"2020-07-14T12:47:49Z","month":"11","article_number":"157","file":[{"creator":"bbickel","date_updated":"2020-07-14T12:47:49Z","file_size":1673176,"date_created":"2019-11-26T14:24:26Z","file_id":"7119","title":"X-CAD Supplemental Material","access_level":"open_access","content_type":"application/pdf","file_name":"xcad_sup_mat_siga19.pdf","checksum":"56a2fb019adcb556d2b022f5e5acb68c","relation":"supplementary_material"},{"file_id":"7120","title":"X-CAD: Optimizing CAD Models with Extended Finite Elements","file_size":14563618,"date_created":"2019-11-26T14:24:27Z","creator":"bbickel","date_updated":"2020-07-14T12:47:49Z","relation":"main_file","checksum":"5f29d76aceb5102e766cbab9b17d776e","description":"This is the author's version of the work.","file_name":"XCAD_authors_version.pdf","access_level":"open_access","content_type":"application/pdf"},{"file_id":"7121","file_size":259979129,"date_created":"2019-11-26T14:27:37Z","date_updated":"2020-07-14T12:47:49Z","creator":"bbickel","relation":"main_file","checksum":"0d31e123286cbec9e28b2001c2bb0d55","file_name":"XCAD_video.mp4","access_level":"open_access","content_type":"video/mp4"}],"department":[{"_id":"BeBi"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"6","citation":{"ama":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing CAD Models with Extended Finite Elements. <i>ACM Transactions on Graphics</i>. 2019;38(6). doi:<a href=\"https://doi.org/10.1145/3355089.3356576\">10.1145/3355089.3356576</a>","ieee":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer, “X-CAD: Optimizing CAD Models with Extended Finite Elements,” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6. ACM, 2019.","short":"C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM Transactions on Graphics 38 (2019).","chicago":"Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger, Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” <i>ACM Transactions on Graphics</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3355089.3356576\">https://doi.org/10.1145/3355089.3356576</a>.","ista":"Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 38(6), 157.","apa":"Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., &#38; Bächer, M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3355089.3356576\">https://doi.org/10.1145/3355089.3356576</a>","mla":"Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” <i>ACM Transactions on Graphics</i>, vol. 38, no. 6, 157, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3355089.3356576\">10.1145/3355089.3356576</a>."}},{"scopus_import":"1","article_processing_charge":"No","day":"21","author":[{"last_name":"Khirirat","full_name":"Khirirat, Sarit","first_name":"Sarit"},{"last_name":"Johansson","full_name":"Johansson, Mikael","first_name":"Mikael"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"doi":"10.1109/cdc.2018.8619625","oa_version":"None","title":"Gradient compression for communication-limited convex optimization","publisher":"IEEE","_id":"7122","date_updated":"2023-09-06T11:14:55Z","date_created":"2019-11-26T15:07:49Z","type":"conference","abstract":[{"lang":"eng","text":"Data-rich applications in machine-learning and control have motivated an intense research on large-scale optimization. Novel algorithms have been proposed and shown to have optimal convergence rates in terms of iteration counts. However, their practical performance is severely degraded by the cost of exchanging high-dimensional gradient vectors between computing nodes. Several gradient compression heuristics have recently been proposed to reduce communications, but few theoretical results exist that quantify how they impact algorithm convergence. This paper establishes and strengthens the convergence guarantees for gradient descent under a family of gradient compression techniques. For convex optimization problems, we derive admissible step sizes and quantify both the number of iterations and the number of bits that need to be exchanged to reach a target accuracy. Finally, we validate the performance of different gradient compression techniques in simulations. The numerical results highlight the properties of different gradient compression algorithms and confirm that fast convergence with limited information exchange is possible."}],"publication_status":"published","publication_identifier":{"issn":["0743-1546"],"isbn":["9781538613955"]},"quality_controlled":"1","year":"2019","isi":1,"month":"01","external_id":{"isi":["000458114800023"]},"department":[{"_id":"DaAl"}],"article_number":"8619625","publication":"2018 IEEE Conference on Decision and Control","status":"public","language":[{"iso":"eng"}],"citation":{"apa":"Khirirat, S., Johansson, M., &#38; Alistarh, D.-A. (2019). Gradient compression for communication-limited convex optimization. In <i>2018 IEEE Conference on Decision and Control</i>. Miami Beach, FL, United States: IEEE. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>","mla":"Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.” <i>2018 IEEE Conference on Decision and Control</i>, 8619625, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>.","chicago":"Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In <i>2018 IEEE Conference on Decision and Control</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>.","ista":"Khirirat S, Johansson M, Alistarh D-A. 2019. Gradient compression for communication-limited convex optimization. 2018 IEEE Conference on Decision and Control. CDC: Conference on Decision and Control, 8619625.","ieee":"S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in <i>2018 IEEE Conference on Decision and Control</i>, Miami Beach, FL, United States, 2019.","short":"S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.","ama":"Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: <i>2018 IEEE Conference on Decision and Control</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"location":"Miami Beach, FL, United States","end_date":"2018-12-19","start_date":"2018-12-17","name":"CDC: Conference on Decision and Control"},"date_published":"2019-01-21T00:00:00Z"},{"month":"06","supervisor":[{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","first_name":"Harald L"}],"file":[{"file_size":5054633,"date_created":"2019-11-27T09:06:10Z","date_updated":"2020-07-14T12:47:50Z","creator":"dernst","file_id":"7133","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file","checksum":"34d0fe0f6e0af97b5937205a3e350423"},{"creator":"dernst","date_updated":"2020-07-14T12:47:50Z","file_size":3231837,"date_created":"2019-11-27T09:06:10Z","file_id":"7134","content_type":"application/pdf","access_level":"open_access","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.pdf","checksum":"140dfb5e3df7edca34f4b6fcc55d876f","relation":"main_file"}],"department":[{"_id":"HaJa"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria.","chicago":"Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>.","apa":"Mckenzie, C. (2019). <i>Design and characterization of methods and biological components to realize synthetic neurotransmission</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>","mla":"Mckenzie, Catherine. <i>Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>.","ama":"Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission. 2019. doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019.","short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019."},"oa_version":"Published Version","title":"Design and characterization of methods and biological components to realize synthetic neurotransmission","author":[{"last_name":"Mckenzie","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","full_name":"Mckenzie, Catherine","first_name":"Catherine"}],"day":"27","date_created":"2019-11-27T09:07:14Z","abstract":[{"text":"A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing.","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2020-07-14T12:47:50Z","related_material":{"record":[{"id":"6266","status":"public","relation":"old_edition"}]},"year":"2019","status":"public","degree_awarded":"PhD","date_published":"2019-06-27T00:00:00Z","publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:7132","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"type":"dissertation","date_updated":"2024-03-25T23:30:11Z","_id":"7132","ddc":["571","573"],"page":"95"},{"article_number":"8849240","department":[{"_id":"KrPi"}],"month":"07","arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. Skórski, “Strong chain rules for min-entropy under few bits spoiled,” in <i>2019 IEEE International Symposium on Information Theory</i>, Paris, France, 2019.","short":"M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019.","ama":"Skórski M. Strong chain rules for min-entropy under few bits spoiled. In: <i>2019 IEEE International Symposium on Information Theory</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>","apa":"Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In <i>2019 IEEE International Symposium on Information Theory</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>","mla":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” <i>2019 IEEE International Symposium on Information Theory</i>, 8849240, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>.","chicago":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” In <i>2019 IEEE International Symposium on Information Theory</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>.","ista":"Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8849240."},"language":[{"iso":"eng"}],"oa":1,"date_created":"2019-11-28T10:19:21Z","oa_version":"Preprint","title":"Strong chain rules for min-entropy under few bits spoiled","scopus_import":"1","day":"01","author":[{"first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","last_name":"Skórski"}],"publication_status":"published","publication_identifier":{"isbn":["9781538692912"]},"abstract":[{"lang":"eng","text":"It is well established that the notion of min-entropy fails to satisfy the \\emph{chain rule} of the form H(X,Y)=H(X|Y)+H(Y), known for Shannon Entropy. Such a property would help to analyze how min-entropy is split among smaller blocks. Problems of this kind arise for example when constructing extractors and dispersers.\r\nWe show that any sequence of variables exhibits a very strong strong block-source structure (conditional distributions of blocks are nearly flat) when we \\emph{spoil few correlated bits}. This implies, conditioned on the spoiled bits, that \\emph{splitting-recombination properties} hold. In particular, we have many nice properties that min-entropy doesn't obey in general, for example strong chain rules, \"information can't hurt\" inequalities, equivalences of average and worst-case conditional entropy definitions and others. Quantitatively, for any sequence X1,…,Xt of random variables over an alphabet X we prove that, when conditioned on m=t⋅O(loglog|X|+loglog(1/ϵ)+logt) bits of auxiliary information, all conditional distributions of the form Xi|X<i are ϵ-close to be nearly flat (only a constant factor away). The argument is combinatorial (based on simplex coverings).\r\nThis result may be used as a generic tool for \\emph{exhibiting block-source structures}. We demonstrate this by reproving the fundamental converter due to Nisan and Zuckermann (\\emph{J. Computer and System Sciences, 1996}), which shows that sampling blocks from a min-entropy source roughly preserves the entropy rate. Our bound implies, only by straightforward chain rules, an additive loss of o(1) (for sufficiently many samples), which qualitatively meets the first tighter analysis of this problem due to Vadhan (\\emph{CRYPTO'03}), obtained by large deviation techniques. "}],"external_id":{"isi":["000489100301043"],"arxiv":["1702.08476"]},"isi":1,"year":"2019","conference":{"name":"ISIT: International Symposium on Information Theory","start_date":"2019-07-07","end_date":"2019-07-12","location":"Paris, France"},"date_published":"2019-07-01T00:00:00Z","status":"public","publication":"2019 IEEE International Symposium on Information Theory","type":"conference","_id":"7136","date_updated":"2023-09-06T11:15:41Z","publisher":"IEEE","article_processing_charge":"No","doi":"10.1109/isit.2019.8849240","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.08476"}]},{"_id":"7143","date_updated":"2023-09-06T11:20:58Z","type":"journal_article","article_processing_charge":"No","doi":"10.1038/s41422-019-0254-4","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41422-019-0254-4"}],"quality_controlled":"1","page":"965-966","year":"2019","isi":1,"external_id":{"isi":["000500749600001"],"pmid":["31745287"]},"pmid":1,"date_published":"2019-12-01T00:00:00Z","publication":"Cell Research","status":"public","volume":29,"date_created":"2019-12-02T12:30:48Z","article_type":"original","day":"01","scopus_import":"1","author":[{"full_name":"Sinclair, Scott A","id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87","last_name":"Sinclair","first_name":"Scott A","orcid":"0000-0002-4566-0593"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"}],"title":"Defying gravity: a plant's quest for moisture","oa_version":"Published Version","publication_status":"published","publication_identifier":{"eissn":["1748-7838"],"issn":["1001-0602"]},"abstract":[{"lang":"eng","text":"Roots grow downwards parallel to the gravity vector, to anchor a plant in soil and acquire water and nutrients, using a gravitropic mechanism dependent on the asymmetric distribution of the phytohormone auxin. Recently, Chang et al. demonstrate that asymmetric distribution of another phytohormone, cytokinin, directs root growth towards higher water content."}],"intvolume":"        29","department":[{"_id":"JiFr"}],"month":"12","citation":{"apa":"Sinclair, S. A., &#38; Friml, J. (2019). Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>","mla":"Sinclair, Scott A., and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>, vol. 29, Springer Nature, 2019, pp. 965–66, doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>.","ista":"Sinclair SA, Friml J. 2019. Defying gravity: a plant’s quest for moisture. Cell Research. 29, 965–966.","chicago":"Sinclair, Scott A, and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>.","ieee":"S. A. Sinclair and J. Friml, “Defying gravity: a plant’s quest for moisture,” <i>Cell Research</i>, vol. 29. Springer Nature, pp. 965–966, 2019.","short":"S.A. Sinclair, J. Friml, Cell Research 29 (2019) 965–966.","ama":"Sinclair SA, Friml J. Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. 2019;29:965-966. doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1908.05549","open_access":"1"}],"quality_controlled":"1","doi":"10.1103/physrevb.100.205412","article_processing_charge":"No","publisher":"American Physical Society","date_updated":"2024-02-28T13:13:51Z","_id":"7145","type":"journal_article","status":"public","publication":"Physical Review B","date_published":"2019-11-15T00:00:00Z","isi":1,"year":"2019","external_id":{"arxiv":["1908.05549"],"isi":["000495967500006"]},"intvolume":"       100","abstract":[{"lang":"eng","text":"End-to-end correlated bound states are investigated in superconductor-semiconductor hybrid nanowires at zero magnetic field. Peaks in subgap conductance are independently identified from each wire end, and a cross-correlation function is computed that counts end-to-end coincidences, averaging over thousands of subgap features. Strong correlations in a short, 300-nm device are reduced by a factor of 4 in a long, 900-nm device. In addition, subgap conductance distributions are investigated, and correlations between the left and right distributions are identified based on their mutual information."}],"publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"publication_status":"published","author":[{"last_name":"Anselmetti","full_name":"Anselmetti, G. L. R.","first_name":"G. L. R."},{"first_name":"E. A.","full_name":"Martinez, E. A.","last_name":"Martinez"},{"first_name":"G. C.","last_name":"Ménard","full_name":"Ménard, G. C."},{"last_name":"Puglia","full_name":"Puglia, D.","first_name":"D."},{"first_name":"F. K.","last_name":"Malinowski","full_name":"Malinowski, F. K."},{"first_name":"J. S.","full_name":"Lee, J. S.","last_name":"Lee"},{"first_name":"S.","full_name":"Choi, S.","last_name":"Choi"},{"full_name":"Pendharkar, M.","last_name":"Pendharkar","first_name":"M."},{"full_name":"Palmstrøm, C. J.","last_name":"Palmstrøm","first_name":"C. J."},{"last_name":"Marcus","full_name":"Marcus, C. M.","first_name":"C. M."},{"first_name":"L.","last_name":"Casparis","full_name":"Casparis, L."},{"full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","last_name":"Higginbotham","orcid":"0000-0003-2607-2363","first_name":"Andrew P"}],"scopus_import":"1","day":"15","title":"End-to-end correlated subgap states in hybrid nanowires","oa_version":"Preprint","volume":100,"article_type":"original","date_created":"2019-12-04T16:02:25Z","oa":1,"language":[{"iso":"eng"}],"issue":"20","citation":{"ieee":"G. L. R. Anselmetti <i>et al.</i>, “End-to-end correlated subgap states in hybrid nanowires,” <i>Physical Review B</i>, vol. 100, no. 20. American Physical Society, 2019.","short":"G.L.R. Anselmetti, E.A. Martinez, G.C. Ménard, D. Puglia, F.K. Malinowski, J.S. Lee, S. Choi, M. Pendharkar, C.J. Palmstrøm, C.M. Marcus, L. Casparis, A.P. Higginbotham, Physical Review B 100 (2019).","ama":"Anselmetti GLR, Martinez EA, Ménard GC, et al. End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. 2019;100(20). doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>","apa":"Anselmetti, G. L. R., Martinez, E. A., Ménard, G. C., Puglia, D., Malinowski, F. K., Lee, J. S., … Higginbotham, A. P. (2019). End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>","mla":"Anselmetti, G. L. R., et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>, vol. 100, no. 20, 205412, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>.","ista":"Anselmetti GLR, Martinez EA, Ménard GC, Puglia D, Malinowski FK, Lee JS, Choi S, Pendharkar M, Palmstrøm CJ, Marcus CM, Casparis L, Higginbotham AP. 2019. End-to-end correlated subgap states in hybrid nanowires. Physical Review B. 100(20), 205412.","chicago":"Anselmetti, G. L. R., E. A. Martinez, G. C. Ménard, D. Puglia, F. K. Malinowski, J. S. Lee, S. Choi, et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"month":"11","department":[{"_id":"AnHi"}],"article_number":"205412"},{"scopus_import":"1","day":"25","author":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Vicoso, Beatriz","last_name":"Vicoso","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"title":"Molecular and evolutionary dynamics of animal sex-chromosome turnover","oa_version":"None","volume":3,"date_created":"2019-12-04T16:05:25Z","article_type":"original","abstract":[{"lang":"eng","text":"Prevailing models of sex-chromosome evolution were largely inspired by the stable and highly differentiated XY pairs of model organisms, such as those of mammals and flies. Recent work has uncovered an incredible diversity of sex-determining systems, bringing some of the assumptions of these traditional models into question. One particular question that has arisen is what drives some sex chromosomes to be maintained over millions of years and differentiate fully, while others are replaced by new sex-determining chromosomes before differentiation has occurred. Here, I review recent data on the variability of sex-determining genes and sex chromosomes in different non-model vertebrates and invertebrates, and discuss some theoretical models that have been put forward to account for this diversity."}],"intvolume":"         3","publication_identifier":{"issn":["2397-334X"]},"publication_status":"published","month":"11","department":[{"_id":"BeVi"}],"language":[{"iso":"eng"}],"citation":{"ama":"Vicoso B. Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. 2019;3(12):1632-1641. doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>","short":"B. Vicoso, Nature Ecology &#38; Evolution 3 (2019) 1632–1641.","ieee":"B. Vicoso, “Molecular and evolutionary dynamics of animal sex-chromosome turnover,” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12. Springer Nature, pp. 1632–1641, 2019.","ista":"Vicoso B. 2019. Molecular and evolutionary dynamics of animal sex-chromosome turnover. Nature Ecology &#38; Evolution. 3(12), 1632–1641.","chicago":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>.","mla":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12, Springer Nature, 2019, pp. 1632–41, doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>.","apa":"Vicoso, B. (2019). Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>"},"issue":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","doi":"10.1038/s41559-019-1050-8","publisher":"Springer Nature","_id":"7146","date_updated":"2023-09-06T11:18:59Z","type":"journal_article","page":"1632-1641","quality_controlled":"1","year":"2019","isi":1,"external_id":{"isi":["000500728800009"]},"status":"public","publication":"Nature Ecology & Evolution","project":[{"_id":"250BDE62-B435-11E9-9278-68D0E5697425","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","call_identifier":"H2020"}],"ec_funded":1,"date_published":"2019-11-25T00:00:00Z"},{"intvolume":"     11773","abstract":[{"lang":"eng","text":"The expression of a gene is characterised by its transcription factors and the function processing them. If the transcription factors are not affected by gene products, the regulating function is often represented as a combinational logic circuit, where the outputs (product) are determined by current input values (transcription factors) only, and are hence independent on their relative arrival times. However, the simultaneous arrival of transcription factors (TFs) in genetic circuits is a strong assumption, given that the processes of transcription and translation of a gene into a protein introduce intrinsic time delays and that there is no global synchronisation among the arrival times of different molecular species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally implementable genetic circuit with two inputs and a single output, such that, in presence of small delays in input arrival, the circuit exhibits qualitatively distinct observable phenotypes. In particular, these phenotypes are long lived transients: they all converge to a single value, but so slowly, that they seem stable for an extended time period, longer than typical experiment duration. We used rule-based language to prototype our circuit, and we implemented a search for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe behaviour of our prototype circuit has wide implications. First, it suggests that GRNs can exploit event timing to create phenotypes. Second, it opens the possibility that GRNs are using event timing to react to stimuli and memorise events, without explicit feedback in regulation. From the modelling perspective, our prototype circuit demonstrates the critical importance of analysing the transient dynamics at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions."}],"publication_status":"published","publication_identifier":{"isbn":["9783030313036","9783030313043"],"issn":["0302-9743"],"eissn":["1611-3349"]},"title":"Transient memory in gene regulation","oa_version":"None","author":[{"orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87","full_name":"Igler, Claudia","last_name":"Igler"},{"first_name":"Tatjana","orcid":"0000-0002-9041-0905","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali"}],"scopus_import":"1","day":"17","date_created":"2019-12-04T16:07:50Z","volume":11773,"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.” In <i>17th International Conference on Computational Methods in Systems Biology</i>, 11773:155–87. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>.","ista":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187.","mla":"Guet, Calin C., et al. “Transient Memory in Gene Regulation.” <i>17th International Conference on Computational Methods in Systems Biology</i>, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>.","apa":"Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &#38; Sezgin, A. (2019). Transient memory in gene regulation. In <i>17th International Conference on Computational Methods in Systems Biology</i> (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">https://doi.org/10.1007/978-3-030-31304-3_9</a>","ama":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene regulation. In: <i>17th International Conference on Computational Methods in Systems Biology</i>. Vol 11773. Springer Nature; 2019:155-187. doi:<a href=\"https://doi.org/10.1007/978-3-030-31304-3_9\">10.1007/978-3-030-31304-3_9</a>","short":"C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.","ieee":"C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in <i>17th International Conference on Computational Methods in Systems Biology</i>, Trieste, Italy, 2019, vol. 11773, pp. 155–187."},"month":"09","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"page":"155-187","quality_controlled":"1","publisher":"Springer Nature","doi":"10.1007/978-3-030-31304-3_9","article_processing_charge":"No","alternative_title":["LNCS"],"type":"conference","date_updated":"2023-09-06T11:18:08Z","_id":"7147","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture","grant_number":"24573"}],"publication":"17th International Conference on Computational Methods in Systems Biology","status":"public","date_published":"2019-09-17T00:00:00Z","conference":{"name":"CMSB: Computational Methods in Systems Biology","start_date":"2019-09-18","end_date":"2019-09-20","location":"Trieste, Italy"},"external_id":{"isi":["000557875100009"]},"isi":1,"year":"2019"},{"has_accepted_license":"1","ddc":["000"],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"file_date_updated":"2020-07-14T12:47:50Z","day":"06","contributor":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","last_name":"Guseinov","orcid":"0000-0001-9819-5077","first_name":"Ruslan"},{"last_name":"McMahan","first_name":"Connor"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez"},{"first_name":"Chiara","last_name":"Daraio"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385"}],"article_processing_charge":"No","author":[{"orcid":"0000-0001-9819-5077","first_name":"Ruslan","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan"}],"doi":"10.15479/AT:ISTA:7154","title":"Supplementary data for \"Programming temporal morphing of self-actuated shells\"","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","_id":"7154","date_updated":"2024-02-21T12:45:03Z","date_created":"2019-12-09T07:52:46Z","type":"research_data","oa":1,"status":"public","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"citation":{"ama":"Guseinov R. Supplementary data for “Programming temporal morphing of self-actuated shells.” 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>","ieee":"R. Guseinov, “Supplementary data for ‘Programming temporal morphing of self-actuated shells.’” Institute of Science and Technology Austria, 2019.","short":"R. Guseinov, (2019).","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Programming Temporal Morphing of Self-Actuated Shells.’” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>.","ista":"Guseinov R. 2019. Supplementary data for ‘Programming temporal morphing of self-actuated shells’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>.","apa":"Guseinov, R. (2019). Supplementary data for “Programming temporal morphing of self-actuated shells.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Programming Temporal Morphing of Self-Actuated Shells.”</i> Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2019-12-06T00:00:00Z","year":"2019","month":"12","related_material":{"record":[{"status":"deleted","relation":"used_in_publication","id":"8433"},{"status":"public","relation":"used_in_publication","id":"7262"}]},"department":[{"_id":"BeBi"}],"file":[{"relation":"main_file","checksum":"155133e6e188e85b3c0676a5e70b9341","file_name":"temporal_morphing_supp_data.zip","content_type":"application/x-zip-compressed","access_level":"open_access","file_id":"7155","date_created":"2019-12-09T07:52:17Z","file_size":65307107,"creator":"dernst","date_updated":"2020-07-14T12:47:50Z"}]},{"year":"2019","isi":1,"external_id":{"arxiv":["1909.01470"],"isi":["000502996200003"]},"project":[{"grant_number":"758053","name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"258047B6-B435-11E9-9278-68D0E5697425","grant_number":"707438","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","call_identifier":"H2020"},{"name":"Hybrid Optomechanical Technologies","grant_number":"732894","call_identifier":"H2020","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"_id":"26927A52-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"F07105","name":"Integrating superconducting quantum circuits"}],"publication":"npj Quantum Information","status":"public","ec_funded":1,"date_published":"2019-12-01T00:00:00Z","doi":"10.1038/s41534-019-0220-5","article_processing_charge":"No","publisher":"Springer Nature","date_updated":"2024-08-07T07:11:55Z","_id":"7156","type":"journal_article","ddc":["530"],"quality_controlled":"1","arxiv":1,"month":"12","department":[{"_id":"JoFi"}],"article_number":"108","file":[{"file_name":"2019_NPJ_Rueda.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"13e0ea1d4f9b5f5710780d9473364f58","file_size":1580132,"date_created":"2019-12-09T08:25:06Z","creator":"dernst","date_updated":"2020-07-14T12:47:50Z","file_id":"7157"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"chicago":"Rueda Sanchez, Alfredo R, William J Hease, Shabir Barzanjeh, and Johannes M Fink. “Electro-Optic Entanglement Source for Microwave to Telecom Quantum State Transfer.” <i>Npj Quantum Information</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41534-019-0220-5\">https://doi.org/10.1038/s41534-019-0220-5</a>.","ista":"Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. 2019. Electro-optic entanglement source for microwave to telecom quantum state transfer. npj Quantum Information. 5, 108.","mla":"Rueda Sanchez, Alfredo R., et al. “Electro-Optic Entanglement Source for Microwave to Telecom Quantum State Transfer.” <i>Npj Quantum Information</i>, vol. 5, 108, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41534-019-0220-5\">10.1038/s41534-019-0220-5</a>.","apa":"Rueda Sanchez, A. R., Hease, W. J., Barzanjeh, S., &#38; Fink, J. M. (2019). Electro-optic entanglement source for microwave to telecom quantum state transfer. <i>Npj Quantum Information</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41534-019-0220-5\">https://doi.org/10.1038/s41534-019-0220-5</a>","ama":"Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. Electro-optic entanglement source for microwave to telecom quantum state transfer. <i>npj Quantum Information</i>. 2019;5. doi:<a href=\"https://doi.org/10.1038/s41534-019-0220-5\">10.1038/s41534-019-0220-5</a>","short":"A.R. Rueda Sanchez, W.J. Hease, S. Barzanjeh, J.M. Fink, Npj Quantum Information 5 (2019).","ieee":"A. R. Rueda Sanchez, W. J. Hease, S. Barzanjeh, and J. M. Fink, “Electro-optic entanglement source for microwave to telecom quantum state transfer,” <i>npj Quantum Information</i>, vol. 5. Springer Nature, 2019."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Alfredo R","orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","last_name":"Rueda Sanchez"},{"id":"29705398-F248-11E8-B48F-1D18A9856A87","full_name":"Hease, William J","last_name":"Hease","orcid":"0000-0001-9868-2166","first_name":"William J"},{"last_name":"Barzanjeh","full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","first_name":"Shabir"},{"full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M"}],"scopus_import":"1","day":"01","title":"Electro-optic entanglement source for microwave to telecom quantum state transfer","oa_version":"Published Version","volume":5,"article_type":"original","date_created":"2019-12-09T08:18:56Z","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"We propose an efficient microwave-photonic modulator as a resource for stationary entangled microwave-optical fields and develop the theory for deterministic entanglement generation and quantum state transfer in multi-resonant electro-optic systems. The device is based on a single crystal whispering gallery mode resonator integrated into a 3D-microwave cavity. The specific design relies on a new combination of thin-film technology and conventional machining that is optimized for the lowest dissipation rates in the microwave, optical, and mechanical domains. We extract important device properties from finite-element simulations and predict continuous variable entanglement generation rates on the order of a Mebit/s for optical pump powers of only a few tens of microwatts. We compare the quantum state transfer fidelities of coherent, squeezed, and non-Gaussian cat states for both teleportation and direct conversion protocols under realistic conditions. Combining the unique capabilities of circuit quantum electrodynamics with the resilience of fiber optic communication could facilitate long-distance solid-state qubit networks, new methods for quantum signal synthesis, quantum key distribution, and quantum enhanced detection, as well as more power-efficient classical sensing and modulation."}],"intvolume":"         5","publication_status":"published","publication_identifier":{"issn":["2056-6387"]},"file_date_updated":"2020-07-14T12:47:50Z"},{"volume":41,"date_created":"2019-12-09T08:33:33Z","article_type":"original","scopus_import":"1","day":"01","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"first_name":"Prateesh","last_name":"Goyal","full_name":"Goyal, Prateesh"},{"first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis"}],"oa_version":"Submitted Version","title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","file_date_updated":"2020-10-08T12:58:10Z","publication_identifier":{"issn":["0164-0925"]},"publication_status":"published","has_accepted_license":"1","intvolume":"        41","abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n"}],"department":[{"_id":"KrCh"}],"article_number":"23","file":[{"success":1,"file_name":"2019_ACMTransactions_Chatterjee.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"291cc86a07bd010d4815e177dac57b70","date_created":"2020-10-08T12:58:10Z","file_size":667357,"date_updated":"2020-10-08T12:58:10Z","creator":"dernst","file_id":"8632"}],"month":"11","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 23, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>.","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>.","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>"},"issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"_id":"7158","date_updated":"2024-03-25T23:30:19Z","type":"journal_article","article_processing_charge":"No","doi":"10.1145/3363525","publisher":"ACM","quality_controlled":"1","ddc":["000"],"year":"2019","isi":1,"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"external_id":{"isi":["000564108400004"]},"ec_funded":1,"date_published":"2019-11-01T00:00:00Z","publication":"ACM Transactions on Programming Languages and Systems","status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}]},{"month":"10","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"citation":{"ieee":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, and J. Deshmukh, “Shape expressions for specifying and extracting signal features,” in <i>19th International Conference on Runtime Verification</i>, Porto, Portugal, 2019, vol. 11757, pp. 292–309.","short":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, J. Deshmukh, in:, 19th International Conference on Runtime Verification, Springer Nature, 2019, pp. 292–309.","ama":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. Shape expressions for specifying and extracting signal features. In: <i>19th International Conference on Runtime Verification</i>. Vol 11757. Springer Nature; 2019:292-309. doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>","apa":"Ničković, D., Qin, X., Ferrere, T., Mateis, C., &#38; Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In <i>19th International Conference on Runtime Verification</i> (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>","mla":"Ničković, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.” <i>19th International Conference on Runtime Verification</i>, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:<a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">10.1007/978-3-030-32079-9_17</a>.","chicago":"Ničković, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.” In <i>19th International Conference on Runtime Verification</i>, 11757:292–309. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-32079-9_17\">https://doi.org/10.1007/978-3-030-32079-9_17</a>.","ista":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. 2019. Shape expressions for specifying and extracting signal features. 19th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 11757, 292–309."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Ničković, Dejan","last_name":"Ničković","first_name":"Dejan"},{"first_name":"Xin","last_name":"Qin","full_name":"Qin, Xin"},{"last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"first_name":"Cristinel","full_name":"Mateis, Cristinel","last_name":"Mateis"},{"last_name":"Deshmukh","full_name":"Deshmukh, Jyotirmoy","first_name":"Jyotirmoy"}],"scopus_import":"1","day":"01","oa_version":"None","title":"Shape expressions for specifying and extracting signal features","volume":11757,"date_created":"2019-12-09T08:47:55Z","intvolume":"     11757","abstract":[{"text":"Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a tremendous amount of generated, measured and recorded time-series data. Extracting temporal segments that encode patterns with useful information out of these huge amounts of data is an extremely difficult problem. We propose shape expressions as a declarative formalism for specifying, querying and extracting sophisticated temporal patterns from possibly noisy data. Shape expressions are regular expressions with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters as atomic predicates and additional constraints on these parameters. We equip shape expressions with a novel noisy semantics that combines regular expression matching semantics with statistical regression. We characterize essential properties of the formalism and propose an efficient approximate shape expression matching procedure. We demonstrate the wide applicability of this technique on two case studies. ","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030320782","9783030320799"]},"year":"2019","isi":1,"external_id":{"isi":["000570006300017"]},"project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"19th International Conference on Runtime Verification","date_published":"2019-10-01T00:00:00Z","conference":{"location":"Porto, Portugal","name":"RV: Runtime Verification","start_date":"2019-10-08","end_date":"2019-10-11"},"doi":"10.1007/978-3-030-32079-9_17","article_processing_charge":"No","alternative_title":["LNCS"],"publisher":"Springer Nature","date_updated":"2023-09-06T11:24:10Z","_id":"7159","type":"conference","page":"292-309","quality_controlled":"1"},{"department":[{"_id":"AnKi"}],"article_number":"dev176297","file":[{"checksum":"b6533c37dc8fbd803ffeca216e0a8b8a","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2019_Development_Guerrero.pdf","file_id":"7177","date_updated":"2020-07-14T12:47:50Z","creator":"dernst","date_created":"2019-12-13T07:34:06Z","file_size":7797881}],"month":"12","issue":"23","citation":{"chicago":"Guerrero, Pilar, Ruben Perez-Carrasco, Marcin P Zagórski, David Page, Anna Kicheva, James Briscoe, and Karen M. Page. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>. The Company of Biologists, 2019. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>.","ista":"Guerrero P, Perez-Carrasco R, Zagórski MP, Page D, Kicheva A, Briscoe J, Page KM. 2019. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. Development. 146(23), dev176297.","apa":"Guerrero, P., Perez-Carrasco, R., Zagórski, M. P., Page, D., Kicheva, A., Briscoe, J., &#38; Page, K. M. (2019). Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>","mla":"Guerrero, Pilar, et al. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>, vol. 146, no. 23, dev176297, The Company of Biologists, 2019, doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>.","ama":"Guerrero P, Perez-Carrasco R, Zagórski MP, et al. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. 2019;146(23). doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>","ieee":"P. Guerrero <i>et al.</i>, “Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium,” <i>Development</i>, vol. 146, no. 23. The Company of Biologists, 2019.","short":"P. Guerrero, R. Perez-Carrasco, M.P. Zagórski, D. Page, A. Kicheva, J. Briscoe, K.M. Page, Development 146 (2019)."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"volume":146,"article_type":"original","date_created":"2019-12-10T14:39:50Z","author":[{"first_name":"Pilar","full_name":"Guerrero, Pilar","last_name":"Guerrero"},{"full_name":"Perez-Carrasco, Ruben","last_name":"Perez-Carrasco","first_name":"Ruben"},{"orcid":"0000-0001-7896-7762","first_name":"Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","full_name":"Zagórski, Marcin P","last_name":"Zagórski"},{"full_name":"Page, David","last_name":"Page","first_name":"David"},{"orcid":"0000-0003-4509-4998","first_name":"Anna","last_name":"Kicheva","full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"James","full_name":"Briscoe, James","last_name":"Briscoe"},{"last_name":"Page","full_name":"Page, Karen M.","first_name":"Karen M."}],"scopus_import":"1","day":"04","title":"Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium","oa_version":"Published Version","publication_status":"published","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"file_date_updated":"2020-07-14T12:47:50Z","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"       146","abstract":[{"lang":"eng","text":"Cell division, movement and differentiation contribute to pattern formation in developing tissues. This is the case in the vertebrate neural tube, in which neurons differentiate in a characteristic pattern from a highly dynamic proliferating pseudostratified epithelium. To investigate how progenitor proliferation and differentiation affect cell arrangement and growth of the neural tube, we used experimental measurements to develop a mechanical model of the apical surface of the neuroepithelium that incorporates the effect of interkinetic nuclear movement and spatially varying rates of neuronal differentiation. Simulations predict that tissue growth and the shape of lineage-related clones of cells differ with the rate of differentiation. Growth is isotropic in regions of high differentiation, but dorsoventrally biased in regions of low differentiation. This is consistent with experimental observations. The absence of directional signalling in the simulations indicates that global mechanical constraints are sufficient to explain the observed differences in anisotropy. This provides insight into how the tissue growth rate affects cell dynamics and growth anisotropy and opens up possibilities to study the coupling between mechanics, pattern formation and growth in the neural tube."}],"year":"2019","isi":1,"external_id":{"isi":["000507575700004"],"pmid":["31784457"]},"pmid":1,"ec_funded":1,"date_published":"2019-12-04T00:00:00Z","project":[{"_id":"B6FC0238-B512-11E9-945C-1524E6697425","name":"Coordination of Patterning And Growth In the Spinal Cord","grant_number":"680037","call_identifier":"H2020"}],"publication":"Development","status":"public","date_updated":"2023-09-06T11:26:36Z","_id":"7165","type":"journal_article","doi":"10.1242/dev.176297","article_processing_charge":"No","publisher":"The Company of Biologists","quality_controlled":"1","ddc":["570"]},{"date_published":"2019-10-30T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>, 1st ed. Wiesbaden: Springer Nature, 2019.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","ama":"Kersting K, Lampert C, Rothkopf C, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>","apa":"Kersting, K., Lampert, C., &#38; Rothkopf, C. (Eds.). (2019). <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i> (1st ed.). Wiesbaden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>","mla":"Kersting, Kristian, et al., editors. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed., Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>.","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p."},"place":"Wiesbaden","language":[{"iso":"ger"}],"status":"public","department":[{"_id":"ChLa"}],"related_material":{"link":[{"description":"News on IST Website","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/","relation":"press_release"}]},"month":"10","year":"2019","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"page":"XIV, 245","type":"book_editor","date_created":"2019-12-11T14:15:56Z","date_updated":"2021-12-22T14:40:58Z","_id":"7171","edition":"1","editor":[{"first_name":"Kristian","full_name":"Kersting, Kristian","last_name":"Kersting"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"first_name":"Constantin","last_name":"Rothkopf","full_name":"Rothkopf, Constantin"}],"title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","publisher":"Springer Nature","oa_version":"None","doi":"10.1007/978-3-658-26763-6","day":"30","article_processing_charge":"No"},{"page":"192","ddc":["570"],"date_updated":"2025-05-07T11:12:29Z","_id":"7172","type":"dissertation","doi":"10.15479/AT:ISTA:7172","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","date_published":"2019-12-12T00:00:00Z","degree_awarded":"PhD","status":"public","year":"2019","related_material":{"record":[{"id":"6377","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"449"},{"status":"public","relation":"part_of_dissertation","id":"1346"}]},"publication_status":"published","publication_identifier":{"eissn":["2663-337X"]},"file_date_updated":"2020-07-14T12:47:51Z","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The development and growth of Arabidopsis thaliana is regulated by a combination of genetic programing and also by the environmental influences. An important role in these processes play the phytohormones and among them, auxin is crucial as it controls many important functions. It is transported through the whole plant body by creating local and temporal concentration maxima and minima, which have an impact on the cell status, tissue and organ identity. Auxin has the property to undergo a directional and finely regulated cell-to-cell transport, which is enabled by the transport proteins, localized on the plasma membrane. An important role in this process have the PIN auxin efflux proteins, which have an asymmetric/polar subcellular localization and determine the directionality of the auxin transport. During the last years, there were significant advances in understanding how the trafficking molecular machineries function, including studies on molecular interactions, function, subcellular localization and intracellular distribution. However, there is still a lack of detailed characterization on the steps of endocytosis, exocytosis, endocytic recycling and degradation. Due to this fact, I focused on the identification of novel trafficking factors and better characterization of the intracellular trafficking pathways. My PhD thesis consists of an introductory chapter, three experimental chapters, a chapter containing general discussion, conclusions and perspectives and also an appendix chapter with published collaborative papers.\r\nThe first chapter is separated in two different parts: I start by a general introduction to auxin biology and then I introduce the trafficking pathways in the model plant Arabidopsis thaliana. Then, I explain also the phosphorylation-signals for polar targeting and also the roles of the phytohormone strigolactone.\r\nThe second chapter includes the characterization of bar1/sacsin mutant, which was identified in a forward genetic screen for novel trafficking components in Arabidopsis thaliana, where by the implementation of an EMS-treated pPIN1::PIN1-GFP marker line and by using the established inhibitor of ARF-GEFs, Brefeldin A (BFA) as a tool to study trafficking processes, we identified a novel factor, which is mediating the adaptation of the plant cell to ARF-GEF inhibition. The mutation is in a previously uncharacterized gene, encoding a very big protein that we, based on its homologies, called SACSIN with domains suggesting roles as a molecular chaperon or as a component of the ubiquitin-proteasome system. Our physiology and imaging studies revealed that SACSIN is a crucial plant cell component of the adaptation to the ARF-GEF inhibition.\r\nThe third chapter includes six subchapters, where I focus on the role of the phytohormone strigolactone, which interferes with auxin feedback on PIN internalization. Strigolactone moderates the polar auxin transport by increasing the internalization of the PIN auxin efflux carriers, which reduces the canalization related growth responses. In addition, I also studied the role of phosphorylation in the strigolactone regulation of auxin feedback on PIN internalization. In this chapter I also present my results on the MAX2-dependence of strigolactone-mediated root growth inhibition and I also share my results on the auxin metabolomics profiling after application of GR24.\r\nIn the fourth chapter I studied the effect of two small molecules ES-9 and ES9-17, which were identified from a collection of small molecules with the property to impair the clathrin-mediated endocytosis.\r\nIn the fifth chapter, I discuss all my observations and experimental findings and suggest alternative hypothesis to interpret my results.\r\nIn the appendix there are three collaborative published projects. In the first, I participated in the characterization of the role of ES9 as a small molecule, which is inhibitor of clathrin- mediated endocytosis in different model organisms. In the second paper, I contributed to the characterization of another small molecule ES9-17, which is a non-protonophoric analog of ES9 and also impairs the clathrin-mediated endocytosis not only in plant cells, but also in mammalian HeLa cells. Last but not least, I also attach another paper, where I tried to establish the grafting method as a technique in our lab to study canalization related processes."}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"date_created":"2019-12-11T21:24:39Z","author":[{"full_name":"Vasileva, Mina K","id":"3407EB18-F248-11E8-B48F-1D18A9856A87","last_name":"Vasileva","first_name":"Mina K"}],"day":"12","title":"Molecular mechanisms of endomembrane trafficking in Arabidopsis thaliana","oa_version":"Published Version","citation":{"ista":"Vasileva MK. 2019. Molecular mechanisms of endomembrane trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria.","chicago":"Vasileva, Mina K. “Molecular Mechanisms of Endomembrane Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:7172\">https://doi.org/10.15479/AT:ISTA:7172</a>.","apa":"Vasileva, M. K. (2019). <i>Molecular mechanisms of endomembrane trafficking in Arabidopsis thaliana</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7172\">https://doi.org/10.15479/AT:ISTA:7172</a>","mla":"Vasileva, Mina K. <i>Molecular Mechanisms of Endomembrane Trafficking in Arabidopsis Thaliana</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7172\">10.15479/AT:ISTA:7172</a>.","ama":"Vasileva MK. Molecular mechanisms of endomembrane trafficking in Arabidopsis thaliana. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7172\">10.15479/AT:ISTA:7172</a>","ieee":"M. K. Vasileva, “Molecular mechanisms of endomembrane trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2019.","short":"M.K. Vasileva, Molecular Mechanisms of Endomembrane Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2019."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"file":[{"relation":"source_file","checksum":"ef981c1a3b1d9da0edcbedcff4970d37","file_name":"Thesis_Mina_final_upload_7.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_id":"7175","date_created":"2019-12-12T09:32:36Z","file_size":20454014,"creator":"mvasilev","date_updated":"2020-07-14T12:47:51Z"},{"file_name":"Thesis_Mina_final_upload_7.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"3882c4585e46c9cfb486e4225cad54ab","date_created":"2019-12-12T09:33:10Z","file_size":11565025,"creator":"mvasilev","date_updated":"2020-07-14T12:47:51Z","file_id":"7176"}],"supervisor":[{"orcid":"0000-0002-8302-7596","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml"}],"month":"12"},{"month":"12","file":[{"date_created":"2020-12-06T17:30:09Z","file_size":4766789,"creator":"shigemot","date_updated":"2020-12-06T17:30:09Z","file_id":"8922","file_name":"Klotz et al 2019 EMBO Reports.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"79e3b72481dc32489911121cf3b7d8d0"}],"department":[{"_id":"RySh"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"12","citation":{"ama":"Klotz L, Wendler O, Frischknecht R, Shigemoto R, Schulze H, Enz R. Localization of group II and III metabotropic glutamate receptors at pre- and postsynaptic sites of inner hair cell ribbon synapses. <i>FASEB Journal</i>. 2019;33(12):13734-13746. doi:<a href=\"https://doi.org/10.1096/fj.201901543R\">10.1096/fj.201901543R</a>","short":"L. Klotz, O. Wendler, R. Frischknecht, R. Shigemoto, H. Schulze, R. Enz, FASEB Journal 33 (2019) 13734–13746.","ieee":"L. Klotz, O. Wendler, R. Frischknecht, R. Shigemoto, H. Schulze, and R. Enz, “Localization of group II and III metabotropic glutamate receptors at pre- and postsynaptic sites of inner hair cell ribbon synapses,” <i>FASEB Journal</i>, vol. 33, no. 12. FASEB, pp. 13734–13746, 2019.","chicago":"Klotz, Lisa, Olaf Wendler, Renato Frischknecht, Ryuichi Shigemoto, Holger Schulze, and Ralf Enz. “Localization of Group II and III Metabotropic Glutamate Receptors at Pre- and Postsynaptic Sites of Inner Hair Cell Ribbon Synapses.” <i>FASEB Journal</i>. FASEB, 2019. <a href=\"https://doi.org/10.1096/fj.201901543R\">https://doi.org/10.1096/fj.201901543R</a>.","ista":"Klotz L, Wendler O, Frischknecht R, Shigemoto R, Schulze H, Enz R. 2019. Localization of group II and III metabotropic glutamate receptors at pre- and postsynaptic sites of inner hair cell ribbon synapses. FASEB Journal. 33(12), 13734–13746.","mla":"Klotz, Lisa, et al. “Localization of Group II and III Metabotropic Glutamate Receptors at Pre- and Postsynaptic Sites of Inner Hair Cell Ribbon Synapses.” <i>FASEB Journal</i>, vol. 33, no. 12, FASEB, 2019, pp. 13734–46, doi:<a href=\"https://doi.org/10.1096/fj.201901543R\">10.1096/fj.201901543R</a>.","apa":"Klotz, L., Wendler, O., Frischknecht, R., Shigemoto, R., Schulze, H., &#38; Enz, R. (2019). Localization of group II and III metabotropic glutamate receptors at pre- and postsynaptic sites of inner hair cell ribbon synapses. <i>FASEB Journal</i>. FASEB. <a href=\"https://doi.org/10.1096/fj.201901543R\">https://doi.org/10.1096/fj.201901543R</a>"},"title":"Localization of group II and III metabotropic glutamate receptors at pre- and postsynaptic sites of inner hair cell ribbon synapses","oa_version":"Submitted Version","author":[{"first_name":"Lisa","last_name":"Klotz","full_name":"Klotz, Lisa"},{"full_name":"Wendler, Olaf","last_name":"Wendler","first_name":"Olaf"},{"first_name":"Renato","full_name":"Frischknecht, Renato","last_name":"Frischknecht"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"last_name":"Schulze","full_name":"Schulze, Holger","first_name":"Holger"},{"first_name":"Ralf","full_name":"Enz, Ralf","last_name":"Enz"}],"scopus_import":"1","day":"01","article_type":"original","date_created":"2019-12-15T23:00:42Z","volume":33,"abstract":[{"text":"Glutamate is the major excitatory neurotransmitter in the CNS binding to a variety of glutamate receptors. Metabotropic glutamate receptors (mGluR1 to mGluR8) can act excitatory or inhibitory, depending on associated signal cascades. Expression and localization of inhibitory acting mGluRs at inner hair cells (IHCs) in the cochlea are largely unknown. Here, we analyzed expression of mGluR2, mGluR3, mGluR4, mGluR6, mGluR7, and mGluR8 and investigated their localization with respect to the presynaptic ribbon of IHC synapses. We detected transcripts for mGluR2, mGluR3, and mGluR4 as well as for mGluR7a, mGluR7b, mGluR8a, and mGluR8b splice variants. Using receptor-specific antibodies in cochlear wholemounts, we found expression of mGluR2, mGluR4, and mGluR8b close to presynaptic ribbons. Super resolution and confocal microscopy in combination with 3-dimensional reconstructions indicated a postsynaptic localization of mGluR2 that overlaps with postsynaptic density protein 95 on dendrites of afferent type I spiral ganglion neurons. In contrast, mGluR4 and mGluR8b were expressed at the presynapse close to IHC ribbons. In summary, we localized in detail 3 mGluR types at IHC ribbon synapses, providing a fundament for new therapeutical strategies that could protect the cochlea against noxious stimuli and excitotoxicity.","lang":"eng"}],"intvolume":"        33","has_accepted_license":"1","publication_identifier":{"eissn":["15306860"]},"publication_status":"published","file_date_updated":"2020-12-06T17:30:09Z","external_id":{"pmid":["31585509"],"isi":["000507466100054"]},"year":"2019","isi":1,"publication":"FASEB Journal","status":"public","date_published":"2019-12-01T00:00:00Z","pmid":1,"publisher":"FASEB","doi":"10.1096/fj.201901543R","article_processing_charge":"No","type":"journal_article","date_updated":"2023-09-06T14:34:36Z","_id":"7179","ddc":["571","599"],"page":"13734-13746","quality_controlled":"1"},{"citation":{"ama":"Retzer K, Akhmanova M, Konstantinova N, et al. Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter. <i>Nature Communications</i>. 2019;10. doi:<a href=\"https://doi.org/10.1038/s41467-019-13543-1\">10.1038/s41467-019-13543-1</a>","short":"K. Retzer, M. Akhmanova, N. Konstantinova, K. Malínská, J. Leitner, J. Petrášek, C. Luschnig, Nature Communications 10 (2019).","ieee":"K. Retzer <i>et al.</i>, “Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter,” <i>Nature Communications</i>, vol. 10. Springer Nature, 2019.","ista":"Retzer K, Akhmanova M, Konstantinova N, Malínská K, Leitner J, Petrášek J, Luschnig C. 2019. Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter. Nature Communications. 10, 5516.","chicago":"Retzer, Katarzyna, Maria Akhmanova, Nataliia Konstantinova, Kateřina Malínská, Johannes Leitner, Jan Petrášek, and Christian Luschnig. “Brassinosteroid Signaling Delimits Root Gravitropism via Sorting of the Arabidopsis PIN2 Auxin Transporter.” <i>Nature Communications</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41467-019-13543-1\">https://doi.org/10.1038/s41467-019-13543-1</a>.","mla":"Retzer, Katarzyna, et al. “Brassinosteroid Signaling Delimits Root Gravitropism via Sorting of the Arabidopsis PIN2 Auxin Transporter.” <i>Nature Communications</i>, vol. 10, 5516, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41467-019-13543-1\">10.1038/s41467-019-13543-1</a>.","apa":"Retzer, K., Akhmanova, M., Konstantinova, N., Malínská, K., Leitner, J., Petrášek, J., &#38; Luschnig, C. (2019). Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-019-13543-1\">https://doi.org/10.1038/s41467-019-13543-1</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"DaSi"}],"file":[{"file_id":"7184","file_size":5156533,"date_created":"2019-12-16T07:37:50Z","date_updated":"2020-07-14T12:47:52Z","creator":"dernst","relation":"main_file","checksum":"77e8720a8e0f3091b98159f85be40893","file_name":"2019_NatureComm_Retzer.pdf","content_type":"application/pdf","access_level":"open_access"}],"article_number":"5516","month":"12","file_date_updated":"2020-07-14T12:47:52Z","publication_status":"published","publication_identifier":{"eissn":["20411723"]},"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Arabidopsis PIN2 protein directs transport of the phytohormone auxin from the root tip into the root elongation zone. Variation in hormone transport, which depends on a delicate interplay between PIN2 sorting to and from polar plasma membrane domains, determines root growth. By employing a constitutively degraded version of PIN2, we identify brassinolides as antagonists of PIN2 endocytosis. This response does not require de novo protein synthesis, but involves early events in canonical brassinolide signaling. Brassinolide-controlled adjustments in PIN2 sorting and intracellular distribution governs formation of a lateral PIN2 gradient in gravistimulated roots, coinciding with adjustments in auxin signaling and directional root growth. Strikingly, simulations indicate that PIN2 gradient formation is no prerequisite for root bending but rather dampens asymmetric auxin flow and signaling. Crosstalk between brassinolide signaling and endocytic PIN2 sorting, thus, appears essential for determining the rate of gravity-induced root curvature via attenuation of differential cell elongation."}],"intvolume":"        10","volume":10,"date_created":"2019-12-15T23:00:43Z","article_type":"original","scopus_import":"1","day":"01","author":[{"last_name":"Retzer","full_name":"Retzer, Katarzyna","first_name":"Katarzyna"},{"full_name":"Akhmanova, Maria","id":"3425EC26-F248-11E8-B48F-1D18A9856A87","last_name":"Akhmanova","orcid":"0000-0003-1522-3162","first_name":"Maria"},{"full_name":"Konstantinova, Nataliia","last_name":"Konstantinova","first_name":"Nataliia"},{"full_name":"Malínská, Kateřina","last_name":"Malínská","first_name":"Kateřina"},{"first_name":"Johannes","last_name":"Leitner","full_name":"Leitner, Johannes"},{"full_name":"Petrášek, Jan","last_name":"Petrášek","first_name":"Jan"},{"last_name":"Luschnig","full_name":"Luschnig, Christian","first_name":"Christian"}],"title":"Brassinosteroid signaling delimits root gravitropism via sorting of the Arabidopsis PIN2 auxin transporter","oa_version":"Published Version","pmid":1,"date_published":"2019-12-01T00:00:00Z","publication":"Nature Communications","status":"public","project":[{"call_identifier":"FWF","grant_number":"M02379","name":"Modeling epithelial tissue mechanics during cell invasion","_id":"264CBBAC-B435-11E9-9278-68D0E5697425"}],"year":"2019","isi":1,"external_id":{"isi":["000500508100001"],"pmid":["31797871"]},"quality_controlled":"1","ddc":["570"],"_id":"7180","date_updated":"2023-09-06T14:08:21Z","type":"journal_article","article_processing_charge":"No","doi":"10.1038/s41467-019-13543-1","publisher":"Springer Nature"},{"article_processing_charge":"No","doi":"10.1038/s41587-019-0333-6","publisher":"Springer Nature","_id":"7181","date_updated":"2023-09-06T14:32:52Z","type":"journal_article","page":"1466-1470","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6894943/"}],"quality_controlled":"1","isi":1,"year":"2019","related_material":{"record":[{"id":"13059","status":"public","relation":"research_data"}]},"external_id":{"pmid":["31792410"],"isi":["000500748900021"]},"status":"public","publication":"Nature Biotechnology","project":[{"_id":"26580278-B435-11E9-9278-68D0E5697425","name":"Characterizing the fitness landscape on population and global scales","grant_number":"771209","call_identifier":"H2020"}],"ec_funded":1,"pmid":1,"date_published":"2019-12-01T00:00:00Z","day":"01","scopus_import":"1","author":[{"first_name":"Edgar","full_name":"Garriga, Edgar","last_name":"Garriga"},{"full_name":"Di Tommaso, Paolo","last_name":"Di Tommaso","first_name":"Paolo"},{"first_name":"Cedrik","full_name":"Magis, Cedrik","last_name":"Magis"},{"first_name":"Ionas","last_name":"Erb","full_name":"Erb, Ionas"},{"last_name":"Mansouri","full_name":"Mansouri, Leila","first_name":"Leila"},{"full_name":"Baltzis, Athanasios","last_name":"Baltzis","first_name":"Athanasios"},{"full_name":"Laayouni, Hafid","last_name":"Laayouni","first_name":"Hafid"},{"orcid":"0000-0001-8243-4694","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","last_name":"Kondrashov"},{"last_name":"Floden","full_name":"Floden, Evan","first_name":"Evan"},{"full_name":"Notredame, Cedric","last_name":"Notredame","first_name":"Cedric"}],"title":"Large multiple sequence alignments with a root-to-leaf regressive method","oa_version":"Submitted Version","volume":37,"date_created":"2019-12-15T23:00:43Z","article_type":"original","abstract":[{"lang":"eng","text":"Multiple sequence alignments (MSAs) are used for structural1,2 and evolutionary predictions1,2, but the complexity of aligning large datasets requires the use of approximate solutions3, including the progressive algorithm4. Progressive MSA methods start by aligning the most similar sequences and subsequently incorporate the remaining sequences, from leaf-to-root, based on a guide-tree. Their accuracy declines substantially as the number of sequences is scaled up5. We introduce a regressive algorithm that enables MSA of up to 1.4 million sequences on a standard workstation and substantially improves accuracy on datasets larger than 10,000 sequences. Our regressive algorithm works the other way around to the progressive algorithm and begins by aligning the most dissimilar sequences. It uses an efficient divide-and-conquer strategy to run third-party alignment methods in linear time, regardless of their original complexity. Our approach will enable analyses of extremely large genomic datasets such as the recently announced Earth BioGenome Project, which comprises 1.5 million eukaryotic genomes6."}],"intvolume":"        37","publication_identifier":{"eissn":["15461696"],"issn":["10870156"]},"publication_status":"published","month":"12","department":[{"_id":"FyKo"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"ista":"Garriga E, Di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2019. Large multiple sequence alignments with a root-to-leaf regressive method. Nature Biotechnology. 37(12), 1466–1470.","chicago":"Garriga, Edgar, Paolo Di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>.","apa":"Garriga, E., Di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2019). Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>","mla":"Garriga, Edgar, et al. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>, vol. 37, no. 12, Springer Nature, 2019, pp. 1466–70, doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>.","ama":"Garriga E, Di Tommaso P, Magis C, et al. Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. 2019;37(12):1466-1470. doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>","ieee":"E. Garriga <i>et al.</i>, “Large multiple sequence alignments with a root-to-leaf regressive method,” <i>Nature Biotechnology</i>, vol. 37, no. 12. Springer Nature, pp. 1466–1470, 2019.","short":"E. Garriga, P. Di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, Nature Biotechnology 37 (2019) 1466–1470."},"issue":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"month":"11","department":[{"_id":"JiFr"}],"article_number":"1437","file":[{"file_name":"2019_FrontiersPlant_Alcantara.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"995aa838aec2064d93550de82b40bbd1","date_created":"2019-12-16T07:58:43Z","file_size":1532505,"creator":"dernst","date_updated":"2020-07-14T12:47:52Z","file_id":"7185"}],"oa":1,"language":[{"iso":"eng"}],"issue":"11","citation":{"ama":"Alcântara A, Bosch J, Nazari F, et al. Systematic Y2H screening reveals extensive effector-complex formation. <i>Frontiers in Plant Science</i>. 2019;10(11). doi:<a href=\"https://doi.org/10.3389/fpls.2019.01437\">10.3389/fpls.2019.01437</a>","ieee":"A. Alcântara <i>et al.</i>, “Systematic Y2H screening reveals extensive effector-complex formation,” <i>Frontiers in Plant Science</i>, vol. 10, no. 11. Frontiers, 2019.","short":"A. Alcântara, J. Bosch, F. Nazari, G. Hoffmann, M.C. Gallei, S. Uhse, M.A. Darino, T. Olukayode, D. Reumann, L. Baggaley, A. Djamei, Frontiers in Plant Science 10 (2019).","ista":"Alcântara A, Bosch J, Nazari F, Hoffmann G, Gallei MC, Uhse S, Darino MA, Olukayode T, Reumann D, Baggaley L, Djamei A. 2019. Systematic Y2H screening reveals extensive effector-complex formation. Frontiers in Plant Science. 10(11), 1437.","chicago":"Alcântara, André, Jason Bosch, Fahimeh Nazari, Gesa Hoffmann, Michelle C Gallei, Simon Uhse, Martin A. Darino, et al. “Systematic Y2H Screening Reveals Extensive Effector-Complex Formation.” <i>Frontiers in Plant Science</i>. Frontiers, 2019. <a href=\"https://doi.org/10.3389/fpls.2019.01437\">https://doi.org/10.3389/fpls.2019.01437</a>.","apa":"Alcântara, A., Bosch, J., Nazari, F., Hoffmann, G., Gallei, M. C., Uhse, S., … Djamei, A. (2019). Systematic Y2H screening reveals extensive effector-complex formation. <i>Frontiers in Plant Science</i>. Frontiers. <a href=\"https://doi.org/10.3389/fpls.2019.01437\">https://doi.org/10.3389/fpls.2019.01437</a>","mla":"Alcântara, André, et al. “Systematic Y2H Screening Reveals Extensive Effector-Complex Formation.” <i>Frontiers in Plant Science</i>, vol. 10, no. 11, 1437, Frontiers, 2019, doi:<a href=\"https://doi.org/10.3389/fpls.2019.01437\">10.3389/fpls.2019.01437</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Alcântara","full_name":"Alcântara, André","first_name":"André"},{"last_name":"Bosch","full_name":"Bosch, Jason","first_name":"Jason"},{"first_name":"Fahimeh","last_name":"Nazari","full_name":"Nazari, Fahimeh"},{"full_name":"Hoffmann, Gesa","last_name":"Hoffmann","first_name":"Gesa"},{"orcid":"0000-0003-1286-7368","first_name":"Michelle C","full_name":"Gallei, Michelle C","id":"35A03822-F248-11E8-B48F-1D18A9856A87","last_name":"Gallei"},{"first_name":"Simon","last_name":"Uhse","full_name":"Uhse, Simon"},{"first_name":"Martin A.","last_name":"Darino","full_name":"Darino, Martin A."},{"full_name":"Olukayode, Toluwase","last_name":"Olukayode","first_name":"Toluwase"},{"first_name":"Daniel","full_name":"Reumann, Daniel","last_name":"Reumann"},{"first_name":"Laura","full_name":"Baggaley, Laura","last_name":"Baggaley"},{"first_name":"Armin","last_name":"Djamei","full_name":"Djamei, Armin"}],"scopus_import":"1","day":"14","title":"Systematic Y2H screening reveals extensive effector-complex formation","oa_version":"Published Version","volume":10,"article_type":"original","date_created":"2019-12-15T23:00:43Z","has_accepted_license":"1","abstract":[{"text":"During infection pathogens secrete small molecules, termed effectors, to manipulate and control the interaction with their specific hosts. Both the pathogen and the plant are under high selective pressure to rapidly adapt and co-evolve in what is usually referred to as molecular arms race. Components of the host’s immune system form a network that processes information about molecules with a foreign origin and damage-associated signals, integrating them with developmental and abiotic cues to adapt the plant’s responses. Both in the case of nucleotide-binding leucine-rich repeat receptors and leucine-rich repeat receptor kinases interaction networks have been extensively characterized. However, little is known on whether pathogenic effectors form complexes to overcome plant immunity and promote disease. Ustilago maydis, a biotrophic fungal pathogen that infects maize plants, produces effectors that target hubs in the immune network of the host cell. Here we assess the capability of U. maydis effector candidates to interact with each other, which may play a crucial role during the infection process. Using a systematic yeast-two-hybrid approach and based on a preliminary pooled screen, we selected 63 putative effectors for one-on-one matings with a library of nearly 300 effector candidates. We found that 126 of these effector candidates interacted either with themselves or other predicted effectors. Although the functional relevance of the observed interactions remains elusive, we propose that the observed abundance in complex formation between effectors adds an additional level of complexity to effector research and should be taken into consideration when studying effector evolution and function. Based on this fundamental finding, we suggest various scenarios which could evolutionarily drive the formation and stabilization of an effector interactome.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        10","publication_identifier":{"eissn":["1664462X"]},"publication_status":"published","file_date_updated":"2020-07-14T12:47:52Z","year":"2019","isi":1,"external_id":{"pmid":["31803201"],"isi":["000499821700001"]},"publication":"Frontiers in Plant Science","status":"public","pmid":1,"date_published":"2019-11-14T00:00:00Z","doi":"10.3389/fpls.2019.01437","article_processing_charge":"No","publisher":"Frontiers","date_updated":"2023-09-06T14:33:46Z","_id":"7182","type":"journal_article","ddc":["580"],"quality_controlled":"1"},{"year":"2019","isi":1,"external_id":{"arxiv":["1907.11010"],"isi":["000723515700027"]},"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"International Symposium on Automated Technology for Verification and Analysis","date_published":"2019-10-21T00:00:00Z","conference":{"name":"ATVA: Automated TEchnology for Verification and Analysis","end_date":"2019-10-31","start_date":"2019-10-28","location":"Taipei, Taiwan"},"doi":"10.1007/978-3-030-31784-3_27","alternative_title":["LNCS"],"article_processing_charge":"No","publisher":"Springer Nature","date_updated":"2023-09-06T12:40:58Z","_id":"7183","type":"conference","page":"462-478","main_file_link":[{"url":"https://arxiv.org/abs/1907.11010","open_access":"1"}],"quality_controlled":"1","arxiv":1,"month":"10","department":[{"_id":"KrCh"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"chicago":"Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In <i>International Symposium on Automated Technology for Verification and Analysis</i>, 11781:462–78. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">https://doi.org/10.1007/978-3-030-31784-3_27</a>.","ista":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.","apa":"Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., &#38; Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In <i>International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">https://doi.org/10.1007/978-3-030-31784-3_27</a>","mla":"Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” <i>International Symposium on Automated Technology for Verification and Analysis</i>, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:<a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">10.1007/978-3-030-31784-3_27</a>.","ama":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. Deciding fast termination for probabilistic VASS with nondeterminism. In: <i>International Symposium on Automated Technology for Verification and Analysis</i>. Vol 11781. Springer Nature; 2019:462-478. doi:<a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">10.1007/978-3-030-31784-3_27</a>","ieee":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in <i>International Symposium on Automated Technology for Verification and Analysis</i>, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478.","short":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2019, pp. 462–478."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Brázdil, Tomás","last_name":"Brázdil","first_name":"Tomás"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Antonín","full_name":"Kucera, Antonín","last_name":"Kucera"},{"first_name":"Petr","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"full_name":"Velan, Dominik","last_name":"Velan","first_name":"Dominik"}],"day":"21","scopus_import":"1","title":"Deciding fast termination for probabilistic VASS with nondeterminism","oa_version":"Preprint","volume":11781,"date_created":"2019-12-15T23:00:44Z","abstract":[{"text":"A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n2).","lang":"eng"}],"intvolume":"     11781","publication_identifier":{"issn":["03029743"],"isbn":["9783030317836"],"eissn":["16113349"]},"publication_status":"published"}]