[{"quality_controlled":"1","publication":"Nature","issue":"7941","author":[{"last_name":"Utzat","first_name":"Hendrik","full_name":"Utzat, Hendrik"},{"last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"status":"public","month":"12","article_type":"letter_note","day":"21","doi":"10.1038/d41586-022-04447-0","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["Multidisciplinary"],"external_id":{"pmid":["36543947"],"isi":["000934065100010"]},"corr_author":"1","date_published":"2022-12-21T00:00:00Z","citation":{"chicago":"Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright Blue LEDs.” Nature. Springer Nature, 2022. https://doi.org/10.1038/d41586-022-04447-0.","short":"H. Utzat, M. Ibáñez, Nature 612 (2022) 638–639.","apa":"Utzat, H., & Ibáñez, M. (2022). Molecular engineering enables bright blue LEDs. Nature. Springer Nature. https://doi.org/10.1038/d41586-022-04447-0","ista":"Utzat H, Ibáñez M. 2022. Molecular engineering enables bright blue LEDs. Nature. 612(7941), 638–639.","mla":"Utzat, Hendrik, and Maria Ibáñez. “Molecular Engineering Enables Bright Blue LEDs.” Nature, vol. 612, no. 7941, Springer Nature, 2022, pp. 638–39, doi:10.1038/d41586-022-04447-0.","ama":"Utzat H, Ibáñez M. Molecular engineering enables bright blue LEDs. Nature. 2022;612(7941):638-639. doi:10.1038/d41586-022-04447-0","ieee":"H. Utzat and M. Ibáñez, “Molecular engineering enables bright blue LEDs,” Nature, vol. 612, no. 7941. Springer Nature, pp. 638–639, 2022."},"scopus_import":"1","_id":"14437","title":"Molecular engineering enables bright blue LEDs","department":[{"_id":"MaIb"}],"date_created":"2023-10-17T11:14:43Z","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"publication_status":"published","pmid":1,"fulldoi":"https://doi.org/10.1038/d41586-022-04447-0","oa_version":"None","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"Springer Nature","page":"638-639","volume":612,"abstract":[{"lang":"eng","text":"Future LEDs could be based on lead halide perovskites. A breakthrough in preparing device-compatible solids composed of nanoscale perovskite crystals overcomes a long-standing hurdle in making blue perovskite LEDs."}],"date_updated":"2025-09-10T09:55:51Z","intvolume":" 612"},{"corr_author":"1","publisher":"Zenodo","type":"research_data_reference","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png"},"date_published":"2022-06-28T00:00:00Z","year":"2022","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This dataset comprises all data shown in the figures of the submitted article \"Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses\" at arxiv.org/abs/2206.14104. Additional raw data are available from the corresponding author on reasonable request."}],"citation":{"mla":"Zemlicka, Martin, et al. Compact Vacuum Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses. Zenodo, 2022, doi:10.5281/ZENODO.8408897.","apa":"Zemlicka, M., Redchenko, E., Peruzzo, M., Hassani, F., Trioni, A., Barzanjeh, S., & Fink, J. M. (2022). Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses. Zenodo. https://doi.org/10.5281/ZENODO.8408897","short":"M. Zemlicka, E. Redchenko, M. Peruzzo, F. Hassani, A. Trioni, S. Barzanjeh, J.M. Fink, (2022).","ista":"Zemlicka M, Redchenko E, Peruzzo M, Hassani F, Trioni A, Barzanjeh S, Fink JM. 2022. Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses, Zenodo, 10.5281/ZENODO.8408897.","chicago":"Zemlicka, Martin, Elena Redchenko, Matilda Peruzzo, Farid Hassani, Andrea Trioni, Shabir Barzanjeh, and Johannes M Fink. “Compact Vacuum Gap Transmon Qubits: Selective and Sensitive Probes for Superconductor Surface Losses.” Zenodo, 2022. https://doi.org/10.5281/ZENODO.8408897.","ieee":"M. Zemlicka et al., “Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses.” Zenodo, 2022.","ama":"Zemlicka M, Redchenko E, Peruzzo M, et al. Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses. 2022. doi:10.5281/ZENODO.8408897"},"date_updated":"2026-06-03T07:16:02Z","department":[{"_id":"JoFi"}],"title":"Compact vacuum gap transmon qubits: Selective and sensitive probes for superconductor surface losses","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"14517"}]},"_id":"14520","status":"public","month":"06","ddc":["530"],"author":[{"id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0005-0878-3032","full_name":"Zemlicka, Martin","first_name":"Martin","last_name":"Zemlicka"},{"full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","last_name":"Redchenko"},{"id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","first_name":"Matilda","last_name":"Peruzzo"},{"last_name":"Hassani","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid"},{"first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","last_name":"Trioni"},{"last_name":"Barzanjeh","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","full_name":"Barzanjeh, Shabir","first_name":"Shabir"},{"last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2023-11-13T08:09:10Z","main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.8408897","open_access":"1"}],"day":"28","oa_version":"Published Version","fulldoi":"https://doi.org/10.5281/ZENODO.8408897","license":"https://creativecommons.org/publicdomain/zero/1.0/","article_processing_charge":"No","oa":1,"doi":"10.5281/ZENODO.8408897","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2210.05308"}],"author":[{"last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"},{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"month":"11","status":"public","related_material":{"record":[{"id":"14830","relation":"later_version","status":"public"},{"relation":"dissertation_contains","status":"public","id":"14539"}]},"publication":"arXiv","doi":"10.48550/ARXIV.2210.05308","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","license":"https://creativecommons.org/licenses/by-sa/4.0/","day":"29","date_published":"2022-11-29T00:00:00Z","tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png"},"external_id":{"arxiv":["2210.05308"]},"corr_author":"1","ec_funded":1,"citation":{"ama":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. doi:10.48550/ARXIV.2210.05308","ieee":"D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .","chicago":"Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2210.05308.","mla":"Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.” ArXiv, 2210.05308, doi:10.48550/ARXIV.2210.05308.","short":"D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).","ista":"Zikelic D, Lechner M, Henzinger TA, Chatterjee K. Learning control policies for stochastic systems with reach-avoid guarantees. arXiv, 2210.05308.","apa":"Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308"},"date_created":"2023-11-24T13:10:09Z","_id":"14600","title":"Learning control policies for stochastic systems with reach-avoid guarantees","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa":1,"article_processing_charge":"No","OA_place":"repository","publication_status":"draft","fulldoi":"https://doi.org/10.48550/ARXIV.2210.05308","oa_version":"Preprint","language":[{"iso":"eng"}],"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"year":"2022","type":"preprint","date_updated":"2026-04-07T13:27:56Z","article_number":"2210.05308","abstract":[{"text":"We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold $p\\in[0,1]$ over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on $3$ stochastic non-linear reinforcement learning tasks.","lang":"eng"}],"arxiv":1},{"arxiv":1,"abstract":[{"lang":"eng","text":"In this work, we address the problem of learning provably stable neural\r\nnetwork policies for stochastic control systems. While recent work has\r\ndemonstrated the feasibility of certifying given policies using martingale\r\ntheory, the problem of how to learn such policies is little explored. Here, we\r\nstudy the effectiveness of jointly learning a policy together with a martingale\r\ncertificate that proves its stability using a single learning algorithm. We\r\nobserve that the joint optimization problem becomes easily stuck in local\r\nminima when starting from a randomly initialized policy. Our results suggest\r\nthat some form of pre-training of the policy is required for the joint\r\noptimization to repair and verify the policy successfully."}],"article_number":"2205.11991","date_updated":"2026-04-07T13:27:56Z","type":"preprint","year":"2022","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"language":[{"iso":"eng"}],"oa_version":"Preprint","fulldoi":"https://doi.org/10.48550/arXiv.2205.11991","publication_status":"draft","OA_place":"repository","article_processing_charge":"No","oa":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Learning stabilizing policies in stochastic control systems","_id":"14601","date_created":"2023-11-24T13:22:30Z","citation":{"ieee":"D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .","ama":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv. doi:10.48550/arXiv.2205.11991","mla":"Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, 2205.11991, doi:10.48550/arXiv.2205.11991.","apa":"Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991","short":"D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).","ista":"Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 2205.11991.","chicago":"Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.11991."},"ec_funded":1,"corr_author":"1","external_id":{"arxiv":["2205.11991"]},"date_published":"2022-05-24T00:00:00Z","day":"24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.48550/arXiv.2205.11991","publication":"arXiv","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"status":"public","month":"05","author":[{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"main_file_link":[{"url":"https://arxiv.org/abs/2205.11991","open_access":"1"}]},{"article_type":"original","day":"01","keyword":["Molecular Biology","Biochemistry","Structural Biology"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/prot.26217","publication":"Proteins: Structure, Function, and Bioinformatics","quality_controlled":"1","author":[{"full_name":"Gisonno, Romina A.","first_name":"Romina A.","last_name":"Gisonno"},{"last_name":"Masson","first_name":"Tomas","id":"93ac43e8-8599-11eb-9b86-f6efb0a4c207","full_name":"Masson, Tomas","orcid":"0000-0002-2634-6283"},{"full_name":"Ramella, Nahuel A.","first_name":"Nahuel A.","last_name":"Ramella"},{"first_name":"Exequiel E.","full_name":"Barrera, Exequiel E.","last_name":"Barrera"},{"full_name":"Romanowski, Víctor","first_name":"Víctor","last_name":"Romanowski"},{"last_name":"Tricerri","full_name":"Tricerri, M. Alejandra","first_name":"M. Alejandra"}],"month":"01","status":"public","issue":"1","main_file_link":[{"url":"https://doi.org/10.1101/2020.09.18.304337","open_access":"1"}],"citation":{"ama":"Gisonno RA, Masson T, Ramella NA, Barrera EE, Romanowski V, Tricerri MA. Evolutionary and structural constraints influencing apolipoprotein A‐I amyloid behavior. Proteins: Structure, Function, and Bioinformatics. 2022;90(1):258-269. doi:10.1002/prot.26217","ieee":"R. A. Gisonno, T. Masson, N. A. Ramella, E. E. Barrera, V. Romanowski, and M. A. Tricerri, “Evolutionary and structural constraints influencing apolipoprotein A‐I amyloid behavior,” Proteins: Structure, Function, and Bioinformatics, vol. 90, no. 1. Wiley, pp. 258–269, 2022.","chicago":"Gisonno, Romina A., Tomas Masson, Nahuel A. Ramella, Exequiel E. Barrera, Víctor Romanowski, and M. Alejandra Tricerri. “Evolutionary and Structural Constraints Influencing Apolipoprotein A‐I Amyloid Behavior.” Proteins: Structure, Function, and Bioinformatics. Wiley, 2022. https://doi.org/10.1002/prot.26217.","short":"R.A. Gisonno, T. Masson, N.A. Ramella, E.E. Barrera, V. Romanowski, M.A. Tricerri, Proteins: Structure, Function, and Bioinformatics 90 (2022) 258–269.","apa":"Gisonno, R. A., Masson, T., Ramella, N. A., Barrera, E. E., Romanowski, V., & Tricerri, M. A. (2022). Evolutionary and structural constraints influencing apolipoprotein A‐I amyloid behavior. Proteins: Structure, Function, and Bioinformatics. Wiley. https://doi.org/10.1002/prot.26217","ista":"Gisonno RA, Masson T, Ramella NA, Barrera EE, Romanowski V, Tricerri MA. 2022. Evolutionary and structural constraints influencing apolipoprotein A‐I amyloid behavior. Proteins: Structure, Function, and Bioinformatics. 90(1), 258–269.","mla":"Gisonno, Romina A., et al. “Evolutionary and Structural Constraints Influencing Apolipoprotein A‐I Amyloid Behavior.” Proteins: Structure, Function, and Bioinformatics, vol. 90, no. 1, Wiley, 2022, pp. 258–69, doi:10.1002/prot.26217."},"corr_author":"1","external_id":{"pmid":["34414600"]},"date_published":"2022-01-01T00:00:00Z","pmid":1,"fulldoi":"https://doi.org/10.1002/prot.26217","oa_version":"Preprint","publication_status":"published","article_processing_charge":"No","oa":1,"department":[{"_id":"MaJö"}],"_id":"15268","title":"Evolutionary and structural constraints influencing apolipoprotein A‐I amyloid behavior","publication_identifier":{"eissn":["1097-0134"],"issn":["0887-3585"]},"date_created":"2024-04-03T07:49:53Z","abstract":[{"text":"Apolipoprotein A‐I (apoA‐I) has a key function in the reverse cholesterol transport. However, aggregation of apoA‐I single point mutants can lead to hereditary amyloid pathology. Although several studies have tackled the biophysical and structural consequences introduced by these mutations, there is little information addressing the relationship between the evolutionary and structural features that contribute to the amyloid behavior of apoA‐I. We combined evolutionary studies, in silico mutagenesis and molecular dynamics (MD) simulations to provide a comprehensive analysis of the conservation and pathogenic role of the aggregation‐prone regions (APRs) present in apoA‐I. Sequence analysis demonstrated that among the four amyloidogenic regions described for human apoA‐I, only two (APR1 and APR4) are evolutionary conserved across different species of Sarcopterygii. Moreover, stability analysis carried out with the FoldX engine showed that APR1 contributes to the marginal stability of apoA‐I. Structural properties of full‐length apoA‐I models suggest that aggregation is avoided by placing APRs into highly packed and rigid portions of its native fold. Compared to silent variants extracted from the gnomAD database, the thermodynamic and pathogenic impact of amyloid mutations showed evidence of a higher destabilizing effect. MD simulations of the amyloid variant G26R evidenced the partial unfolding of the alpha‐helix bundle with the concomitant exposure of APR1 to the solvent, suggesting an insight into the early steps involved in its aggregation. Our findings highlight APR1 as a relevant component for apoA‐I structural integrity and emphasize a destabilizing effect of amyloid variants that leads to the exposure of this region.","lang":"eng"}],"page":"258-269","volume":90,"intvolume":" 90","date_updated":"2024-10-09T21:08:44Z","type":"journal_article","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2022"},{"date_published":"2022-01-19T00:00:00Z","external_id":{"isi":["000762665200015"]},"citation":{"chicago":"Loose, Martin. Cell Scientist to Watch – Martin Loose. Journal of Cell Science. Vol. 135. The Company of Biologists, 2022. https://doi.org/10.1242/jcs.259715.","mla":"Loose, Martin. “Cell Scientist to Watch – Martin Loose.” Journal of Cell Science, vol. 135, no. 2, jcs259715, The Company of Biologists, 2022, doi:10.1242/jcs.259715.","ista":"Loose M. 2022. Cell scientist to watch – Martin Loose, The Company of Biologists,p.","short":"M. Loose, Cell Scientist to Watch – Martin Loose, The Company of Biologists, 2022.","apa":"Loose, M. (2022). Cell scientist to watch – Martin Loose. Journal of Cell Science (Vol. 135). The Company of Biologists. https://doi.org/10.1242/jcs.259715","ieee":"M. Loose, Cell scientist to watch – Martin Loose, vol. 135, no. 2. The Company of Biologists, 2022.","ama":"Loose M. Cell Scientist to Watch – Martin Loose. Vol 135. The Company of Biologists; 2022. doi:10.1242/jcs.259715"},"issue":"2","main_file_link":[{"url":"https://doi.org/10.1242/jcs.259715","open_access":"1"}],"author":[{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin","last_name":"Loose"}],"isi":1,"status":"public","ddc":["570"],"month":"01","quality_controlled":"1","publication":"Journal of Cell Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1242/jcs.259715","day":"19","language":[{"iso":"eng"}],"year":"2022","type":"other_academic_publication","publisher":"The Company of Biologists","intvolume":" 135","date_updated":"2026-06-18T17:51:26Z","article_number":"jcs259715","volume":135,"abstract":[{"text":"Martin Loose studied chemistry at the University of Heidelberg, Germany. He then joined Petra Schwille's group at the Max Planck Institute of Molecular Cell Biology and Genetics in Dresden, where he obtained his PhD degree in 2010 for work on self-organization and pattern formation in the bacterial Min protein system. He then moved to Tim Mitchison's lab at Harvard Medical School, Boston, USA for his postdoc, funded by Human Frontier Science Program (HSFP) and European Molecular Biology Organization (EMBO) long-term fellowships; there, he discovered that the bacterial cell division proteins FtsA and FtsZ self-organize into dynamic cytoskeletal patterns. Martin established his independent research group at the Institute of Science and Technology (IST) Austria in 2015, supported by an European Research Council (ERC) starting grant and HFSP Young Investigator Grant. His lab studies the self-organization of bacterial cell division and small GTPase networks.","lang":"eng"}],"date_created":"2024-05-28T13:28:30Z","publication_identifier":{"issn":["0021-9533"],"eissn":["1477-9137"]},"_id":"17057","title":"Cell scientist to watch – Martin Loose","department":[{"_id":"MaLo"}],"oa":1,"article_processing_charge":"No","publication_status":"published","fulldoi":"https://doi.org/10.1242/jcs.259715","oa_version":"Published Version"},{"has_accepted_license":"1","file_date_updated":"2024-08-19T06:54:41Z","acknowledgement":"We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement No 805223 ScaleML),\r\nas well as computational support from AWS EC2. We thank Eldar Kurtic for code and hyper-parameters for BERT pruning, and the Neural Magic Team, notably Michael Goin and\r\nMark Kurtz, for support with their software.","date_published":"2022-07-20T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["000922378801029"]},"corr_author":"1","scopus_import":"1","ec_funded":1,"citation":{"chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “SPDY: Accurate Pruning with Speedup Guarantees.” In 39th International Conference on Machine Learning, 162:6726–43. ML Research Press, 2022.","mla":"Frantar, Elias, and Dan-Adrian Alistarh. “SPDY: Accurate Pruning with Speedup Guarantees.” 39th International Conference on Machine Learning, vol. 162, ML Research Press, 2022, pp. 6726–43.","ista":"Frantar E, Alistarh D-A. 2022. SPDY: Accurate pruning with speedup guarantees. 39th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 162, 6726–6743.","apa":"Frantar, E., & Alistarh, D.-A. (2022). SPDY: Accurate pruning with speedup guarantees. In 39th International Conference on Machine Learning (Vol. 162, pp. 6726–6743). Baltimore, MD, United States: ML Research Press.","short":"E. Frantar, D.-A. Alistarh, in:, 39th International Conference on Machine Learning, ML Research Press, 2022, pp. 6726–6743.","ieee":"E. Frantar and D.-A. Alistarh, “SPDY: Accurate pruning with speedup guarantees,” in 39th International Conference on Machine Learning, Baltimore, MD, United States, 2022, vol. 162, pp. 6726–6743.","ama":"Frantar E, Alistarh D-A. SPDY: Accurate pruning with speedup guarantees. In: 39th International Conference on Machine Learning. Vol 162. ML Research Press; 2022:6726-6743."},"author":[{"last_name":"Frantar","first_name":"Elias","full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"ddc":["000"],"status":"public","month":"07","isi":1,"quality_controlled":"1","publication":"39th International Conference on Machine Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["PMLR"],"license":"https://creativecommons.org/licenses/by/4.0/","day":"20","language":[{"iso":"eng"}],"year":"2022","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"type":"conference","publisher":"ML Research Press","file":[{"relation":"main_file","date_updated":"2024-08-19T06:54:41Z","file_name":"2022_PMLR_Frantar.pdf","access_level":"open_access","file_id":"17440","checksum":"5179a1e4dfc0fbfab6674907299e414a","content_type":"application/pdf","creator":"dernst","date_created":"2024-08-19T06:54:41Z","file_size":615916,"success":1}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2022-07-23","location":"Baltimore, MD, United States","start_date":"2022-07-17"},"intvolume":" 162","date_updated":"2025-04-14T07:49:14Z","page":"6726-6743","volume":162,"abstract":[{"lang":"eng","text":"The recent focus on the efficiency of deep neural networks (DNNs) has led to significant work on model compression approaches, of which weight pruning is one of the most popular. At the same time, there is rapidly-growing computational support for efficiently executing the unstructured-sparse models obtained via pruning. Yet, most existing pruning methods minimize just the number of remaining weights, i.e. the size of the model, rather than optimizing for inference time. We address this gap by introducing SPDY, a new compression method which automatically determines layer-wise sparsity targets achieving a desired inference speedup on a given system, while minimizing accuracy loss. SPDY is the composition of two new techniques. The first is an efficient and general dynamic programming algorithm for solving constrained layer-wise compression problems, given a set of layer-wise error scores. The second technique is a local search procedure for automatically determining such scores in an accurate and robust manner. Experiments across popular vision and language models show that SPDY guarantees speedups while recovering higher accuracy relative to existing strategies, both for one-shot and gradual pruning scenarios, and is compatible with most existing pruning approaches. We also extend our approach to the recently-proposed task of pruning with very little data, where we achieve the best known accuracy recovery when pruning to the GPU-supported 2:4 sparsity pattern."}],"date_created":"2024-05-28T13:45:20Z","_id":"17059","title":"SPDY: Accurate pruning with speedup guarantees","department":[{"_id":"DaAl"}],"oa":1,"article_processing_charge":"Yes","publication_status":"published","oa_version":"Published Version"},{"year":"2022","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","type":"conference","page":"217-231","arxiv":1,"abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are one of the most prominent solutions to the limited transaction throughput of blockchains. Nevertheless, PCNs suffer themselves from a throughput limitation due to the capital constraints of their channels. A similar dependence on high capital is also found in inter-bank payment settlements, where the so-called netting technique is used to mitigate liquidity demands.\r\nIn this work, we alleviate this limitation by introducing the notion of transaction aggregation: instead of executing transactions sequentially through a PCN, we enable senders to aggregate multiple transactions and execute them simultaneously to benefit from several amounts that may \"cancel out\". Two direct advantages of our proposal is the decrease in intermediary fees paid by senders as well as the obfuscation of the transaction data from the intermediaries.\r\nWe formulate the transaction aggregation as a computational problem, a generalization of the Bank Clearing Problem. We present a generic framework for the transaction aggregation execution, and thereafter we propose Wiser as an implementation of this framework in a specific hub-based setting. To overcome the NP-hardness of the transaction aggregation problem, in Wiser we propose a fixed-parameter linear algorithm for a special case of transaction aggregation as well as the Bank Clearing Problem. Wiser can also be seen as a modern variant of the Hawala money transfer system, as well as a decentralized implementation of the overseas remittance service of Wise."}],"file":[{"creator":"dernst","checksum":"54a7d405f8e57dba24728599ca63818c","content_type":"application/pdf","file_id":"17439","file_name":"2022_AFT_Tiwari.pdf","access_level":"open_access","date_updated":"2024-08-19T06:45:21Z","relation":"main_file","success":1,"file_size":574728,"date_created":"2024-08-19T06:45:21Z"}],"date_updated":"2025-09-10T09:57:48Z","conference":{"name":"AFT: Conference on Advances in Financial Technologies","start_date":"2022-09-19","location":"Cambridge, MA, United States","end_date":"2022-09-21"},"title":"Wiser: Increasing throughput in payment channel networks with transaction aggregation","_id":"17060","department":[{"_id":"KrPi"}],"date_created":"2024-05-28T13:58:35Z","publication_identifier":{"isbn":["9781450398619"]},"publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1145/3558535.3559775","oa":1,"article_processing_charge":"Yes (in subscription journal)","external_id":{"isi":["001041852800015"],"arxiv":["2205.11597"]},"has_accepted_license":"1","acknowledgement":"This work was supported partially by ERC Starting Grant QIP–805241, by the Vienna business agency (Wirtschaftsagentur) through the Vienna Cybersecurity and Privacy Research Center\r\n(ViSP) and by the Austrian Science Fund (FWF) project I 4800-N (ADVISE).\r\nThe first author would like to thank Daniel Dadush for suggesting the use of discrepancy techniques to solve the transaction aggregation problem.","file_date_updated":"2024-08-19T06:45:21Z","date_published":"2022-09-19T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"ama":"Tiwari S, Yeo MX, Avarikioti Z, Salem I, Pietrzak KZ, Schmid S. Wiser: Increasing throughput in payment channel networks with transaction aggregation. In: Proceedings of the 4th ACM Conference on Advances in Financial Technologies. Association for Computing Machinery; 2022:217-231. doi:10.1145/3558535.3559775","ieee":"S. Tiwari, M. X. Yeo, Z. Avarikioti, I. Salem, K. Z. Pietrzak, and S. Schmid, “Wiser: Increasing throughput in payment channel networks with transaction aggregation,” in Proceedings of the 4th ACM Conference on Advances in Financial Technologies, Cambridge, MA, United States, 2022, pp. 217–231.","apa":"Tiwari, S., Yeo, M. X., Avarikioti, Z., Salem, I., Pietrzak, K. Z., & Schmid, S. (2022). Wiser: Increasing throughput in payment channel networks with transaction aggregation. In Proceedings of the 4th ACM Conference on Advances in Financial Technologies (pp. 217–231). Cambridge, MA, United States: Association for Computing Machinery. https://doi.org/10.1145/3558535.3559775","ista":"Tiwari S, Yeo MX, Avarikioti Z, Salem I, Pietrzak KZ, Schmid S. 2022. Wiser: Increasing throughput in payment channel networks with transaction aggregation. Proceedings of the 4th ACM Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, 217–231.","short":"S. Tiwari, M.X. Yeo, Z. Avarikioti, I. Salem, K.Z. Pietrzak, S. Schmid, in:, Proceedings of the 4th ACM Conference on Advances in Financial Technologies, Association for Computing Machinery, 2022, pp. 217–231.","mla":"Tiwari, Samarth, et al. “Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation.” Proceedings of the 4th ACM Conference on Advances in Financial Technologies, Association for Computing Machinery, 2022, pp. 217–31, doi:10.1145/3558535.3559775.","chicago":"Tiwari, Samarth, Michelle X Yeo, Zeta Avarikioti, Iosif Salem, Krzysztof Z Pietrzak, and Stefan Schmid. “Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation.” In Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 217–31. Association for Computing Machinery, 2022. https://doi.org/10.1145/3558535.3559775."},"scopus_import":"1","quality_controlled":"1","publication":"Proceedings of the 4th ACM Conference on Advances in Financial Technologies","month":"09","status":"public","ddc":["000"],"isi":1,"author":[{"full_name":"Tiwari, Samarth","first_name":"Samarth","last_name":"Tiwari"},{"last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809"},{"first_name":"Zeta","full_name":"Avarikioti, Zeta","last_name":"Avarikioti"},{"first_name":"Iosif","full_name":"Salem, Iosif","last_name":"Salem"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"day":"19","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1145/3558535.3559775"},{"oa":1,"article_processing_charge":"Yes","publication_status":"published","oa_version":"Published Version","pmid":1,"fulldoi":"https://doi.org/10.1093/pnasnexus/pgac141","date_created":"2024-05-28T14:23:12Z","publication_identifier":{"issn":["2752-6542"]},"title":"Evolutionary instability of selfish learning in repeated games","_id":"17061","department":[{"_id":"KrCh"}],"file":[{"access_level":"open_access","file_name":"2022_PNASNexus_McAvoy.pdf","date_updated":"2024-08-06T07:33:30Z","relation":"main_file","creator":"dernst","checksum":"79a8e3e4be7e8a2b407b4efddd65f3f3","content_type":"application/pdf","file_id":"17400","file_size":2410962,"date_created":"2024-08-06T07:33:30Z","success":1}],"intvolume":" 1","date_updated":"2025-06-11T13:54:20Z","volume":1,"article_number":"pgac141","abstract":[{"lang":"eng","text":"Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one’s own success. However, when two such “selfish” learners interact with each other, the outcome can be detrimental to both, especially when there are conflicts of interest. Here, we explore how a learner can align incentives with a selfish opponent. Moreover, we consider the dynamics that arise when learning rules themselves are subject to evolutionary pressure. By combining extensive simulations and analytical techniques, we demonstrate that selfish learning is unstable in most classical two-player repeated games. If evolution operates on the level of long-run payoffs, selection instead favors learning rules that incorporate social (other-regarding) preferences. To further corroborate these results, we analyze data from a repeated prisoner’s dilemma experiment. We find that selfish learning is insufficient to explain human behavior when there is a trade-off between payoff maximization and fairness."}],"arxiv":1,"year":"2022","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"language":[{"iso":"eng"}],"publisher":"Oxford University Press","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1093/pnasnexus/pgac141","day":"01","article_type":"original","issue":"4","ddc":["000"],"month":"09","status":"public","author":[{"last_name":"McAvoy","full_name":"McAvoy, Alex","first_name":"Alex"},{"last_name":"Kates-Harbeck","first_name":"Julian","full_name":"Kates-Harbeck, Julian"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe"}],"quality_controlled":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/alexmcavoy/fmtl/"}]},"publication":"PNAS Nexus","scopus_import":"1","ec_funded":1,"citation":{"ama":"McAvoy A, Kates-Harbeck J, Chatterjee K, Hilbe C. Evolutionary instability of selfish learning in repeated games. PNAS Nexus. 2022;1(4). doi:10.1093/pnasnexus/pgac141","ieee":"A. McAvoy, J. Kates-Harbeck, K. Chatterjee, and C. Hilbe, “Evolutionary instability of selfish learning in repeated games,” PNAS Nexus, vol. 1, no. 4. Oxford University Press, 2022.","mla":"McAvoy, Alex, et al. “Evolutionary Instability of Selfish Learning in Repeated Games.” PNAS Nexus, vol. 1, no. 4, pgac141, Oxford University Press, 2022, doi:10.1093/pnasnexus/pgac141.","ista":"McAvoy A, Kates-Harbeck J, Chatterjee K, Hilbe C. 2022. Evolutionary instability of selfish learning in repeated games. PNAS Nexus. 1(4), pgac141.","apa":"McAvoy, A., Kates-Harbeck, J., Chatterjee, K., & Hilbe, C. (2022). Evolutionary instability of selfish learning in repeated games. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgac141","short":"A. McAvoy, J. Kates-Harbeck, K. Chatterjee, C. Hilbe, PNAS Nexus 1 (2022).","chicago":"McAvoy, Alex, Julian Kates-Harbeck, Krishnendu Chatterjee, and Christian Hilbe. “Evolutionary Instability of Selfish Learning in Repeated Games.” PNAS Nexus. Oxford University Press, 2022. https://doi.org/10.1093/pnasnexus/pgac141."},"file_date_updated":"2024-08-06T07:33:30Z","acknowledgement":"The authors are grateful to Jörg Oechssler for many helpful comments. A.M. was supported by a Simons Postdoctoral Fellowship (Math+X) at the University of Pennsylvania; K.C. was supported by the European Research Council Consolidator Grant 863818 (ForM-SMArt); and C.H. was supported by the European Research Council Starting Grant 850529 (E-DIRECT).","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-09-01T00:00:00Z","external_id":{"pmid":["36714856"],"arxiv":["2105.06199"]}},{"_id":"17065","title":"Co-optimization of design and fabrication plans for carpentry","department":[{"_id":"BeBi"}],"date_created":"2024-05-29T06:09:23Z","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"publication_status":"published","fulldoi":"https://doi.org/10.1145/3508499","oa_version":"Preprint","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"Association for Computing Machinery","article_number":"32","volume":41,"arxiv":1,"abstract":[{"lang":"eng","text":"Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely restrict to a single design, instead considering families of design variations, sometimes adjusting designs to simplify fabrication. Jointly exploring the design and fabrication plan spaces for each design is intractable using current techniques. We present a new approach to jointly optimize design and fabrication plans for carpentered objects. To make this bi-level optimization tractable, we adapt recent work from program synthesis based on equality graphs (e-graphs), which encode sets of equivalent programs. Our insight is that subproblems within our bi-level problem share significant substructures. By representing both designs and fabrication plans in a new bag of parts (BOP) e-graph, we amortize the cost of optimizing design components shared among multiple candidates. Even using BOP e-graphs, the optimization space grows quickly in practice. Hence, we also show how a feedback-guided search strategy dubbed Iterative Contraction and Expansion on E-graphs (ICEE) can keep the size of the e-graph manageable and direct the search towards promising candidates. We illustrate the advantages of our pipeline through examples from the carpentry domain."}],"intvolume":" 41","date_updated":"2024-08-06T07:03:14Z","quality_controlled":"1","publication":"ACM Transactions on Graphics","issue":"3","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2107.12265"}],"author":[{"full_name":"Zhao, Haisen","orcid":"0000-0002-6389-1045","id":"fb7f793a-80d1-11eb-8869-d56e5b2a8ff4","first_name":"Haisen","last_name":"Zhao"},{"full_name":"Willsey, Max","first_name":"Max","last_name":"Willsey"},{"last_name":"Zhu","first_name":"Amy","full_name":"Zhu, Amy"},{"full_name":"Nandi, Chandrakana","first_name":"Chandrakana","last_name":"Nandi"},{"last_name":"Tatlock","full_name":"Tatlock, Zachary","first_name":"Zachary"},{"last_name":"Solomon","first_name":"Justin","full_name":"Solomon, Justin"},{"first_name":"Adriana","full_name":"Schulz, Adriana","last_name":"Schulz"}],"status":"public","month":"03","article_type":"original","day":"09","doi":"10.1145/3508499","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2107.12265"]},"acknowledgement":"The authors would like to thank anonymous reviewers for their helpful feedback; Haomiao Wu for her contribution to the algorithm development in the early stage of the project; Elias Baldwin, David Tsay, Alexander Lefort, and Qiyang Tan for helping the experiments.","date_published":"2022-03-09T00:00:00Z","citation":{"ieee":"H. Zhao et al., “Co-optimization of design and fabrication plans for carpentry,” ACM Transactions on Graphics, vol. 41, no. 3. Association for Computing Machinery, 2022.","ama":"Zhao H, Willsey M, Zhu A, et al. Co-optimization of design and fabrication plans for carpentry. ACM Transactions on Graphics. 2022;41(3). doi:10.1145/3508499","chicago":"Zhao, Haisen, Max Willsey, Amy Zhu, Chandrakana Nandi, Zachary Tatlock, Justin Solomon, and Adriana Schulz. “Co-Optimization of Design and Fabrication Plans for Carpentry.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3508499.","mla":"Zhao, Haisen, et al. “Co-Optimization of Design and Fabrication Plans for Carpentry.” ACM Transactions on Graphics, vol. 41, no. 3, 32, Association for Computing Machinery, 2022, doi:10.1145/3508499.","ista":"Zhao H, Willsey M, Zhu A, Nandi C, Tatlock Z, Solomon J, Schulz A. 2022. Co-optimization of design and fabrication plans for carpentry. ACM Transactions on Graphics. 41(3), 32.","short":"H. Zhao, M. Willsey, A. Zhu, C. Nandi, Z. Tatlock, J. Solomon, A. Schulz, ACM Transactions on Graphics 41 (2022).","apa":"Zhao, H., Willsey, M., Zhu, A., Nandi, C., Tatlock, Z., Solomon, J., & Schulz, A. (2022). Co-optimization of design and fabrication plans for carpentry. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3508499"},"scopus_import":"1"},{"language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"Public Library of Science","article_number":"e3001786","volume":20,"abstract":[{"lang":"eng","text":"A cell’s size affects the likelihood that it will die. But how is cell size controlled in this context and how does cell size impact commitment to the cell death fate? We present evidence that the caspase CED-3 interacts with the RhoGEF ECT-2 in Caenorhabditis elegans neuroblasts that generate “unwanted” cells. We propose that this interaction promotes polar actomyosin contractility, which leads to unequal neuroblast division and the generation of a daughter cell that is below the critical “lethal” size threshold. Furthermore, we find that hyperactivation of ECT-2 RhoGEF reduces the sizes of unwanted cells. Importantly, this suppresses the “cell death abnormal” phenotype caused by the partial loss of ced-3 caspase and therefore increases the likelihood that unwanted cells die. A putative null mutation of ced-3 caspase, however, is not suppressed, which indicates that cell size affects CED-3 caspase activation and/or activity. Therefore, we have uncovered novel sequential and reciprocal interactions between the apoptosis pathway and cell size that impact a cell’s commitment to the cell death fate."}],"file":[{"success":1,"file_size":2515388,"date_created":"2024-08-06T07:07:52Z","creator":"dernst","content_type":"application/pdf","checksum":"a7b46460b7819c196028481cc18a7c85","file_id":"17399","access_level":"open_access","file_name":"2022_PlosBio_Sethi.pdf","relation":"main_file","date_updated":"2024-08-06T07:07:52Z"}],"date_updated":"2024-08-06T07:08:54Z","intvolume":" 20","_id":"17066","title":"A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans","department":[{"_id":"CaHe"}],"date_created":"2024-05-29T06:09:34Z","publication_identifier":{"issn":["1545-7885"]},"publication_status":"published","pmid":1,"fulldoi":"https://doi.org/10.1371/journal.pbio.3001786","oa_version":"Published Version","oa":1,"article_processing_charge":"Yes","external_id":{"pmid":["36201522"]},"has_accepted_license":"1","file_date_updated":"2024-08-06T07:07:52Z","acknowledgement":"We thank members of the Conradt, Lambie, and Hajnal labs for discussions and comments on the manuscript. We thank M. Bauer, L. Jocham, N. Lebedeva, and L. McGuinness for excellent technical support; A. Hajnal and T. Kohlbrenner (University of Zurich, Switzerland) for allele zh135; and H.R. Horvitz (Massachusetts of Technology, USA) for plasmid pET-CED-3.\r\nSome strains were provided by the Caenorhabditis Genetics Center (CGC), which is funded by NIH Office of Research Infrastructure Programs (https://orip.nih.gov/) (P40 OD010440). This work was supported by UCL (Capital Equipment Fund, CEF2), a predoctoral fellowship from the China Scholarship Council (https://www.csc.edu.cn/) to HW, a predoctoral fellowship from the Studienstiftung des Deutschen Volkes (https://www.studienstiftung.de/) to NM, a Wolfson Fellowship from the Royal Society (https://royalsociety.org/) to BC (RSWF\\R1\\180008), the Deutsche Forschungsgemeinschaft (https://www.dfg.de/en/index.jsp) (ZA619/3-1 and ZA619/3-2 to EZ; C0204/10-1 and EXC114 to BC), and the Biotechnology and Biological Sciences Research Council (https://bbsrc.ukri.org/) (BB/V007572/1 to BC). ","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-10-06T00:00:00Z","citation":{"ama":"Sethi A, Wei H, Mishra N, et al. A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans. PLOS Biology. 2022;20(10). doi:10.1371/journal.pbio.3001786","ieee":"A. Sethi et al., “A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans,” PLOS Biology, vol. 20, no. 10. Public Library of Science, 2022.","chicago":"Sethi, Aditya, Hai Wei, Nikhil Mishra, Ioannis Segos, Eric J. Lambie, Esther Zanin, and Barbara Conradt. “A Caspase–RhoGEF Axis Contributes to the Cell Size Threshold for Apoptotic Death in Developing Caenorhabditis Elegans.” PLOS Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pbio.3001786.","apa":"Sethi, A., Wei, H., Mishra, N., Segos, I., Lambie, E. J., Zanin, E., & Conradt, B. (2022). A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans. PLOS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3001786","ista":"Sethi A, Wei H, Mishra N, Segos I, Lambie EJ, Zanin E, Conradt B. 2022. A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans. PLOS Biology. 20(10), e3001786.","short":"A. Sethi, H. Wei, N. Mishra, I. Segos, E.J. Lambie, E. Zanin, B. Conradt, PLOS Biology 20 (2022).","mla":"Sethi, Aditya, et al. “A Caspase–RhoGEF Axis Contributes to the Cell Size Threshold for Apoptotic Death in Developing Caenorhabditis Elegans.” PLOS Biology, vol. 20, no. 10, e3001786, Public Library of Science, 2022, doi:10.1371/journal.pbio.3001786."},"scopus_import":"1","quality_controlled":"1","publication":"PLOS Biology","issue":"10","author":[{"first_name":"Aditya","full_name":"Sethi, Aditya","last_name":"Sethi"},{"last_name":"Wei","full_name":"Wei, Hai","first_name":"Hai"},{"last_name":"Mishra","first_name":"Nikhil","id":"C4D70E82-1081-11EA-B3ED-9A4C3DDC885E","full_name":"Mishra, Nikhil","orcid":"0000-0002-6425-5788"},{"full_name":"Segos, Ioannis","first_name":"Ioannis","last_name":"Segos"},{"last_name":"Lambie","full_name":"Lambie, Eric J.","first_name":"Eric J."},{"full_name":"Zanin, Esther","first_name":"Esther","last_name":"Zanin"},{"last_name":"Conradt","full_name":"Conradt, Barbara","first_name":"Barbara"}],"month":"10","status":"public","ddc":["570"],"article_type":"original","day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1371/journal.pbio.3001786"},{"date_created":"2024-05-29T06:10:05Z","publication_identifier":{"issn":["0969-9961"]},"title":"Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells","_id":"17067","department":[{"_id":"SiHi"}],"oa":1,"article_processing_charge":"Yes","publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1016/j.nbd.2022.105702","pmid":1,"year":"2022","language":[{"iso":"eng"}],"publisher":"Elsevier","type":"journal_article","file":[{"file_name":"2022_NeurobioDisease_Stouffer.pdf","access_level":"open_access","date_updated":"2024-08-06T06:54:24Z","relation":"main_file","creator":"dernst","content_type":"application/pdf","checksum":"b705d3d23d0b424ba29920be7ab64c23","file_id":"17398","file_size":8890818,"date_created":"2024-08-06T06:54:24Z","success":1}],"intvolume":" 168","date_updated":"2024-08-06T06:57:39Z","volume":168,"article_number":"105702","abstract":[{"lang":"eng","text":"Human doublecortin (DCX) mutations are associated with severe brain malformations leading to aberrant neuron positioning (heterotopia), intellectual disability and epilepsy. DCX is a microtubule-associated protein which plays a key role during neurodevelopment in neuronal migration and differentiation. Dcx knockout (KO) mice show disorganized hippocampal pyramidal neurons. The CA2/CA3 pyramidal cell layer is present as two abnormal layers and disorganized CA3 KO pyramidal neurons are also more excitable than wild-type (WT) cells. To further identify abnormalities, we characterized Dcx KO hippocampal neurons at subcellular, molecular and ultrastructural levels. Severe defects were observed in mitochondria, affecting number and distribution. Also, the Golgi apparatus was visibly abnormal, increased in volume and abnormally organized. Transcriptome analyses from laser microdissected hippocampal tissue at postnatal day 60 (P60) highlighted organelle abnormalities. Ultrastructural studies of CA3 cells performed in P60 (young adult) and > 9 months (mature) tissue showed that organelle defects are persistent throughout life. Locomotor activity and fear memory of young and mature adults were also abnormal: Dcx KO mice consistently performed less well than WT littermates, with defects becoming more severe with age. Thus, we show that disruption of a neurodevelopmentally-regulated gene can lead to permanent organelle anomalies contributing to abnormal adult behavior."}],"ddc":["570"],"status":"public","month":"06","author":[{"id":"4C9372C4-F248-11E8-B48F-1D18A9856A87","full_name":"Stouffer, Melissa A","first_name":"Melissa A","last_name":"Stouffer"},{"full_name":"Khalaf-Nazzal, R.","first_name":"R.","last_name":"Khalaf-Nazzal"},{"first_name":"C.","full_name":"Cifuentes-Diaz, C.","last_name":"Cifuentes-Diaz"},{"last_name":"Albertini","first_name":"G.","full_name":"Albertini, G."},{"first_name":"E.","full_name":"Bandet, E.","last_name":"Bandet"},{"last_name":"Grannec","full_name":"Grannec, G.","first_name":"G."},{"first_name":"V.","full_name":"Lavilla, V.","last_name":"Lavilla"},{"last_name":"Deleuze","first_name":"J.-F.","full_name":"Deleuze, J.-F."},{"last_name":"Olaso","full_name":"Olaso, R.","first_name":"R."},{"last_name":"Nosten-Bertrand","first_name":"M.","full_name":"Nosten-Bertrand, M."},{"full_name":"Francis, F.","first_name":"F.","last_name":"Francis"}],"quality_controlled":"1","publication":"Neurobiology of Disease","doi":"10.1016/j.nbd.2022.105702","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","article_type":"original","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","has_accepted_license":"1","file_date_updated":"2024-08-06T06:54:24Z","acknowledgement":"We thank Sylvie Dumont for initial aid with laser microdissection and G. Martinez-Lorenzana for experimental help with electron microscopy. We thank the animal experimentation facility and cellular and tissue imaging platforms at the Institut du Fer à Moulin, supported also by the Région Ile de France and the FRC Rotary. The Francis lab was associated with the BioPsy Labex project and the Ecole des Neurosciences de Paris Ile-de-France (ENP) network. Our salaries and lab were supported by Inserm, the Centre national de la recherche scientifique (CNRS) and Sorbonne University. The Francis group obtained the following funding contributing to this project: the European Union (EU- HEALTH-2013, DESIRE, N° 60253), the JTC 2015 Neurodevelopmental Disorders affiliated with the French Agence National de la Recherche (for \r\nNEURON8-Full- 815-006 STEM-MCD, to FF), E-Rare-3, the ERA-Net for Research on Rare Diseases affiliated with the French ANR (ERARE18-049), the European Cooperation on Science and Technology (COST Action CA16118).","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"date_published":"2022-06-15T00:00:00Z","external_id":{"pmid":["35339680"]},"scopus_import":"1","citation":{"chicago":"Stouffer, Melissa A, R. Khalaf-Nazzal, C. Cifuentes-Diaz, G. Albertini, E. Bandet, G. Grannec, V. Lavilla, et al. “Doublecortin Mutation Leads to Persistent Defects in the Golgi Apparatus and Mitochondria in Adult Hippocampal Pyramidal Cells.” Neurobiology of Disease. Elsevier, 2022. https://doi.org/10.1016/j.nbd.2022.105702.","mla":"Stouffer, Melissa A., et al. “Doublecortin Mutation Leads to Persistent Defects in the Golgi Apparatus and Mitochondria in Adult Hippocampal Pyramidal Cells.” Neurobiology of Disease, vol. 168, 105702, Elsevier, 2022, doi:10.1016/j.nbd.2022.105702.","ista":"Stouffer MA, Khalaf-Nazzal R, Cifuentes-Diaz C, Albertini G, Bandet E, Grannec G, Lavilla V, Deleuze J-F, Olaso R, Nosten-Bertrand M, Francis F. 2022. Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells. Neurobiology of Disease. 168, 105702.","short":"M.A. Stouffer, R. Khalaf-Nazzal, C. Cifuentes-Diaz, G. Albertini, E. Bandet, G. Grannec, V. Lavilla, J.-F. Deleuze, R. Olaso, M. Nosten-Bertrand, F. Francis, Neurobiology of Disease 168 (2022).","apa":"Stouffer, M. A., Khalaf-Nazzal, R., Cifuentes-Diaz, C., Albertini, G., Bandet, E., Grannec, G., … Francis, F. (2022). Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells. Neurobiology of Disease. Elsevier. https://doi.org/10.1016/j.nbd.2022.105702","ieee":"M. A. Stouffer et al., “Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells,” Neurobiology of Disease, vol. 168. Elsevier, 2022.","ama":"Stouffer MA, Khalaf-Nazzal R, Cifuentes-Diaz C, et al. Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells. Neurobiology of Disease. 2022;168. doi:10.1016/j.nbd.2022.105702"}},{"quality_controlled":"1","publication":"Plant Communications","issue":"2","month":"03","ddc":["580"],"status":"public","author":[{"last_name":"Navarrete","full_name":"Navarrete, Fernando","first_name":"Fernando"},{"last_name":"Gallei","full_name":"Gallei, Michelle C","orcid":"0000-0003-1286-7368","id":"35A03822-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle C"},{"first_name":"Aleksandra E.","full_name":"Kornienko, Aleksandra E.","last_name":"Kornienko"},{"last_name":"Saado","first_name":"Indira","full_name":"Saado, Indira"},{"last_name":"Khan","full_name":"Khan, Mamoona","first_name":"Mamoona"},{"first_name":"Khong-Sam","full_name":"Chia, Khong-Sam","last_name":"Chia"},{"last_name":"Darino","first_name":"Martin A.","full_name":"Darino, Martin A."},{"last_name":"Bindics","full_name":"Bindics, Janos","first_name":"Janos"},{"full_name":"Djamei, Armin","first_name":"Armin","last_name":"Djamei"}],"day":"14","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.xplc.2021.100269","external_id":{"pmid":["35529945"]},"has_accepted_license":"1","acknowledgement":"The research leading to these results received funding from the European Research Council under the European Union Seventh Framework Programme ERC-2013-STG grant agreement \r\n335691; the Austrian Science Fund (FWF) P27818-B22,I 3033-B22; the Austrian Academy of Sciences (OEAW); and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - EXC 2070-390732324.\r\nWe would like to thank the GMI/IMBA/IMP core facilities for excellent technical support, especially the BioOptics and Molecular Biology Services. We thank the Plant Sciences and Next Generation Sequencing Facilities at the Vienna BioCenter Core Facilities GmbH (VBCF). We are grateful to the Jirí Friml and Jürgen Kleine-Vehn laboratories for providing useful A. thaliana lines. We thank Mathias Madalinski for peptide synthesis and Dr. J. Matthew Watson for proofreading and valuable feedback on the manuscript. The authors declare no competing interests.","file_date_updated":"2024-08-05T10:26:29Z","date_published":"2022-03-14T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"citation":{"ieee":"F. Navarrete et al., “TOPLESS promotes plant immunity by repressing auxin signaling and is targeted by the fungal effector Naked1,” Plant Communications, vol. 3, no. 2. Elsevier, 2022.","ama":"Navarrete F, Gallei MC, Kornienko AE, et al. TOPLESS promotes plant immunity by repressing auxin signaling and is targeted by the fungal effector Naked1. Plant Communications. 2022;3(2). doi:10.1016/j.xplc.2021.100269","short":"F. Navarrete, M.C. Gallei, A.E. Kornienko, I. Saado, M. Khan, K.-S. Chia, M.A. Darino, J. Bindics, A. Djamei, Plant Communications 3 (2022).","apa":"Navarrete, F., Gallei, M. C., Kornienko, A. E., Saado, I., Khan, M., Chia, K.-S., … Djamei, A. (2022). TOPLESS promotes plant immunity by repressing auxin signaling and is targeted by the fungal effector Naked1. Plant Communications. Elsevier. https://doi.org/10.1016/j.xplc.2021.100269","ista":"Navarrete F, Gallei MC, Kornienko AE, Saado I, Khan M, Chia K-S, Darino MA, Bindics J, Djamei A. 2022. TOPLESS promotes plant immunity by repressing auxin signaling and is targeted by the fungal effector Naked1. Plant Communications. 3(2), 100269.","mla":"Navarrete, Fernando, et al. “TOPLESS Promotes Plant Immunity by Repressing Auxin Signaling and Is Targeted by the Fungal Effector Naked1.” Plant Communications, vol. 3, no. 2, 100269, Elsevier, 2022, doi:10.1016/j.xplc.2021.100269.","chicago":"Navarrete, Fernando, Michelle C Gallei, Aleksandra E. Kornienko, Indira Saado, Mamoona Khan, Khong-Sam Chia, Martin A. Darino, Janos Bindics, and Armin Djamei. “TOPLESS Promotes Plant Immunity by Repressing Auxin Signaling and Is Targeted by the Fungal Effector Naked1.” Plant Communications. Elsevier, 2022. https://doi.org/10.1016/j.xplc.2021.100269."},"scopus_import":"1","title":"TOPLESS promotes plant immunity by repressing auxin signaling and is targeted by the fungal effector Naked1","_id":"17068","department":[{"_id":"JiFr"}],"date_created":"2024-05-29T06:10:22Z","publication_identifier":{"issn":["2590-3462"]},"publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1016/j.xplc.2021.100269","pmid":1,"oa":1,"article_processing_charge":"Yes","year":"2022","language":[{"iso":"eng"}],"publisher":"Elsevier","type":"journal_article","volume":3,"article_number":"100269","abstract":[{"lang":"eng","text":"In plants, the antagonism between growth and defense is hardwired by hormonal signaling. The perception of pathogen-associated molecular patterns (PAMPs) from invading microorganisms inhibits auxin signaling and plant growth. Conversely, pathogens manipulate auxin signaling to promote disease, but how this hormone inhibits immunity is not fully understood. Ustilago maydis is a maize pathogen that induces auxin signaling in its host. We characterized a U. maydis effector protein, Naked1 (Nkd1), that is translocated into the host nucleus. Through its native ethylene-responsive element binding factor-associated amphiphilic repression (EAR) motif, Nkd1 binds to the transcriptional co-repressors TOPLESS/TOPLESS-related (TPL/TPRs) and prevents the recruitment of a transcriptional repressor involved in hormonal signaling, leading to the de-repression of auxin and jasmonate signaling and thereby promoting susceptibility to (hemi)biotrophic pathogens. A moderate upregulation of auxin signaling inhibits the PAMP-triggered reactive oxygen species (ROS) burst, an early defense response. Thus, our findings establish a clear mechanism for auxin-induced pathogen susceptibility. Engineered Nkd1 variants with increased expression or increased EAR-mediated TPL/TPR binding trigger typical salicylic-acid-mediated defense reactions, leading to pathogen resistance. This implies that moderate binding of Nkd1 to TPL is a result of a balancing evolutionary selection process to enable TPL manipulation while avoiding host recognition."}],"file":[{"relation":"main_file","date_updated":"2024-08-05T10:26:29Z","file_name":"2022_PlantComm_Navarrete.pdf","access_level":"open_access","creator":"dernst","file_id":"17393","content_type":"application/pdf","checksum":"1eeb6ee65419e4aa34627fea6857f343","file_size":3216686,"date_created":"2024-08-05T10:26:29Z","success":1}],"intvolume":" 3","date_updated":"2024-08-05T10:27:03Z"},{"issue":"6578","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9040003"}],"author":[{"full_name":"Zhong, Sheng","first_name":"Sheng","last_name":"Zhong"},{"first_name":"Ling","full_name":"Li, Ling","last_name":"Li"},{"last_name":"Wang","first_name":"Zhijuan","full_name":"Wang, Zhijuan"},{"last_name":"Ge","id":"f43371a3-09ff-11eb-8013-bd0c6a2f6de8","orcid":"0000-0001-9381-3577","full_name":"Ge, Zengxiang","first_name":"Zengxiang"},{"first_name":"Qiyun","full_name":"Li, Qiyun","last_name":"Li"},{"last_name":"Bleckmann","full_name":"Bleckmann, Andrea","first_name":"Andrea"},{"full_name":"Wang, Jizong","first_name":"Jizong","last_name":"Wang"},{"first_name":"Zihan","full_name":"Song, Zihan","last_name":"Song"},{"full_name":"Shi, Yihao","first_name":"Yihao","last_name":"Shi"},{"last_name":"Liu","first_name":"Tianxu","full_name":"Liu, Tianxu"},{"last_name":"Li","full_name":"Li, Luhan","first_name":"Luhan"},{"last_name":"Zhou","full_name":"Zhou, Huabin","first_name":"Huabin"},{"last_name":"Wang","first_name":"Yanyan","full_name":"Wang, Yanyan"},{"full_name":"Zhang, Li","first_name":"Li","last_name":"Zhang"},{"first_name":"Hen-Ming","full_name":"Wu, Hen-Ming","last_name":"Wu"},{"first_name":"Luhua","full_name":"Lai, Luhua","last_name":"Lai"},{"last_name":"Gu","full_name":"Gu, Hongya","first_name":"Hongya"},{"last_name":"Dong","first_name":"Juan","full_name":"Dong, Juan"},{"last_name":"Cheung","first_name":"Alice Y.","full_name":"Cheung, Alice Y."},{"last_name":"Dresselhaus","first_name":"Thomas","full_name":"Dresselhaus, Thomas"},{"first_name":"Li-Jia","full_name":"Qu, Li-Jia","last_name":"Qu"}],"month":"01","status":"public","quality_controlled":"1","publication":"Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1126/science.abl4683","article_type":"original","day":"20","acknowledgement":"We thank D. Ye for providing fer-4 and myb97 myb101 myb120 mutant seeds; L. Smith for sharing anj, herk1, anj herk1, and fer anj herk1 mutant seeds; J. F. Harper for providing aca9 mutant seeds; and C. Li and Q. Duan for sharing fer+/− mutant seeds.\r\nL.-J.Q. was funded by the National Natural Science Foundation of China (grant nos. 31991202, 31830004, 31620103903, and 31621001), S.Z. was supported by the Young Elite Scientists Sponsorship Program by the China Association of Science and Technology (2019QNRC001), Z.G. was supported by a NSFC Young Scientists Fund (31900161), A.Y.C. was funded by the US Natural Science Foundation (IOS-1645854, MCB-1715764, and MCB-0955910), J.D. was funded by the National Institute of Health (R01GM109080), and T.D. was supported by the German Research Foundation DFG (SFB924).","date_published":"2022-01-20T00:00:00Z","external_id":{"pmid":["35050671"]},"scopus_import":"1","citation":{"ieee":"S. Zhong et al., “RALF peptide signaling controls the polytubey block in Arabidopsis,” Science, vol. 375, no. 6578. American Association for the Advancement of Science, pp. 290–296, 2022.","ama":"Zhong S, Li L, Wang Z, et al. RALF peptide signaling controls the polytubey block in Arabidopsis. Science. 2022;375(6578):290-296. doi:10.1126/science.abl4683","chicago":"Zhong, Sheng, Ling Li, Zhijuan Wang, Zengxiang Ge, Qiyun Li, Andrea Bleckmann, Jizong Wang, et al. “RALF Peptide Signaling Controls the Polytubey Block in Arabidopsis.” Science. American Association for the Advancement of Science, 2022. https://doi.org/10.1126/science.abl4683.","ista":"Zhong S, Li L, Wang Z, Ge Z, Li Q, Bleckmann A, Wang J, Song Z, Shi Y, Liu T, Li L, Zhou H, Wang Y, Zhang L, Wu H-M, Lai L, Gu H, Dong J, Cheung AY, Dresselhaus T, Qu L-J. 2022. RALF peptide signaling controls the polytubey block in Arabidopsis. Science. 375(6578), 290–296.","short":"S. Zhong, L. Li, Z. Wang, Z. Ge, Q. Li, A. Bleckmann, J. Wang, Z. Song, Y. Shi, T. Liu, L. Li, H. Zhou, Y. Wang, L. Zhang, H.-M. Wu, L. Lai, H. Gu, J. Dong, A.Y. Cheung, T. Dresselhaus, L.-J. Qu, Science 375 (2022) 290–296.","apa":"Zhong, S., Li, L., Wang, Z., Ge, Z., Li, Q., Bleckmann, A., … Qu, L.-J. (2022). RALF peptide signaling controls the polytubey block in Arabidopsis. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.abl4683","mla":"Zhong, Sheng, et al. “RALF Peptide Signaling Controls the Polytubey Block in Arabidopsis.” Science, vol. 375, no. 6578, American Association for the Advancement of Science, 2022, pp. 290–96, doi:10.1126/science.abl4683."},"date_created":"2024-05-29T06:11:10Z","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"_id":"17069","title":"RALF peptide signaling controls the polytubey block in Arabidopsis","department":[{"_id":"JiFr"}],"oa":1,"article_processing_charge":"No","OA_place":"repository","publication_status":"published","fulldoi":"https://doi.org/10.1126/science.abl4683","pmid":1,"oa_version":"Submitted Version","language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"American Association for the Advancement of Science","date_updated":"2025-04-24T11:39:46Z","OA_type":"green","intvolume":" 375","page":"290-296","volume":375,"abstract":[{"text":"Fertilization of an egg by multiple sperm (polyspermy) leads to lethal genome imbalance and chromosome segregation defects. In Arabidopsis thaliana, the block to polyspermy is facilitated by a mechanism that prevents polytubey (the arrival of multiple pollen tubes to one ovule). We show here that FERONIA, ANJEA, and HERCULES RECEPTOR KINASE 1 receptor-like kinases located at the septum interact with pollen tube–specific RALF6, 7, 16, 36, and 37 peptide ligands to establish this polytubey block. The same combination of RALF (rapid alkalinization factor) peptides and receptor complexes controls pollen tube reception and rupture inside the targeted ovule. Pollen tube rupture releases the polytubey block at the septum, which allows the emergence of secondary pollen tubes upon fertilization failure. Thus, orchestrated steps in the fertilization process in Arabidopsis are coordinated by the same signaling components to guarantee and optimize reproductive success.","lang":"eng"}]},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-09-08T00:00:00Z","has_accepted_license":"1","file_date_updated":"2024-07-31T12:13:16Z","external_id":{"arxiv":["2204.10960"]},"scopus_import":"1","citation":{"chicago":"Mistakidis, S I, Georgios Koutentakis, F Grusdt, P Schmelcher, and H R Sadeghpour. “Inducing Spin-Order with an Impurity: Phase Diagram of the Magnetic Bose Polaron.” New Journal of Physics. IOP Publishing, 2022. https://doi.org/10.1088/1367-2630/ac836c.","ista":"Mistakidis SI, Koutentakis G, Grusdt F, Schmelcher P, Sadeghpour HR. 2022. Inducing spin-order with an impurity: phase diagram of the magnetic Bose polaron. New Journal of Physics. 24(8), 083030.","short":"S.I. Mistakidis, G. Koutentakis, F. Grusdt, P. Schmelcher, H.R. Sadeghpour, New Journal of Physics 24 (2022).","apa":"Mistakidis, S. I., Koutentakis, G., Grusdt, F., Schmelcher, P., & Sadeghpour, H. R. (2022). Inducing spin-order with an impurity: phase diagram of the magnetic Bose polaron. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/ac836c","mla":"Mistakidis, S. I., et al. “Inducing Spin-Order with an Impurity: Phase Diagram of the Magnetic Bose Polaron.” New Journal of Physics, vol. 24, no. 8, 083030, IOP Publishing, 2022, doi:10.1088/1367-2630/ac836c.","ama":"Mistakidis SI, Koutentakis G, Grusdt F, Schmelcher P, Sadeghpour HR. Inducing spin-order with an impurity: phase diagram of the magnetic Bose polaron. New Journal of Physics. 2022;24(8). doi:10.1088/1367-2630/ac836c","ieee":"S. I. Mistakidis, G. Koutentakis, F. Grusdt, P. Schmelcher, and H. R. Sadeghpour, “Inducing spin-order with an impurity: phase diagram of the magnetic Bose polaron,” New Journal of Physics, vol. 24, no. 8. IOP Publishing, 2022."},"author":[{"first_name":"S I","full_name":"Mistakidis, S I","last_name":"Mistakidis"},{"last_name":"Koutentakis","full_name":"Koutentakis, Georgios","id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios"},{"full_name":"Grusdt, F","first_name":"F","last_name":"Grusdt"},{"last_name":"Schmelcher","full_name":"Schmelcher, P","first_name":"P"},{"full_name":"Sadeghpour, H R","first_name":"H R","last_name":"Sadeghpour"}],"month":"09","ddc":["530"],"status":"public","issue":"8","publication":"New Journal of Physics","quality_controlled":"1","doi":"10.1088/1367-2630/ac836c","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","day":"08","type":"journal_article","publisher":"IOP Publishing","language":[{"iso":"eng"}],"year":"2022","intvolume":" 24","date_updated":"2024-07-31T12:14:55Z","file":[{"file_name":"2022_NewJournPhysics_Mistakidis.pdf","access_level":"open_access","relation":"main_file","date_updated":"2024-07-31T12:13:16Z","content_type":"application/pdf","checksum":"85776a9d3abe163b33b322c8e346752a","file_id":"17358","creator":"dernst","date_created":"2024-07-31T12:13:16Z","file_size":4201283,"success":1}],"arxiv":1,"abstract":[{"text":"We investigate the formation of magnetic Bose polaron, an impurity atom dressed by spin-wave excitations, in a one-dimensional spinor Bose gas. Within an effective potential model, the impurity is strongly confined by the host excitations which can even overcome the impurity-medium repulsion leading to a self-localized quasi-particle state. The phase diagram of the attractive and self-bound repulsive magnetic polaron, repulsive non-magnetic (Fröhlich-type) polaron and impurity-medium phase-separation regimes is explored with respect to the Rabi-coupling between the spin components, spin–spin interactions and impurity-medium coupling. The residue of such magnetic polarons decreases substantially in both strong attractive and repulsive branches with strong impurity-spin interactions, illustrating significant dressing of the impurity. The impurity can be used to probe and maneuver the spin polarization of the magnetic medium while suppressing ferromagnetic spin–spin correlations. It is shown that mean-field theory fails as the spinor gas approaches immiscibility since the generated spin-wave excitations are prominent. Our findings illustrate that impurities can be utilized to generate controllable spin–spin correlations and magnetic polaron states which can be realized with current cold atom setups.","lang":"eng"}],"article_number":"083030","volume":24,"publication_identifier":{"issn":["1367-2630"]},"date_created":"2024-05-29T06:11:35Z","department":[{"_id":"MiLe"}],"_id":"17070","title":"Inducing spin-order with an impurity: phase diagram of the magnetic Bose polaron","article_processing_charge":"Yes","oa":1,"fulldoi":"https://doi.org/10.1088/1367-2630/ac836c","oa_version":"Published Version","publication_status":"published"},{"date_created":"2024-05-29T06:12:02Z","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"_id":"17071","title":"AI-based structure prediction empowers integrative structural analysis of human nuclear pores","department":[{"_id":"MaJö"}],"article_processing_charge":"No","publication_status":"published","fulldoi":"https://doi.org/10.1126/science.abm9506","pmid":1,"oa_version":"None","language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"American Association for the Advancement of Science","intvolume":" 376","date_updated":"2024-07-31T12:10:32Z","article_number":"abm9506","volume":376,"abstract":[{"text":"The eukaryotic nucleus protects the genome and is enclosed by the two membranes of the nuclear envelope. Nuclear pore complexes (NPCs) perforate the nuclear envelope to facilitate nucleocytoplasmic transport. With a molecular weight of ∼120 MDa, the human NPC is one of the largest protein complexes. Its ~1000 proteins are taken in multiple copies from a set of about 30 distinct nucleoporins (NUPs). They can be roughly categorized into two classes. Scaffold NUPs contain folded domains and form a cylindrical scaffold architecture around a central channel. Intrinsically disordered NUPs line the scaffold and extend into the central channel, where they interact with cargo complexes. The NPC architecture is highly dynamic. It responds to changes in nuclear envelope tension with conformational breathing that manifests in dilation and constriction movements. Elucidating the scaffold architecture, ultimately at atomic resolution, will be important for gaining a more precise understanding of NPC function and dynamics but imposes a substantial challenge for structural biologists.\r\nConsiderable progress has been made toward this goal by a joint effort in the field. A synergistic combination of complementary approaches has turned out to be critical. In situ structural biology techniques were used to reveal the overall layout of the NPC scaffold that defines the spatial reference for molecular modeling. High-resolution structures of many NUPs were determined in vitro. Proteomic analysis and extensive biochemical work unraveled the interaction network of NUPs. Integrative modeling has been used to combine the different types of data, resulting in a rough outline of the NPC scaffold. Previous structural models of the human NPC, however, were patchy and limited in accuracy owing to several challenges: (i) Many of the high-resolution structures of individual NUPs have been solved from distantly related species and, consequently, do not comprehensively cover their human counterparts. (ii) The scaffold is interconnected by a set of intrinsically disordered linker NUPs that are not straightforwardly accessible to common structural biology techniques. (iii) The NPC scaffold intimately embraces the fused inner and outer nuclear membranes in a distinctive topology and cannot be studied in isolation. (iv) The conformational dynamics of scaffold NUPs limits the resolution achievable in structure determination.\r\nIn this study, we used artificial intelligence (AI)–based prediction to generate an extensive repertoire of structural models of human NUPs and their subcomplexes. The resulting models cover various domains and interfaces that so far remained structurally uncharacterized. Benchmarking against previous and unpublished x-ray and cryo–electron microscopy structures revealed unprecedented accuracy. We obtained well-resolved cryo–electron tomographic maps of both the constricted and dilated conformational states of the human NPC. Using integrative modeling, we fitted the structural models of individual NUPs into the cryo–electron microscopy maps. We explicitly included several linker NUPs and traced their trajectory through the NPC scaffold. We elucidated in great detail how membrane-associated and transmembrane NUPs are distributed across the fusion topology of both nuclear membranes. The resulting architectural model increases the structural coverage of the human NPC scaffold by about twofold. We extensively validated our model against both earlier and new experimental data. The completeness of our model has enabled microsecond-long coarse-grained molecular dynamics simulations of the NPC scaffold within an explicit membrane environment and solvent. These simulations reveal that the NPC scaffold prevents the constriction of the otherwise stable double-membrane fusion pore to small diameters in the absence of membrane tension\r\nOur 70-MDa atomically resolved model covers >90% of the human NPC scaffold. It captures conformational changes that occur during dilation and constriction. It also reveals the precise anchoring sites for intrinsically disordered NUPs, the identification of which is a prerequisite for a complete and dynamic model of the NPC. Our study exemplifies how AI-based structure prediction may accelerate the elucidation of subcellular architecture at atomic resolution.","lang":"eng"}],"issue":"6598","author":[{"last_name":"Mosalaganti","first_name":"Shyamal","full_name":"Mosalaganti, Shyamal"},{"first_name":"Agnieszka","full_name":"Obarska-Kosinska, Agnieszka","last_name":"Obarska-Kosinska"},{"last_name":"Siggel","first_name":"Marc","full_name":"Siggel, Marc"},{"last_name":"Taniguchi","full_name":"Taniguchi, Reiya","first_name":"Reiya"},{"full_name":"Turoňová, Beata","first_name":"Beata","last_name":"Turoňová"},{"full_name":"Zimmerli, Christian E.","first_name":"Christian E.","last_name":"Zimmerli"},{"first_name":"Katarzyna","full_name":"Buczak, Katarzyna","last_name":"Buczak"},{"last_name":"Schmidt","first_name":"Florian","full_name":"Schmidt, Florian","id":"A2EF226A-AF19-11E9-924C-0525E6697425"},{"full_name":"Margiotta, Erica","first_name":"Erica","last_name":"Margiotta"},{"last_name":"Mackmull","first_name":"Marie-Therese","full_name":"Mackmull, Marie-Therese"},{"full_name":"Hagen, Wim J. H.","first_name":"Wim J. H.","last_name":"Hagen"},{"full_name":"Hummer, Gerhard","first_name":"Gerhard","last_name":"Hummer"},{"first_name":"Jan","full_name":"Kosinski, Jan","last_name":"Kosinski"},{"last_name":"Beck","full_name":"Beck, Martin","first_name":"Martin"}],"month":"06","status":"public","quality_controlled":"1","publication":"Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1126/science.abm9506","article_type":"original","day":"10","acknowledgement":"We acknowledge support from the Electron Microscopy Core Facility (EMCF) and IT services of European Molecular Biology Laboratory (EMBL) Heidelberg. We thank S. Welsch at the Central Electron Microscopy Facility of the Max Planck Institute of Biophysics for technical expertise. We thank T. Hoffman and R. Alves for help with the AlphaFold installation.\r\nFunding: M.B. acknowledges funding by EMBL, the Max Planck Society, and the European Research Council (ComplexAssembly 724349). J.K. acknowledges funding from the Federal Ministry of Education and Research of Germany (FKZ 031L0100). The work by M.S. and G.H. on computer simulations was supported by the Max Planck Society. M.S. was supported by the EMBL Interdisciplinary Postdoc Programme under Marie Curie COFUND actions. M.S. and G.H. were supported by the Landes-Offensive zur Entwicklung Wissenschaftlich-ökonomischer Exzellenz (LOEWE) DynaMem program of the State of Hessen.","date_published":"2022-06-10T00:00:00Z","external_id":{"pmid":["35679397"]},"scopus_import":"1","citation":{"chicago":"Mosalaganti, Shyamal, Agnieszka Obarska-Kosinska, Marc Siggel, Reiya Taniguchi, Beata Turoňová, Christian E. Zimmerli, Katarzyna Buczak, et al. “AI-Based Structure Prediction Empowers Integrative Structural Analysis of Human Nuclear Pores.” Science. American Association for the Advancement of Science, 2022. https://doi.org/10.1126/science.abm9506.","mla":"Mosalaganti, Shyamal, et al. “AI-Based Structure Prediction Empowers Integrative Structural Analysis of Human Nuclear Pores.” Science, vol. 376, no. 6598, abm9506, American Association for the Advancement of Science, 2022, doi:10.1126/science.abm9506.","apa":"Mosalaganti, S., Obarska-Kosinska, A., Siggel, M., Taniguchi, R., Turoňová, B., Zimmerli, C. E., … Beck, M. (2022). AI-based structure prediction empowers integrative structural analysis of human nuclear pores. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.abm9506","ista":"Mosalaganti S, Obarska-Kosinska A, Siggel M, Taniguchi R, Turoňová B, Zimmerli CE, Buczak K, Schmidt F, Margiotta E, Mackmull M-T, Hagen WJH, Hummer G, Kosinski J, Beck M. 2022. AI-based structure prediction empowers integrative structural analysis of human nuclear pores. Science. 376(6598), abm9506.","short":"S. Mosalaganti, A. Obarska-Kosinska, M. Siggel, R. Taniguchi, B. Turoňová, C.E. Zimmerli, K. Buczak, F. Schmidt, E. Margiotta, M.-T. Mackmull, W.J.H. Hagen, G. Hummer, J. Kosinski, M. Beck, Science 376 (2022).","ieee":"S. Mosalaganti et al., “AI-based structure prediction empowers integrative structural analysis of human nuclear pores,” Science, vol. 376, no. 6598. American Association for the Advancement of Science, 2022.","ama":"Mosalaganti S, Obarska-Kosinska A, Siggel M, et al. AI-based structure prediction empowers integrative structural analysis of human nuclear pores. Science. 2022;376(6598). doi:10.1126/science.abm9506"}},{"volume":8,"article_number":"eabl6293","abstract":[{"text":"The collapse of polypeptides is thought important to protein folding, aggregation, intrinsic disorder, and phase separation. However, whether polypeptide collapse is modulated in cells to control protein states is unclear. Here, using integrated protein manipulation and imaging, we show that the chaperonin GroEL-ES can accelerate the folding of proteins by strengthening their collapse. GroEL induces contractile forces in substrate chains, which draws them into the cavity and triggers a general compaction and discrete folding transitions, even for slow-folding proteins. This collapse enhancement is strongest in the nucleotide-bound states of GroEL and is aided by GroES binding to the cavity rim and by the amphiphilic C-terminal tails at the cavity bottom. Collapse modulation is distinct from other proposed GroEL-ES folding acceleration mechanisms, including steric confinement and misfold unfolding. Given the prevalence of collapse throughout the proteome, we conjecture that collapse modulation is more generally relevant within the protein quality control machinery.","lang":"eng"}],"file":[{"file_size":2404150,"date_created":"2024-07-31T12:01:51Z","success":1,"file_name":"2022_ScienceAdv_Naqvi.pdf","access_level":"open_access","relation":"main_file","date_updated":"2024-07-31T12:01:51Z","creator":"dernst","content_type":"application/pdf","checksum":"9511579306cce7e04107d3d6389ed614","file_id":"17357"}],"date_updated":"2024-08-05T08:30:29Z","intvolume":" 8","year":"2022","language":[{"iso":"eng"}],"publisher":"American Association for the Advancement of Science","type":"journal_article","publication_status":"published","oa_version":"Published Version","fulldoi":"https://doi.org/10.1126/sciadv.abl6293","pmid":1,"oa":1,"article_processing_charge":"Yes","title":"Protein chain collapse modulation and folding stimulation by GroEL-ES","_id":"17072","department":[{"_id":"MiSi"}],"date_created":"2024-05-29T06:12:19Z","publication_identifier":{"issn":["2375-2548"]},"citation":{"mla":"Naqvi, Mohsin M., et al. “Protein Chain Collapse Modulation and Folding Stimulation by GroEL-ES.” Science Advances, vol. 8, no. 9, eabl6293, American Association for the Advancement of Science, 2022, doi:10.1126/sciadv.abl6293.","ista":"Naqvi MM, Avellaneda Sarrió M, Roth A, Koers EJ, Roland A, Sunderlikova V, Kramer G, Rye HS, Tans SJ. 2022. Protein chain collapse modulation and folding stimulation by GroEL-ES. Science Advances. 8(9), eabl6293.","short":"M.M. Naqvi, M. Avellaneda Sarrió, A. Roth, E.J. Koers, A. Roland, V. Sunderlikova, G. Kramer, H.S. Rye, S.J. Tans, Science Advances 8 (2022).","apa":"Naqvi, M. M., Avellaneda Sarrió, M., Roth, A., Koers, E. J., Roland, A., Sunderlikova, V., … Tans, S. J. (2022). Protein chain collapse modulation and folding stimulation by GroEL-ES. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.abl6293","chicago":"Naqvi, Mohsin M., Mario Avellaneda Sarrió, Andrew Roth, Eline J. Koers, Antoine Roland, Vanda Sunderlikova, Günter Kramer, Hays S. Rye, and Sander J. Tans. “Protein Chain Collapse Modulation and Folding Stimulation by GroEL-ES.” Science Advances. American Association for the Advancement of Science, 2022. https://doi.org/10.1126/sciadv.abl6293.","ama":"Naqvi MM, Avellaneda Sarrió M, Roth A, et al. Protein chain collapse modulation and folding stimulation by GroEL-ES. Science Advances. 2022;8(9). doi:10.1126/sciadv.abl6293","ieee":"M. M. Naqvi et al., “Protein chain collapse modulation and folding stimulation by GroEL-ES,” Science Advances, vol. 8, no. 9. American Association for the Advancement of Science, 2022."},"scopus_import":"1","external_id":{"pmid":["35245117"]},"has_accepted_license":"1","acknowledgement":"We thank A. L. Horwich, K. Chakraborty, and B. Schuler for providing plasmids, and R. van Leeuwen, M. Mayer, J. van Zon, W. Noorduin, and P. R. ten Wolde for comments and critical reading of the manuscript. Work in the group of S.J.T. was supported by the Netherlands Organization for Scientific Research (NWO). Work in the group of H.S.R. was supported by a grant from the NIH (R01GM114405).","file_date_updated":"2024-07-31T12:01:51Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-03-01T00:00:00Z","day":"01","article_type":"original","doi":"10.1126/sciadv.abl6293","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication":"Science Advances","issue":"9","month":"03","status":"public","ddc":["570"],"author":[{"last_name":"Naqvi","first_name":"Mohsin M.","full_name":"Naqvi, Mohsin M."},{"id":"DC4BA84C-56E6-11EA-AD5D-348C3DDC885E","full_name":"Avellaneda Sarrió, Mario","orcid":"0000-0001-6406-524X","first_name":"Mario","last_name":"Avellaneda Sarrió"},{"last_name":"Roth","full_name":"Roth, Andrew","first_name":"Andrew"},{"last_name":"Koers","first_name":"Eline J.","full_name":"Koers, Eline J."},{"first_name":"Antoine","full_name":"Roland, Antoine","last_name":"Roland"},{"last_name":"Sunderlikova","full_name":"Sunderlikova, Vanda","first_name":"Vanda"},{"full_name":"Kramer, Günter","first_name":"Günter","last_name":"Kramer"},{"full_name":"Rye, Hays S.","first_name":"Hays S.","last_name":"Rye"},{"last_name":"Tans","full_name":"Tans, Sander J.","first_name":"Sander J."}]},{"fulldoi":"https://doi.org/10.1007/978-3-030-67727-5_18","oa_version":"None","publication_status":"published","article_processing_charge":"No","editor":[{"full_name":"Blau, Nenad","first_name":"Nenad","last_name":"Blau"},{"first_name":"Carlo Dionisi","full_name":"Vici, Carlo Dionisi","last_name":"Vici"},{"last_name":"Ferreira","first_name":"Carlos R. ","full_name":"Ferreira, Carlos R. "},{"first_name":"Christine","full_name":"Vianey-Saban, Christine","last_name":"Vianey-Saban"},{"last_name":"van Karnebeek","first_name":"Clara D.M.","full_name":"van Karnebeek, Clara D.M."}],"department":[{"_id":"GaNo"}],"_id":"17075","title":"Amino Acid Transport Defects","publication_identifier":{"isbn":["9783030677268"],"eisbn":["9783030677275"]},"date_created":"2024-05-29T06:13:04Z","abstract":[{"lang":"eng","text":"Disorders associated with the malfunction of amino acid transporters mainly affect the function of the intestine, kidney, brain, and liver. Mutations of brain amino acid transporters, for example, alter neuronal excitability (e.g., episodic ataxia due to SLC1A3 (EAAT1) defect and hyperekplexia due to SLC6A5 (GLYT2) deficiency) or brain development (SLC1A1 (EAAT3), SLC3A2/SLC7A5 (CD98hc/LAT1), and SLC1A4 (ASCT1) deficiencies). Mutations of renal and intestinal amino acid transporters SLC3A1/SLC7A9 (rBAT/b0,+AT) and SLC1A1 (EAAT3) cause renal problems (cystinuria and dicarboxylic aminoaciduria, respectively) and malabsorption that can affect whole-body homoeostasis (Hartnup disorder SLC6A19 (B0AT1), lysinuric protein intolerance SLC3A2/SLC7A7 (CD98hc/y+LAT1), and hyperdibasic aminoaciduria type 1). Mutations in the neuronal system A amino acid transporter SLC38A8 (SNAT8) cause eye developmental and visual defects. Inborn errors associated with mitochondrial SLC25 family members such as SLC25A12 (neuronal- and muscle-specific mitochondrial aspartate/glutamate transporter 1; AGC1) (global cerebral hypomyelination), SLC25A13 (aspartate/glutamate transporter 2) (citrin deficiency), SLC25A15 (ornithine-citrulline carrier 2) (homocitrullinuria, hyperornithinemia, and hyperammonemia syndrome), and SLC25A22 (mitochondrial glutamate/H+ symporter 1, GC1) (neonatal myoclonic epilepsy) will be dealt within Chap. 43 (defects of mitochondrial carriers)."}],"page":"291-312","edition":"2","date_updated":"2024-07-31T11:45:50Z","type":"book_chapter","publisher":"Springer Nature","language":[{"iso":"eng"}],"year":"2022","day":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-030-67727-5_18","publication":"Physician's Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases","quality_controlled":"1","author":[{"last_name":"Palacín","full_name":"Palacín, Manuel","first_name":"Manuel"},{"last_name":"Bröer","first_name":"Stefan","full_name":"Bröer, Stefan"},{"last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","first_name":"Gaia"}],"status":"public","month":"02","citation":{"chicago":"Palacín, Manuel, Stefan Bröer, and Gaia Novarino. “Amino Acid Transport Defects.” In Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases, edited by Nenad Blau, Carlo Dionisi Vici, Carlos R. Ferreira, Christine Vianey-Saban, and Clara D.M. van Karnebeek, 2nd ed., 291–312. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-67727-5_18.","mla":"Palacín, Manuel, et al. “Amino Acid Transport Defects.” Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases, edited by Nenad Blau et al., 2nd ed., Springer Nature, 2022, pp. 291–312, doi:10.1007/978-3-030-67727-5_18.","short":"M. Palacín, S. Bröer, G. Novarino, in:, N. Blau, C.D. Vici, C.R. Ferreira, C. Vianey-Saban, C.D.M. van Karnebeek (Eds.), Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases, 2nd ed., Springer Nature, Cham, 2022, pp. 291–312.","ista":"Palacín M, Bröer S, Novarino G. 2022.Amino Acid Transport Defects. In: Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases. , 291–312.","apa":"Palacín, M., Bröer, S., & Novarino, G. (2022). Amino Acid Transport Defects. In N. Blau, C. D. Vici, C. R. Ferreira, C. Vianey-Saban, & C. D. M. van Karnebeek (Eds.), Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases (2nd ed., pp. 291–312). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-67727-5_18","ama":"Palacín M, Bröer S, Novarino G. Amino Acid Transport Defects. In: Blau N, Vici CD, Ferreira CR, Vianey-Saban C, van Karnebeek CDM, eds. Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases. 2nd ed. Cham: Springer Nature; 2022:291-312. doi:10.1007/978-3-030-67727-5_18","ieee":"M. Palacín, S. Bröer, and G. Novarino, “Amino Acid Transport Defects,” in Physician’s Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases, 2nd ed., N. Blau, C. D. Vici, C. R. Ferreira, C. Vianey-Saban, and C. D. M. van Karnebeek, Eds. Cham: Springer Nature, 2022, pp. 291–312."},"scopus_import":"1","date_published":"2022-02-22T00:00:00Z","place":"Cham","acknowledgement":"The authors thank Dr. Christian Lueck (Canberra Hospital) for clarification of differential diagnosis in cases of episodic ataxia. The authors thank Dr. Rafael Artuch (Hospital San Joan de Deu, Barcelona) for reference values of plasma amino acid concentration. The authors also thank Lisa Kraus (Institute of Science and Technology-Austria) and Dr. Susanna Bodoy (IRB-Barcelona) that helped in preparing tables and bibliography."},{"oa":1,"article_processing_charge":"No","publication_status":"published","fulldoi":"https://doi.org/10.1090/cams/13","oa_version":"Published Version","date_created":"2024-05-29T06:13:37Z","publication_identifier":{"issn":["2692-3688"]},"_id":"17077","title":"Friendly bisections of random graphs","department":[{"_id":"MaKw"}],"file":[{"date_created":"2024-07-12T12:55:02Z","file_size":335965,"success":1,"relation":"main_file","date_updated":"2024-07-12T12:55:02Z","file_name":"2022_CommAMS_Ferber.pdf","access_level":"open_access","file_id":"17230","checksum":"719861e76f5bce3d0362d8171daa26fc","content_type":"application/pdf","creator":"cchlebak"}],"intvolume":" 2","date_updated":"2024-07-15T08:06:05Z","page":"380-416","volume":2,"arxiv":1,"abstract":[{"text":"Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph 𝔾(𝑛, 1/2) admits a friendly bisection of its vertex set, i.e., a\r\npartition of its vertex set into two parts whose sizes differ by at most one in which\r\n𝑛 − 𝑜(𝑛) vertices have more neighbours in their own part as across. Our proof is constructive, and in the process, we develop a new method to study stochastic processes\r\ndriven by degree information in random graphs; this involves combining enumeration\r\ntechniques with an abstract second moment argument.","lang":"eng"}],"language":[{"iso":"eng"}],"year":"2022","type":"journal_article","publisher":"American Mathematical Society","doi":"10.1090/cams/13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","license":"https://creativecommons.org/licenses/by/3.0/","day":"20","issue":"10","author":[{"full_name":"Ferber, Asaf","first_name":"Asaf","last_name":"Ferber"},{"last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"last_name":"Narayanan","full_name":"Narayanan, Bhargav","first_name":"Bhargav"},{"last_name":"Sah","full_name":"Sah, Ashwin","first_name":"Ashwin"},{"full_name":"Sawhney, Mehtaab","first_name":"Mehtaab","last_name":"Sawhney"}],"month":"12","ddc":["500"],"status":"public","quality_controlled":"1","publication":"Communications of the American Mathematical Society","citation":{"chicago":"Ferber, Asaf, Matthew Alan Kwan, Bhargav Narayanan, Ashwin Sah, and Mehtaab Sawhney. “Friendly Bisections of Random Graphs.” Communications of the American Mathematical Society. American Mathematical Society, 2022. https://doi.org/10.1090/cams/13.","short":"A. Ferber, M.A. Kwan, B. Narayanan, A. Sah, M. Sawhney, Communications of the American Mathematical Society 2 (2022) 380–416.","ista":"Ferber A, Kwan MA, Narayanan B, Sah A, Sawhney M. 2022. Friendly bisections of random graphs. Communications of the American Mathematical Society. 2(10), 380–416.","apa":"Ferber, A., Kwan, M. A., Narayanan, B., Sah, A., & Sawhney, M. (2022). Friendly bisections of random graphs. Communications of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/cams/13","mla":"Ferber, Asaf, et al. “Friendly Bisections of Random Graphs.” Communications of the American Mathematical Society, vol. 2, no. 10, American Mathematical Society, 2022, pp. 380–416, doi:10.1090/cams/13.","ieee":"A. Ferber, M. A. Kwan, B. Narayanan, A. Sah, and M. Sawhney, “Friendly bisections of random graphs,” Communications of the American Mathematical Society, vol. 2, no. 10. American Mathematical Society, pp. 380–416, 2022.","ama":"Ferber A, Kwan MA, Narayanan B, Sah A, Sawhney M. Friendly bisections of random graphs. Communications of the American Mathematical Society. 2022;2(10):380-416. doi:10.1090/cams/13"},"file_date_updated":"2024-07-12T12:55:02Z","has_accepted_license":"1","acknowledgement":"We thank the referees for extensive comments which helped improve the paper substantially.\r\nThe first author was supported in part by NSF grants DMS-1954395 and DMS-1953799. The second author was supported by NSF grant DMS-1953990. The third author was supported by NSF grant DMS180052. The fourth and fifth authors were both supported by NSF Graduate Research Fellowship Program DGE-1745302.","date_published":"2022-12-20T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"external_id":{"arxiv":["2105.13337"]},"corr_author":"1"},{"author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"first_name":"Erik D.","full_name":"Demaine, Erik D.","last_name":"Demaine"},{"last_name":"Korman","full_name":"Korman, Matias","first_name":"Matias"},{"first_name":"Anna","full_name":"Lubiw, Anna","last_name":"Lubiw"},{"full_name":"Lynch, Jayson","first_name":"Jayson","last_name":"Lynch"},{"last_name":"Masárová","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322"},{"last_name":"Rudoy","first_name":"Mikhail","full_name":"Rudoy, Mikhail"},{"last_name":"Vassilevska Williams","first_name":"Virginia","full_name":"Vassilevska Williams, Virginia"},{"full_name":"Wein, Nicole","first_name":"Nicole","last_name":"Wein"}],"month":"09","status":"public","ddc":["510"],"quality_controlled":"1","publication":"30th Annual European Symposium on Algorithms","doi":"10.4230/LIPIcs.ESA.2022.3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"day":"01","acknowledgement":"g Anna Lubiw: Supported by the Natural Sciences and Engineering Research Council of\r\nCanada (NSERC). Jayson Lynch: Supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). Zuzana Masárová: Supported by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Virginia Vassilevska Williams: Supported by an NSF CAREER Award, NSF Grants CCF-1528078, CCF-1514339 and CCF-1909429, a BSF Grant BSF:2012338, a Google Research Fellowship and a Sloan Research Fellowship.\r\nNicole Wein: Supported by a grant to DIMACS from the Simons Foundation (820931). This work was done while the author was at MIT.\r\nThis research was initiated at the 34th Bellairs Winter Workshop on Computational Geometry, co-organized by Erik Demaine and Godfried Toussaint, held on March 22–29,\r\n2019 in Holetown, Barbados. We thank the other participants of that workshop for providing a\r\nstimulating research environment.","has_accepted_license":"1","file_date_updated":"2024-08-12T08:51:44Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-09-01T00:00:00Z","external_id":{"arxiv":["2103.06707"]},"corr_author":"1","scopus_import":"1","citation":{"chicago":"Aichholzer, Oswin, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. “Hardness of Token Swapping on Trees.” In 30th Annual European Symposium on Algorithms, Vol. 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.ESA.2022.3.","apa":"Aichholzer, O., Demaine, E. D., Korman, M., Lubiw, A., Lynch, J., Masárová, Z., … Wein, N. (2022). Hardness of token swapping on trees. In 30th Annual European Symposium on Algorithms (Vol. 244). Berlin/Potsdam, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.3","ista":"Aichholzer O, Demaine ED, Korman M, Lubiw A, Lynch J, Masárová Z, Rudoy M, Vassilevska Williams V, Wein N. 2022. Hardness of token swapping on trees. 30th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 244, 3.","short":"O. Aichholzer, E.D. Demaine, M. Korman, A. Lubiw, J. Lynch, Z. Masárová, M. Rudoy, V. Vassilevska Williams, N. Wein, in:, 30th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Aichholzer, Oswin, et al. “Hardness of Token Swapping on Trees.” 30th Annual European Symposium on Algorithms, vol. 244, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.ESA.2022.3.","ama":"Aichholzer O, Demaine ED, Korman M, et al. Hardness of token swapping on trees. In: 30th Annual European Symposium on Algorithms. Vol 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.ESA.2022.3","ieee":"O. Aichholzer et al., “Hardness of token swapping on trees,” in 30th Annual European Symposium on Algorithms, Berlin/Potsdam, Germany, 2022, vol. 244."},"date_created":"2024-05-29T06:27:16Z","_id":"17084","title":"Hardness of token swapping on trees","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"oa":1,"article_processing_charge":"Yes","publication_status":"published","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2022.3","oa_version":"Published Version","language":[{"iso":"eng"}],"project":[{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"}],"year":"2022","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"date_created":"2024-08-12T08:51:44Z","file_size":1406071,"success":1,"relation":"main_file","date_updated":"2024-08-12T08:51:44Z","access_level":"open_access","file_name":"2022_LIPIcS_Aichholzer.pdf","file_id":"17420","checksum":"a1fbd3e7baad510fbcb998cf4a7d9f7f","content_type":"application/pdf","creator":"dernst"}],"conference":{"end_date":"2022-09-09","start_date":"2022-09-05","location":"Berlin/Potsdam, Germany","name":"ESA: European Symposium on Algorithms"},"date_updated":"2025-04-15T07:16:56Z","intvolume":" 244","article_number":"3","volume":244,"arxiv":1,"abstract":[{"text":"Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which exchanges the tokens at the two endpoints of an edge of the graph. In parallel token swapping, the goal is to use the fewest rounds, each of which consists of one or more swaps on the edges of a matching. We prove that both of these problems remain NP-hard when the graph is restricted to be a tree. These token swapping problems have been studied by disparate groups of researchers in discrete mathematics, theoretical computer science, robot motion planning, game theory, and engineering. Previous work establishes NP-completeness on general graphs (for both problems), constant-factor approximation algorithms, and some poly-time exact algorithms for simple graph classes such as cliques, stars, paths, and cycles. Sequential and parallel token swapping on trees were first studied over thirty years ago (as \"sorting with a transposition tree\") and over twenty-five years ago (as \"routing permutations via matchings\"), yet their complexities were previously unknown. We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and show that no such algorithm can achieve an approximation factor less than 2.","lang":"eng"}]}]