[{"quality_controlled":"1","publisher":"American Chemical Society","oa":1,"acknowledgement":"The National Key Research and Development Program of China (2018YFA0702100), the Basic Science Center Project of the National Natural Science Foundation of China (51788104), the National Natural Science Foundation of China (51571007 and 51772012), the Beijing Natural Science Foundation (JQ18004), the 111 Project (B17002), the National Science Fund for Distinguished Young Scholars (51925101), and the FWF “Lise Meitner Fellowship” (grant agreement M2889-N). Open Access is funded by the Austrian Science Fund (FWF).","date_published":"2023-01-24T00:00:00Z","doi":"10.1021/acs.chemmater.2c03542","date_created":"2023-01-22T23:00:55Z","page":"755-763","day":"24","publication":"Chemistry of Materials","isi":1,"has_accepted_license":"1","year":"2023","project":[{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889"}],"title":"Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe","author":[{"full_name":"Wang, Siqi","last_name":"Wang","first_name":"Siqi"},{"last_name":"Chang","full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","first_name":"Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"full_name":"Bai, Shulin","last_name":"Bai","first_name":"Shulin"},{"first_name":"Bingchao","last_name":"Qin","full_name":"Qin, Bingchao"},{"first_name":"Yingcai","full_name":"Zhu, Yingcai","last_name":"Zhu"},{"first_name":"Shaoping","last_name":"Zhan","full_name":"Zhan, Shaoping"},{"full_name":"Zheng, Junqing","last_name":"Zheng","first_name":"Junqing"},{"full_name":"Tang, Shuwei","last_name":"Tang","first_name":"Shuwei"},{"first_name":"Li Dong","last_name":"Zhao","full_name":"Zhao, Li Dong"}],"article_processing_charge":"No","external_id":{"isi":["000914749700001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Wang, Siqi, Cheng Chang, Shulin Bai, Bingchao Qin, Yingcai Zhu, Shaoping Zhan, Junqing Zheng, Shuwei Tang, and Li Dong Zhao. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials. American Chemical Society, 2023. https://doi.org/10.1021/acs.chemmater.2c03542.","ista":"Wang S, Chang C, Bai S, Qin B, Zhu Y, Zhan S, Zheng J, Tang S, Zhao LD. 2023. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 35(2), 755–763.","mla":"Wang, Siqi, et al. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials, vol. 35, no. 2, American Chemical Society, 2023, pp. 755–63, doi:10.1021/acs.chemmater.2c03542.","short":"S. Wang, C. Chang, S. Bai, B. Qin, Y. Zhu, S. Zhan, J. Zheng, S. Tang, L.D. Zhao, Chemistry of Materials 35 (2023) 755–763.","ieee":"S. Wang et al., “Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe,” Chemistry of Materials, vol. 35, no. 2. American Chemical Society, pp. 755–763, 2023.","ama":"Wang S, Chang C, Bai S, et al. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 2023;35(2):755-763. doi:10.1021/acs.chemmater.2c03542","apa":"Wang, S., Chang, C., Bai, S., Qin, B., Zhu, Y., Zhan, S., … Zhao, L. D. (2023). Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/acs.chemmater.2c03542"},"month":"01","intvolume":" 35","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance.","lang":"eng"}],"volume":35,"issue":"2","file":[{"creator":"dernst","date_updated":"2023-08-14T12:57:25Z","file_size":2961043,"date_created":"2023-08-14T12:57:25Z","file_name":"2023_ChemistryMaterials_Wang.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14055","checksum":"b21dca2aa7a80c068bc256bdd1fea9df","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1520-5002"],"issn":["0897-4756"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"12331","file_date_updated":"2023-08-14T12:57:25Z","department":[{"_id":"MaIb"}],"ddc":["540"],"date_updated":"2023-08-14T12:57:44Z"},{"quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This work was started during the 6th Austrian–Japanese–Mexican–Spanish Workshop on Discrete Geometry in June 2019 in Austria. We thank all the participants for the good atmosphere as well as discussions on the topic. Also, we thank Jan Kynčl for sending us remarks on a preliminary version of this work and an anonymous referee for further helpful comments.Alan Arroyo was funded by the Marie Skłodowska-Curie grant agreement No 754411. Fabian Klute was partially supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 612.001.651 and by the Austrian Science Fund (FWF): J-4510. Irene Parada and Birgit Vogtenhuber were partially supported by the Austrian Science Fund (FWF): W1230 and within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. Irene Parada was also partially supported by the Independent Research Fund Denmark grant 2020-2023 (9131-00044B) Dynamic Network Analysis and by the Margarita Salas Fellowship funded by the Ministry of Universities of Spain and the European Union (NextGenerationEU). Tilo Wiedera was supported by the German Research Foundation (DFG) grant CH 897/2-2.","page":"745–770","date_published":"2023-04-01T00:00:00Z","doi":"10.1007/s00454-022-00394-9","date_created":"2022-08-28T22:02:01Z","isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Discrete and Computational Geometry","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"orcid":"0000-0003-2401-8670","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fabian","full_name":"Klute, Fabian","last_name":"Klute"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"},{"last_name":"Wiedera","full_name":"Wiedera, Tilo","first_name":"Tilo"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"isi":["000840292800001"],"arxiv":["1909.07347"]},"title":"Inserting one edge into a simple drawing is hard","citation":{"mla":"Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” Discrete and Computational Geometry, vol. 69, Springer Nature, 2023, pp. 745–770, doi:10.1007/s00454-022-00394-9.","ieee":"A. M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, and T. Wiedera, “Inserting one edge into a simple drawing is hard,” Discrete and Computational Geometry, vol. 69. Springer Nature, pp. 745–770, 2023.","short":"A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry 69 (2023) 745–770.","apa":"Arroyo Guevara, A. M., Klute, F., Parada, I., Vogtenhuber, B., Seidel, R., & Wiedera, T. (2023). Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00394-9","ama":"Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 2023;69:745–770. doi:10.1007/s00454-022-00394-9","chicago":"Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.” Discrete and Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00394-9.","ista":"Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. 2023. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 69, 745–770."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","month":"04","intvolume":" 69","abstract":[{"text":"A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of G+e extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is NP-complete to decide whether one edge can be inserted into a simple drawing. This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles A and a pseudosegment σ, it can be decided in polynomial time whether there exists a pseudocircle Φσ extending σ for which A∪{Φσ} is again an arrangement of pseudocircles.","lang":"eng"}],"oa_version":"Published Version","volume":69,"ec_funded":1,"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"publication_status":"published","file":[{"file_size":1002218,"date_updated":"2022-08-29T11:23:15Z","creator":"alisjak","file_name":"2022_DiscreteandComputionalGeometry_Arroyo.pdf","date_created":"2022-08-29T11:23:15Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"def7ae3b28d9fd6aec16450e40090302","file_id":"12006"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"11999","file_date_updated":"2022-08-29T11:23:15Z","department":[{"_id":"UlWa"}],"date_updated":"2023-08-14T12:51:25Z","ddc":["510"]},{"abstract":[{"text":"The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2008.01009","open_access":"1"}],"scopus_import":"1","intvolume":" 36","month":"09","publication_status":"published","publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"language":[{"iso":"eng"}],"volume":36,"_id":"12330","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-08-14T12:54:32Z","department":[{"_id":"DaAl"}],"oa":1,"publisher":"Springer Nature","quality_controlled":"1","year":"2023","isi":1,"publication":"Distributed Computing","day":"01","page":"395-418","date_created":"2023-01-22T23:00:55Z","doi":"10.1007/s00446-022-00441-x","date_published":"2023-09-01T00:00:00Z","citation":{"chicago":"Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.","mla":"Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 395–418, doi:10.1007/s00446-022-00441-x.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00441-x","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” Distributed Computing, vol. 36. Springer Nature, pp. 395–418, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2008.01009"],"isi":["000913424000001"]},"article_processing_charge":"No","author":[{"last_name":"Aksenov","full_name":"Aksenov, Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87","first_name":"Vitalii"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Alexandra","last_name":"Drozdova","full_name":"Drozdova, Alexandra"},{"full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami","first_name":"Amirkeivan"}],"title":"The splay-list: A distribution-adaptive concurrent skip-list"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"status":"public","_id":"12159","file_date_updated":"2023-08-16T08:15:41Z","department":[{"_id":"NiBa"}],"date_updated":"2023-08-16T08:18:47Z","ddc":["570"],"scopus_import":"1","intvolume":" 32","month":"03","abstract":[{"text":"The term “haplotype block” is commonly used in the developing field of haplotype-based inference methods. We argue that the term should be defined based on the structure of the Ancestral Recombination Graph (ARG), which contains complete information on the ancestry of a sample. We use simulated examples to demonstrate key features of the relationship between haplotype blocks and ancestral structure, emphasizing the stochasticity of the processes that generate them. Even the simplest cases of neutrality or of a “hard” selective sweep produce a rich structure, often missed by commonly used statistics. We highlight a number of novel methods for inferring haplotype structure, based on the full ARG, or on a sequence of trees, and illustrate how they can be used to define haplotype blocks using an empirical data set. While the advent of new, computationally efficient methods makes it possible to apply these concepts broadly, they (and additional new methods) could benefit from adding features to explore haplotype blocks, as we define them. Understanding and applying the concept of the haplotype block will be essential to fully exploit long and linked-read sequencing technologies.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"volume":32,"issue":"6","publication_status":"published","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2023_MolecularEcology_Shipilina.pdf","date_created":"2023-08-16T08:15:41Z","creator":"dernst","file_size":7144607,"date_updated":"2023-08-16T08:15:41Z","success":1,"checksum":"b10e0f8fa3dc4d72aaf77a557200978a","file_id":"14062","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"project":[{"name":"The maintenance of alternative adaptive peaks in snapdragons","grant_number":"P32166","_id":"05959E1C-7A3F-11EA-A408-12923DDC885E"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Understanding the evolution of continuous genomes","grant_number":"101055327","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"}],"external_id":{"isi":["000900762000001"],"pmid":["36433653"]},"article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Daria","id":"428A94B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1145-9226","full_name":"Shipilina, Daria","last_name":"Shipilina"},{"first_name":"Arka","id":"6AAB2240-CA9A-11E9-9C1A-D9D1E5697425","last_name":"Pal","full_name":"Pal, Arka","orcid":"0000-0002-4530-8469"},{"id":"43161670-5719-11EA-8025-FABC3DDC885E","first_name":"Sean","last_name":"Stankowski","full_name":"Stankowski, Sean"},{"full_name":"Chan, Yingguang Frank","last_name":"Chan","first_name":"Yingguang Frank"},{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"title":"On the origin and structure of haplotype blocks","citation":{"chicago":"Shipilina, Daria, Arka Pal, Sean Stankowski, Yingguang Frank Chan, and Nicholas H Barton. “On the Origin and Structure of Haplotype Blocks.” Molecular Ecology. Wiley, 2023. https://doi.org/10.1111/mec.16793.","ista":"Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. 2023. On the origin and structure of haplotype blocks. Molecular Ecology. 32(6), 1441–1457.","mla":"Shipilina, Daria, et al. “On the Origin and Structure of Haplotype Blocks.” Molecular Ecology, vol. 32, no. 6, Wiley, 2023, pp. 1441–57, doi:10.1111/mec.16793.","ieee":"D. Shipilina, A. Pal, S. Stankowski, Y. F. Chan, and N. H. Barton, “On the origin and structure of haplotype blocks,” Molecular Ecology, vol. 32, no. 6. Wiley, pp. 1441–1457, 2023.","short":"D. Shipilina, A. Pal, S. Stankowski, Y.F. Chan, N.H. Barton, Molecular Ecology 32 (2023) 1441–1457.","ama":"Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. On the origin and structure of haplotype blocks. Molecular Ecology. 2023;32(6):1441-1457. doi:10.1111/mec.16793","apa":"Shipilina, D., Pal, A., Stankowski, S., Chan, Y. F., & Barton, N. H. (2023). On the origin and structure of haplotype blocks. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.16793"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Wiley","quality_controlled":"1","acknowledgement":"We thank the Barton group for useful discussion and feedback during the writing of this article. Comments from Roger Butlin, Molly Schumer's Group, the tskit development team, editors and three reviewers greatly improved the manuscript. Funding was provided by SCAS (Natural Sciences Programme, Knut and Alice Wallenberg Foundation), an FWF Wittgenstein grant (PT1001Z211), an FWF standalone grant (grant P 32166), and an ERC Advanced Grant. YFC was supported by the Max Planck Society and an ERC Proof of Concept Grant #101069216 (HAPLOTAGGING).","page":"1441-1457","date_created":"2023-01-12T12:09:17Z","doi":"10.1111/mec.16793","date_published":"2023-03-01T00:00:00Z","year":"2023","has_accepted_license":"1","isi":1,"publication":"Molecular Ecology","day":"01"},{"_id":"12114","status":"public","keyword":["Structural Biology"],"article_type":"original","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"ddc":["570"],"date_updated":"2023-08-16T09:37:25Z","department":[{"_id":"PaSc"}],"file_date_updated":"2023-08-16T09:36:28Z","pmid":1,"oa_version":"Published Version","abstract":[{"text":"Probing the dynamics of aromatic side chains provides important insights into the behavior of a protein because flips of aromatic rings in a protein’s hydrophobic core report on breathing motion involving a large part of the protein. Inherently invisible to crystallography, aromatic motions have been primarily studied by solution NMR. The question how packing of proteins in crystals affects ring flips has, thus, remained largely unexplored. Here we apply magic-angle spinning NMR, advanced phenylalanine 1H-13C/2H isotope labeling and MD simulation to a protein in three different crystal packing environments to shed light onto possible impact of packing on ring flips. The flips of the two Phe residues in ubiquitin, both surface exposed, appear remarkably conserved in the different crystal forms, even though the intermolecular packing is quite different: Phe4 flips on a ca. 10–20 ns time scale, and Phe45 are broadened in all crystals, presumably due to µs motion. Our findings suggest that intramolecular influences are more important for ring flips than intermolecular (packing) effects.","lang":"eng"}],"month":"01","intvolume":" 7","scopus_import":"1","file":[{"file_size":5132322,"date_updated":"2023-08-16T09:36:28Z","creator":"dernst","file_name":"2023_JourStrucBiologyX_Gauto.pdf","date_created":"2023-08-16T09:36:28Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"b4b1c10a31018aafe053b7d55a470e54","file_id":"14064"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2590-1524"]},"publication_status":"published","volume":7,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_number":"100079","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Gauto, Diego F., et al. “Aromatic Ring Flips in Differently Packed Ubiquitin Protein Crystals from MAS NMR and MD.” Journal of Structural Biology: X, vol. 7, 100079, Elsevier, 2023, doi:10.1016/j.yjsbx.2022.100079.","short":"D.F. Gauto, O.O. Lebedenko, L.M. Becker, I. Ayala, R. Lichtenecker, N.R. Skrynnikov, P. Schanda, Journal of Structural Biology: X 7 (2023).","ieee":"D. F. Gauto et al., “Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD,” Journal of Structural Biology: X, vol. 7. Elsevier, 2023.","apa":"Gauto, D. F., Lebedenko, O. O., Becker, L. M., Ayala, I., Lichtenecker, R., Skrynnikov, N. R., & Schanda, P. (2023). Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural Biology: X. Elsevier. https://doi.org/10.1016/j.yjsbx.2022.100079","ama":"Gauto DF, Lebedenko OO, Becker LM, et al. Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural Biology: X. 2023;7. doi:10.1016/j.yjsbx.2022.100079","chicago":"Gauto, Diego F., Olga O. Lebedenko, Lea Marie Becker, Isabel Ayala, Roman Lichtenecker, Nikolai R. Skrynnikov, and Paul Schanda. “Aromatic Ring Flips in Differently Packed Ubiquitin Protein Crystals from MAS NMR and MD.” Journal of Structural Biology: X. Elsevier, 2023. https://doi.org/10.1016/j.yjsbx.2022.100079.","ista":"Gauto DF, Lebedenko OO, Becker LM, Ayala I, Lichtenecker R, Skrynnikov NR, Schanda P. 2023. Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural Biology: X. 7, 100079."},"title":"Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD","author":[{"full_name":"Gauto, Diego F.","last_name":"Gauto","first_name":"Diego F."},{"first_name":"Olga O.","last_name":"Lebedenko","full_name":"Lebedenko, Olga O."},{"first_name":"Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","last_name":"Becker","orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie"},{"first_name":"Isabel","full_name":"Ayala, Isabel","last_name":"Ayala"},{"last_name":"Lichtenecker","full_name":"Lichtenecker, Roman","first_name":"Roman"},{"last_name":"Skrynnikov","full_name":"Skrynnikov, Nikolai R.","first_name":"Nikolai R."},{"orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"article_processing_charge":"No","external_id":{"pmid":["36578472"]},"acknowledgement":"The NMR platform in Grenoble is part of the Grenoble Instruct-ERIC center (ISBG; UAR 3518 CNRS-CEA-UGA-EMBL) within the Grenoble Partnership for Structural Biology (PSB), supported by FRISBI (ANR-10-INBS-0005-02) and GRAL, financed within the University Grenoble Alpes graduate school (Ecoles Universitaires de Recherche) CBH-EUR-GS (ANR-17-EURE-0003). This work was supported by the European Research Council (StG-2012-311318-ProtDyn2Function to P.S.) and used the platforms of the Grenoble Instruct Center (ISBG; UMS 3518 CNRS-CEA-UJF-EMBL) with support from FRISBI (ANR-10-INSB-05–02) and GRAL (ANR-10-LABX-49–01) within the Grenoble Partnership for Structural Biology (PSB). We would like to thank Sergei Izmailov for developing and maintaining the pyxmolpp2 library. N.R.S. acknowledges support from St. Petersburg State University in a form of the grant 92425251 and the access to the MRR, MCT and CAMR resource centers. P.S. thanks Malcolm Levitt for pointing out the fact that “tensor asymmetry” is better called “tensor biaxiality”.","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"01","publication":"Journal of Structural Biology: X","has_accepted_license":"1","year":"2023","date_published":"2023-01-01T00:00:00Z","doi":"10.1016/j.yjsbx.2022.100079","date_created":"2023-01-12T11:55:38Z"},{"article_processing_charge":"Yes (via OA deal)","external_id":{"pmid":["36448231"],"isi":["000891573000001"]},"author":[{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","last_name":"Loose"},{"first_name":"Albert","id":"3018E8C2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3580-2906","full_name":"Auer, Albert","last_name":"Auer"},{"id":"D96FFDA0-A884-11E9-9968-DC26E6697425","first_name":"Gabriel","last_name":"Brognara","full_name":"Brognara, Gabriel"},{"full_name":"Budiman, Hanifatul R","last_name":"Budiman","id":"55380f95-15b2-11ec-abd3-aff8e230696b","first_name":"Hanifatul R"},{"first_name":"Lukasz M","id":"e3a512e2-4bbe-11eb-a68a-e3857a7844c2","last_name":"Kowalski","full_name":"Kowalski, Lukasz M"},{"first_name":"Ivana","id":"83c17ce3-15b2-11ec-abd3-f486545870bd","full_name":"Matijevic, Ivana","last_name":"Matijevic"}],"title":"In vitro reconstitution of small GTPase regulation","citation":{"apa":"Loose, M., Auer, A., Brognara, G., Budiman, H. R., Kowalski, L. M., & Matijevic, I. (2023). In vitro reconstitution of small GTPase regulation. FEBS Letters. Wiley. https://doi.org/10.1002/1873-3468.14540","ama":"Loose M, Auer A, Brognara G, Budiman HR, Kowalski LM, Matijevic I. In vitro reconstitution of small GTPase regulation. FEBS Letters. 2023;597(6):762-777. doi:10.1002/1873-3468.14540","short":"M. Loose, A. Auer, G. Brognara, H.R. Budiman, L.M. Kowalski, I. Matijevic, FEBS Letters 597 (2023) 762–777.","ieee":"M. Loose, A. Auer, G. Brognara, H. R. Budiman, L. M. Kowalski, and I. Matijevic, “In vitro reconstitution of small GTPase regulation,” FEBS Letters, vol. 597, no. 6. Wiley, pp. 762–777, 2023.","mla":"Loose, Martin, et al. “In Vitro Reconstitution of Small GTPase Regulation.” FEBS Letters, vol. 597, no. 6, Wiley, 2023, pp. 762–77, doi:10.1002/1873-3468.14540.","ista":"Loose M, Auer A, Brognara G, Budiman HR, Kowalski LM, Matijevic I. 2023. In vitro reconstitution of small GTPase regulation. FEBS Letters. 597(6), 762–777.","chicago":"Loose, Martin, Albert Auer, Gabriel Brognara, Hanifatul R Budiman, Lukasz M Kowalski, and Ivana Matijevic. “In Vitro Reconstitution of Small GTPase Regulation.” FEBS Letters. Wiley, 2023. https://doi.org/10.1002/1873-3468.14540."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Wiley","acknowledgement":"The authors acknowledge support from IST Austria and helpful comments from the anonymous reviewers that helped to improve this manuscript. We apologize to the authors of primary literature and outstanding research not cited here due to space restraints.","page":"762-777","date_created":"2023-01-12T12:09:58Z","doi":"10.1002/1873-3468.14540","date_published":"2023-03-01T00:00:00Z","year":"2023","isi":1,"has_accepted_license":"1","publication":"FEBS Letters","day":"01","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"article_type":"review","type":"journal_article","keyword":["Cell Biology","Genetics","Molecular Biology","Biochemistry","Structural Biology","Biophysics"],"status":"public","_id":"12163","department":[{"_id":"MaLo"}],"file_date_updated":"2023-08-16T08:31:04Z","date_updated":"2023-08-16T08:32:29Z","ddc":["570"],"scopus_import":"1","intvolume":" 597","month":"03","abstract":[{"lang":"eng","text":"Small GTPases play essential roles in the organization of eukaryotic cells. In recent years, it has become clear that their intracellular functions result from intricate biochemical networks of the GTPase and their regulators that dynamically bind to a membrane surface. Due to the inherent complexities of their interactions, however, revealing the underlying mechanisms of action is often difficult to achieve from in vivo studies. This review summarizes in vitro reconstitution approaches developed to obtain a better mechanistic understanding of how small GTPase activities are regulated in space and time."}],"pmid":1,"oa_version":"Published Version","volume":597,"issue":"6","publication_status":"published","publication_identifier":{"issn":["0014-5793"],"eissn":["1873-3468"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14063","checksum":"7492244d3f9c5faa1347ef03f6e5bc84","file_size":3148143,"date_updated":"2023-08-16T08:31:04Z","creator":"dernst","file_name":"2023_FEBSLetters_Loose.pdf","date_created":"2023-08-16T08:31:04Z"}]},{"date_updated":"2023-08-16T08:39:36Z","department":[{"_id":"KrPi"}],"_id":"12164","status":"public","keyword":["Computational Theory and Mathematics","Computer Networks and Communications","Hardware and Architecture","Theoretical Computer Science"],"type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"publication_status":"published","volume":36,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this work, we address this gap. We show that n-process, wait-free and linearizable counters can be implemented from read-write registers with O(log2n) amortized step complexity. This is the first counter algorithm from read-write registers that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is within a logarithmic factor of the optimal. The worst-case step complexity of the construction remains linear, which is optimal. This is obtained thanks to a new max register construction with O(logn) amortized step complexity in executions of arbitrary length in which the value stored in the register does not grow too quickly. We then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel [1] in which we “plug” our max register implementation to show that it remains linearizable while achieving O(log2n) amortized step complexity."}],"month":"03","intvolume":" 36","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://drops.dagstuhl.de/opus/volltexte/2019/11310/"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00439-5.","ista":"Baig MA, Hendler D, Milani A, Travers C. 2023. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 36, 29–43.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived counters with polylogarithmic amortized step complexity,” Distributed Computing, vol. 36. Springer Nature, pp. 29–43, 2023.","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023) 29–43.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 2023;36:29-43. doi:10.1007/s00446-022-00439-5","apa":"Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2023). Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00439-5"},"title":"Long-lived counters with polylogarithmic amortized step complexity","author":[{"first_name":"Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","full_name":"Baig, Mirza Ahad","last_name":"Baig"},{"first_name":"Danny","full_name":"Hendler, Danny","last_name":"Hendler"},{"first_name":"Alessia","full_name":"Milani, Alessia","last_name":"Milani"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"article_processing_charge":"No","external_id":{"isi":["000890138700001"]},"day":"01","publication":"Distributed Computing","isi":1,"year":"2023","doi":"10.1007/s00446-022-00439-5","date_published":"2023-03-01T00:00:00Z","date_created":"2023-01-12T12:10:08Z","page":"29-43","acknowledgement":"A preliminary version of this work appeared in DISC’19. Mirza Ahad Baig, Alessia Milani and Corentin Travers are supported by ANR projects Descartes and FREDDA. Mirza Ahad Baig is supported by UMI Relax. Danny Hendler is supported by the Israel Science Foundation (Grants 380/18 and 1425/22).","publisher":"Springer Nature","quality_controlled":"1","oa":1},{"scopus_import":"1","month":"01","intvolume":" 16","abstract":[{"text":"Introduction: The olfactory system in most mammals is divided into several subsystems based on the anatomical locations of the neuroreceptor cells involved and the receptor families that are expressed. In addition to the main olfactory system and the vomeronasal system, a range of olfactory subsystems converge onto the transition zone located between the main olfactory bulb (MOB) and the accessory olfactory bulb (AOB), which has been termed the olfactory limbus (OL). The OL contains specialized glomeruli that receive noncanonical sensory afferences and which interact with the MOB and AOB. Little is known regarding the olfactory subsystems of mammals other than laboratory rodents.\r\nMethods: We have focused on characterizing the OL in the red fox by performing general and specific histological stainings on serial sections, using both single and double immunohistochemical and lectin-histochemical labeling techniques.\r\nResults: As a result, we have been able to determine that the OL of the red fox (Vulpes vulpes) displays an uncommonly high degree of development and complexity.\r\nDiscussion: This makes this species a novel mammalian model, the study of which could improve our understanding of the noncanonical pathways involved in the processing of chemosensory cues.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","volume":16,"publication_identifier":{"eissn":["1662-5129"]},"publication_status":"published","file":[{"file_size":21943473,"date_updated":"2023-02-06T07:56:14Z","creator":"dernst","file_name":"2022_FrontiersNeuroanatomy_OrtizLeal.pdf","date_created":"2023-02-06T07:56:14Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"49cd40f3bda6f267079427042e7d15e3","file_id":"12518"}],"language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"12515","file_date_updated":"2023-02-06T07:56:14Z","department":[{"_id":"PeJo"}],"date_updated":"2023-08-16T11:37:52Z","ddc":["570"],"publisher":"Frontiers","quality_controlled":"1","oa":1,"acknowledgement":"This work was partially supported by a grant from “Consello Social Universidade de Santiago de Compostela” 2022-PU004.We would like to show special gratitude to Prof. Ludwig Wagner (Medical University, Vienna) for kindly providing us with the secretagogin antibody. We thank the Wildlife Recovery Centres of Galicia, Dirección Xeral de Patrimonio Natural (Xunta de Galicia, Spain), and Federación Galega de Caza for providing the red foxes used in this study.","date_published":"2023-01-10T00:00:00Z","doi":"10.3389/fnana.2022.1097467","date_created":"2023-02-05T23:01:00Z","has_accepted_license":"1","isi":1,"year":"2023","day":"10","publication":"Frontiers in Neuroanatomy","article_number":"1097467","author":[{"first_name":"Irene","last_name":"Ortiz-Leal","full_name":"Ortiz-Leal, Irene"},{"first_name":"Mateo V.","full_name":"Torres, Mateo V.","last_name":"Torres"},{"full_name":"Vargas Barroso, Victor M","last_name":"Vargas Barroso","first_name":"Victor M","id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fidalgo, Luis Eusebio","last_name":"Fidalgo","first_name":"Luis Eusebio"},{"first_name":"Ana María","last_name":"López-Beceiro","full_name":"López-Beceiro, Ana María"},{"first_name":"Jorge A.","full_name":"Larriva-Sahd, Jorge A.","last_name":"Larriva-Sahd"},{"first_name":"Pablo","last_name":"Sánchez-Quinteiro","full_name":"Sánchez-Quinteiro, Pablo"}],"external_id":{"pmid":["36704406"],"isi":["000919786900001"]},"article_processing_charge":"No","title":"The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway","citation":{"mla":"Ortiz-Leal, Irene, et al. “The Olfactory Limbus of the Red Fox (Vulpes Vulpes). New Insights Regarding a Noncanonical Olfactory Bulb Pathway.” Frontiers in Neuroanatomy, vol. 16, 1097467, Frontiers, 2023, doi:10.3389/fnana.2022.1097467.","ieee":"I. Ortiz-Leal et al., “The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway,” Frontiers in Neuroanatomy, vol. 16. Frontiers, 2023.","short":"I. Ortiz-Leal, M.V. Torres, V.M. Vargas Barroso, L.E. Fidalgo, A.M. López-Beceiro, J.A. Larriva-Sahd, P. Sánchez-Quinteiro, Frontiers in Neuroanatomy 16 (2023).","ama":"Ortiz-Leal I, Torres MV, Vargas Barroso VM, et al. The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway. Frontiers in Neuroanatomy. 2023;16. doi:10.3389/fnana.2022.1097467","apa":"Ortiz-Leal, I., Torres, M. V., Vargas Barroso, V. M., Fidalgo, L. E., López-Beceiro, A. M., Larriva-Sahd, J. A., & Sánchez-Quinteiro, P. (2023). The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway. Frontiers in Neuroanatomy. Frontiers. https://doi.org/10.3389/fnana.2022.1097467","chicago":"Ortiz-Leal, Irene, Mateo V. Torres, Victor M Vargas Barroso, Luis Eusebio Fidalgo, Ana María López-Beceiro, Jorge A. Larriva-Sahd, and Pablo Sánchez-Quinteiro. “The Olfactory Limbus of the Red Fox (Vulpes Vulpes). New Insights Regarding a Noncanonical Olfactory Bulb Pathway.” Frontiers in Neuroanatomy. Frontiers, 2023. https://doi.org/10.3389/fnana.2022.1097467.","ista":"Ortiz-Leal I, Torres MV, Vargas Barroso VM, Fidalgo LE, López-Beceiro AM, Larriva-Sahd JA, Sánchez-Quinteiro P. 2023. The olfactory limbus of the red fox (Vulpes vulpes). New insights regarding a noncanonical olfactory bulb pathway. Frontiers in Neuroanatomy. 16, 1097467."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Nature Biotechnology","page":"813–823","date_published":"2023-06-01T00:00:00Z","doi":"10.1038/s41587-022-01560-3","date_created":"2023-01-08T23:00:53Z","acknowledgement":"We thank M. van Loenhout for experimental advice on purifying cell types from the bone marrow, R. van der Linden for expertise with FACS and M. Blotenburg for help with cell typing the mouse organogenesis dataset. We thank M. Saraswat and O. Stegle for discussions on multinomial distributions. This work was supported by a European Research Council Advanced grant (ERC-AdG 742225-IntScOmics); Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) TOP grant (NWO CW 714.016.001) and NWO grant (OCENW.GROOT.2019.017); the Swiss National Science Foundation Early Postdoc Mobility (P2ELP3-184488 to P.Z. and P2BSP3-174991 to J.Y.); Marie Sklodowska-Curie Actions Postdoc (798573 to P.Z.) and the Human Frontier for Science Program Long-Term Fellowships (LT000209-2018-L to P.Z. and LT000097-2019-L to J.Y.). This work is part of the Oncode Institute which is financed partly by the Dutch Cancer Society.","publisher":"Springer Nature","quality_controlled":"1","oa":1,"citation":{"apa":"Yeung, J., Florescu, M., Zeller, P., De Barbanson, B. A., Wellenstein, M. D., & Van Oudenaarden, A. (2023). scChIX-seq infers dynamic relationships between histone modifications in single cells. Nature Biotechnology. Springer Nature. https://doi.org/10.1038/s41587-022-01560-3","ama":"Yeung J, Florescu M, Zeller P, De Barbanson BA, Wellenstein MD, Van Oudenaarden A. scChIX-seq infers dynamic relationships between histone modifications in single cells. Nature Biotechnology. 2023;41:813–823. doi:10.1038/s41587-022-01560-3","short":"J. Yeung, M. Florescu, P. Zeller, B.A. De Barbanson, M.D. Wellenstein, A. Van Oudenaarden, Nature Biotechnology 41 (2023) 813–823.","ieee":"J. Yeung, M. Florescu, P. Zeller, B. A. De Barbanson, M. D. Wellenstein, and A. Van Oudenaarden, “scChIX-seq infers dynamic relationships between histone modifications in single cells,” Nature Biotechnology, vol. 41. Springer Nature, pp. 813–823, 2023.","mla":"Yeung, Jake, et al. “ScChIX-Seq Infers Dynamic Relationships between Histone Modifications in Single Cells.” Nature Biotechnology, vol. 41, Springer Nature, 2023, pp. 813–823, doi:10.1038/s41587-022-01560-3.","ista":"Yeung J, Florescu M, Zeller P, De Barbanson BA, Wellenstein MD, Van Oudenaarden A. 2023. scChIX-seq infers dynamic relationships between histone modifications in single cells. Nature Biotechnology. 41, 813–823.","chicago":"Yeung, Jake, Maria Florescu, Peter Zeller, Buys Anton De Barbanson, Max D. Wellenstein, and Alexander Van Oudenaarden. “ScChIX-Seq Infers Dynamic Relationships between Histone Modifications in Single Cells.” Nature Biotechnology. Springer Nature, 2023. https://doi.org/10.1038/s41587-022-01560-3."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jake","id":"123012b2-db30-11eb-b4d8-a35840c0551b","orcid":"0000-0003-1732-1559","full_name":"Yeung, Jake","last_name":"Yeung"},{"last_name":"Florescu","full_name":"Florescu, Maria","first_name":"Maria"},{"first_name":"Peter","last_name":"Zeller","full_name":"Zeller, Peter"},{"full_name":"De Barbanson, Buys Anton","last_name":"De Barbanson","first_name":"Buys Anton"},{"first_name":"Max D.","full_name":"Wellenstein, Max D.","last_name":"Wellenstein"},{"first_name":"Alexander","full_name":"Van Oudenaarden, Alexander","last_name":"Van Oudenaarden"}],"article_processing_charge":"No","external_id":{"isi":["000909067600003"]},"title":"scChIX-seq infers dynamic relationships between histone modifications in single cells","publication_identifier":{"eissn":["1546-1696"],"issn":["1087-0156"]},"publication_status":"published","file":[{"file_name":"2023_NatureBioTech_Yeung.pdf","date_created":"2023-08-16T11:30:45Z","file_size":12040976,"date_updated":"2023-08-16T11:30:45Z","creator":"dernst","success":1,"checksum":"668447a1c8d360b68f8aaf9e08ed644f","file_id":"14066","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"volume":41,"abstract":[{"lang":"eng","text":"Regulation of chromatin states involves the dynamic interplay between different histone modifications to control gene expression. Recent advances have enabled mapping of histone marks in single cells, but most methods are constrained to profile only one histone mark per cell. Here, we present an integrated experimental and computational framework, scChIX-seq (single-cell chromatin immunocleavage and unmixing sequencing), to map several histone marks in single cells. scChIX-seq multiplexes two histone marks together in single cells, then computationally deconvolves the signal using training data from respective histone mark profiles. This framework learns the cell-type-specific correlation structure between histone marks, and therefore does not require a priori assumptions of their genomic distributions. Using scChIX-seq, we demonstrate multimodal analysis of histone marks in single cells across a range of mark combinations. Modeling dynamics of in vitro macrophage differentiation enables integrated analysis of chromatin velocity. Overall, scChIX-seq unlocks systematic interrogation of the interplay between histone modifications in single cells."}],"oa_version":"Published Version","scopus_import":"1","month":"06","intvolume":" 41","date_updated":"2023-08-16T11:32:33Z","ddc":["570"],"department":[{"_id":"ScienComp"}],"file_date_updated":"2023-08-16T11:30:45Z","_id":"12106","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public"},{"intvolume":" 24","month":"05","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2205.15284","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider a gas of n bosonic particles confined in a box [−ℓ/2,ℓ/2]3 with Neumann boundary conditions. We prove Bose–Einstein condensation in the Gross–Pitaevskii regime, with an optimal bound on the condensate depletion. Moreover, our lower bound for the ground state energy in a small box [−ℓ/2,ℓ/2]3 implies (via Neumann bracketing) a lower bound for the ground state energy of N bosons in a large box [−L/2,L/2]3 with density ρ=N/L3 in the thermodynamic limit."}],"ec_funded":1,"volume":24,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1424-0637"]},"status":"public","article_type":"original","type":"journal_article","_id":"12183","department":[{"_id":"RoSe"}],"date_updated":"2023-08-16T11:34:03Z","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged.","date_created":"2023-01-15T23:00:52Z","doi":"10.1007/s00023-022-01252-3","date_published":"2023-05-01T00:00:00Z","page":"1505-1560","publication":"Annales Henri Poincare","day":"01","year":"2023","isi":1,"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"title":"The Bose Gas in a box with Neumann boundary conditions","article_processing_charge":"No","external_id":{"arxiv":["2205.15284"],"isi":["000910751800002"]},"author":[{"id":"342E7E22-F248-11E8-B48F-1D18A9856A87","first_name":"Chiara","full_name":"Boccato, Chiara","last_name":"Boccato"},{"last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boccato C, Seiringer R. 2023. The Bose Gas in a box with Neumann boundary conditions. Annales Henri Poincare. 24, 1505–1560.","chicago":"Boccato, Chiara, and Robert Seiringer. “The Bose Gas in a Box with Neumann Boundary Conditions.” Annales Henri Poincare. Springer Nature, 2023. https://doi.org/10.1007/s00023-022-01252-3.","ama":"Boccato C, Seiringer R. The Bose Gas in a box with Neumann boundary conditions. Annales Henri Poincare. 2023;24:1505-1560. doi:10.1007/s00023-022-01252-3","apa":"Boccato, C., & Seiringer, R. (2023). The Bose Gas in a box with Neumann boundary conditions. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-022-01252-3","ieee":"C. Boccato and R. Seiringer, “The Bose Gas in a box with Neumann boundary conditions,” Annales Henri Poincare, vol. 24. Springer Nature, pp. 1505–1560, 2023.","short":"C. Boccato, R. Seiringer, Annales Henri Poincare 24 (2023) 1505–1560.","mla":"Boccato, Chiara, and Robert Seiringer. “The Bose Gas in a Box with Neumann Boundary Conditions.” Annales Henri Poincare, vol. 24, Springer Nature, 2023, pp. 1505–60, doi:10.1007/s00023-022-01252-3."}},{"date_updated":"2023-08-16T12:22:07Z","ddc":["510","540"],"department":[{"_id":"HeEd"}],"file_date_updated":"2023-08-16T12:21:13Z","_id":"12544","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"issn":["1549-9596"],"eissn":["1549-960X"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14070","checksum":"7d20562269edff1e31b9d6019d4983b0","file_size":8069223,"date_updated":"2023-08-16T12:21:13Z","creator":"dernst","file_name":"2023_JCIM_Koehl.pdf","date_created":"2023-08-16T12:21:13Z"}],"language":[{"iso":"eng"}],"volume":63,"issue":"3","ec_funded":1,"abstract":[{"lang":"eng","text":"Geometry is crucial in our efforts to comprehend the structures and dynamics of biomolecules. For example, volume, surface area, and integrated mean and Gaussian curvature of the union of balls representing a molecule are used to quantify its interactions with the water surrounding it in the morphometric implicit solvent models. The Alpha Shape theory provides an accurate and reliable method for computing these geometric measures. In this paper, we derive homogeneous formulas for the expressions of these measures and their derivatives with respect to the atomic coordinates, and we provide algorithms that implement them into a new software package, AlphaMol. The only variables in these formulas are the interatomic distances, making them insensitive to translations and rotations. AlphaMol includes a sequential algorithm and a parallel algorithm. In the parallel version, we partition the atoms of the molecule of interest into 3D rectangular blocks, using a kd-tree algorithm. We then apply the sequential algorithm of AlphaMol to each block, augmented by a buffer zone to account for atoms whose ball representations may partially cover the block. The current parallel version of AlphaMol leads to a 20-fold speed-up compared to an independent serial implementation when using 32 processors. For instance, it takes 31 s to compute the geometric measures and derivatives of each atom in a viral capsid with more than 26 million atoms on 32 Intel processors running at 2.7 GHz. The presence of the buffer zones, however, leads to redundant computations, which ultimately limit the impact of using multiple processors. AlphaMol is available as an OpenSource software."}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","month":"02","intvolume":" 63","citation":{"mla":"Koehl, Patrice, et al. “Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.” Journal of Chemical Information and Modeling, vol. 63, no. 3, American Chemical Society, 2023, pp. 973–85, doi:10.1021/acs.jcim.2c01346.","short":"P. Koehl, A. Akopyan, H. Edelsbrunner, Journal of Chemical Information and Modeling 63 (2023) 973–985.","ieee":"P. Koehl, A. Akopyan, and H. Edelsbrunner, “Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives,” Journal of Chemical Information and Modeling, vol. 63, no. 3. American Chemical Society, pp. 973–985, 2023.","apa":"Koehl, P., Akopyan, A., & Edelsbrunner, H. (2023). Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical Information and Modeling. American Chemical Society. https://doi.org/10.1021/acs.jcim.2c01346","ama":"Koehl P, Akopyan A, Edelsbrunner H. Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical Information and Modeling. 2023;63(3):973-985. doi:10.1021/acs.jcim.2c01346","chicago":"Koehl, Patrice, Arseniy Akopyan, and Herbert Edelsbrunner. “Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.” Journal of Chemical Information and Modeling. American Chemical Society, 2023. https://doi.org/10.1021/acs.jcim.2c01346.","ista":"Koehl P, Akopyan A, Edelsbrunner H. 2023. Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical Information and Modeling. 63(3), 973–985."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Koehl, Patrice","last_name":"Koehl","first_name":"Patrice"},{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"article_processing_charge":"No","external_id":{"isi":["000920370700001"],"pmid":["36638318"]},"title":"Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"isi":1,"has_accepted_license":"1","year":"2023","day":"13","publication":"Journal of Chemical Information and Modeling","page":"973-985","doi":"10.1021/acs.jcim.2c01346","date_published":"2023-02-13T00:00:00Z","date_created":"2023-02-12T23:00:59Z","acknowledgement":"P.K. acknowledges support from the University of California Multicampus Research Programs and Initiatives (Grant No. M21PR3267) and from the NSF (Grant No.1760485). H.E. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.\r\nOpen Access is funded by the Austrian Science Fund (FWF).","publisher":"American Chemical Society","quality_controlled":"1","oa":1},{"abstract":[{"text":"Treating sick group members is a hallmark of collective disease defence in vertebrates and invertebrates alike. Despite substantial effects on pathogen fitness and epidemiology, it is still largely unknown how pathogens react to the selection pressure imposed by care intervention. Using social insects and pathogenic fungi, we here performed a serial passage experiment in the presence or absence of colony members, which provide social immunity by grooming off infectious spores from exposed individuals. We found specific effects on pathogen diversity, virulence and transmission. Under selection of social immunity, pathogens invested into higher spore production, but spores were less virulent. Notably, they also elicited a lower grooming response in colony members, compared with spores from the individual host selection lines. Chemical spore analysis suggested that the spores from social selection lines escaped the caregivers’ detection by containing lower levels of ergosterol, a key fungal membrane component. Experimental application of chemically pure ergosterol indeed induced sanitary grooming, supporting its role as a microbe-associated cue triggering host social immunity against fungal pathogens. By reducing this detection cue, pathogens were able to evade the otherwise very effective collective disease defences of their social hosts.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","intvolume":" 7","month":"03","publication_status":"published","publication_identifier":{"eissn":["2397-334X"]},"language":[{"iso":"eng"}],"file":[{"checksum":"8244f4650a0e7aeea488d1bcd4a31702","file_id":"14069","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-08-16T11:54:59Z","file_name":"2023_NatureEcoEvo_Stock.pdf","date_updated":"2023-08-16T11:54:59Z","file_size":1600499,"creator":"dernst"}],"ec_funded":1,"volume":7,"related_material":{"link":[{"description":"News on ISTA website","url":"https://ista.ac.at/en/news/how-sneaky-germs-hide-from-ants/","relation":"press_release"}]},"_id":"12543","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","date_updated":"2023-08-16T11:55:48Z","ddc":["570"],"department":[{"_id":"SyCr"},{"_id":"LifeSc"},{"_id":"JiFr"}],"file_date_updated":"2023-08-16T11:54:59Z","acknowledgement":"We thank B. M. Steinwender, N. V. Meyling and J. Eilenberg for the fungal strains; J. Anaya-Rojas for statistical advice; the Social Immunity team at ISTA for ant collection and experimental help, in particular H. Leitner, and the ISTA Lab Support Facility for general laboratory support; D. Ebert, H. Schulenburg and J. Heinze for continued project discussion; and M. Sixt, R. Roemhild and the Social Immunity team for comments on the manuscript. The study was funded by the German Research Foundation (CR118/3-1) within the Framework of the Priority Program SPP 1399, and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (No. 771402; EPIDEMICSonCHIP), both to S.C.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","year":"2023","has_accepted_license":"1","isi":1,"publication":"Nature Ecology and Evolution","day":"01","page":"450-460","date_created":"2023-02-12T23:00:59Z","date_published":"2023-03-01T00:00:00Z","doi":"10.1038/s41559-023-01981-6","project":[{"name":"Epidemics in ant societies on a chip","grant_number":"771402","call_identifier":"H2020","_id":"2649B4DE-B435-11E9-9278-68D0E5697425"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"}],"citation":{"chicago":"Stock, Miriam, Barbara Milutinovic, Michaela Hönigsberger, Anna V Grasse, Florian Wiesenhofer, Niklas Kampleitner, Madhumitha Narasimhan, Thomas Schmitt, and Sylvia Cremer. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution. Springer Nature, 2023. https://doi.org/10.1038/s41559-023-01981-6.","ista":"Stock M, Milutinovic B, Hönigsberger M, Grasse AV, Wiesenhofer F, Kampleitner N, Narasimhan M, Schmitt T, Cremer S. 2023. Pathogen evasion of social immunity. Nature Ecology and Evolution. 7, 450–460.","mla":"Stock, Miriam, et al. “Pathogen Evasion of Social Immunity.” Nature Ecology and Evolution, vol. 7, Springer Nature, 2023, pp. 450–60, doi:10.1038/s41559-023-01981-6.","short":"M. Stock, B. Milutinovic, M. Hönigsberger, A.V. Grasse, F. Wiesenhofer, N. Kampleitner, M. Narasimhan, T. Schmitt, S. Cremer, Nature Ecology and Evolution 7 (2023) 450–460.","ieee":"M. Stock et al., “Pathogen evasion of social immunity,” Nature Ecology and Evolution, vol. 7. Springer Nature, pp. 450–460, 2023.","ama":"Stock M, Milutinovic B, Hönigsberger M, et al. Pathogen evasion of social immunity. Nature Ecology and Evolution. 2023;7:450-460. doi:10.1038/s41559-023-01981-6","apa":"Stock, M., Milutinovic, B., Hönigsberger, M., Grasse, A. V., Wiesenhofer, F., Kampleitner, N., … Cremer, S. (2023). Pathogen evasion of social immunity. Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-023-01981-6"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"pmid":["36732670"],"isi":["000924572800001"]},"author":[{"full_name":"Stock, Miriam","last_name":"Stock","first_name":"Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87"},{"id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","first_name":"Barbara","full_name":"Milutinovic, Barbara","orcid":"0000-0002-8214-4758","last_name":"Milutinovic"},{"last_name":"Hönigsberger","full_name":"Hönigsberger, Michaela","id":"953894f3-25bd-11ec-8556-f70a9d38ef60","first_name":"Michaela"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","full_name":"Grasse, Anna V","last_name":"Grasse"},{"id":"39523C54-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Wiesenhofer","full_name":"Wiesenhofer, Florian"},{"last_name":"Kampleitner","full_name":"Kampleitner, Niklas","first_name":"Niklas","id":"2AC57FAC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Narasimhan","orcid":"0000-0002-8600-0671","full_name":"Narasimhan, Madhumitha","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","first_name":"Madhumitha"},{"first_name":"Thomas","full_name":"Schmitt, Thomas","last_name":"Schmitt"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"title":"Pathogen evasion of social immunity"},{"citation":{"ista":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. 2023. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 7(1), qrac004.","chicago":"Mrnjavac, Andrea, Kseniia Khudiakova, Nicholas H Barton, and Beatriz Vicoso. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters. Oxford University Press, 2023. https://doi.org/10.1093/evlett/qrac004.","ieee":"A. Mrnjavac, K. Khudiakova, N. H. Barton, and B. Vicoso, “Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution,” Evolution Letters, vol. 7, no. 1. Oxford University Press, 2023.","short":"A. Mrnjavac, K. Khudiakova, N.H. Barton, B. Vicoso, Evolution Letters 7 (2023).","apa":"Mrnjavac, A., Khudiakova, K., Barton, N. H., & Vicoso, B. (2023). Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrac004","ama":"Mrnjavac A, Khudiakova K, Barton NH, Vicoso B. Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution. Evolution Letters. 2023;7(1). doi:10.1093/evlett/qrac004","mla":"Mrnjavac, Andrea, et al. “Slower-X: Reduced Efficiency of Selection in the Early Stages of X Chromosome Evolution.” Evolution Letters, vol. 7, no. 1, qrac004, Oxford University Press, 2023, doi:10.1093/evlett/qrac004."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["37065438"],"isi":["001021692200001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"full_name":"Mrnjavac, Andrea","last_name":"Mrnjavac","id":"353FAC84-AE61-11E9-8BFC-00D3E5697425","first_name":"Andrea"},{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia","orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia","last_name":"Khudiakova"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306"}],"title":"Slower-X: Reduced efficiency of selection in the early stages of X chromosome evolution","article_number":"qrac004","project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"250BDE62-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715257","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution"}],"year":"2023","isi":1,"has_accepted_license":"1","publication":"Evolution Letters","day":"01","date_created":"2023-02-06T13:59:12Z","date_published":"2023-02-01T00:00:00Z","doi":"10.1093/evlett/qrac004","acknowledgement":"We thank the Vicoso and Barton groups and ISTA Scientific Computing Unit. We also thank two anonymous reviewers for their valuable comments. This work was supported by the European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreements no. 715257 and no. 716117).","oa":1,"publisher":"Oxford University Press","quality_controlled":"1","date_updated":"2023-08-16T11:44:32Z","ddc":["570"],"file_date_updated":"2023-08-16T11:43:33Z","department":[{"_id":"GradSch"},{"_id":"BeVi"}],"_id":"12521","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"status":"public","publication_status":"published","publication_identifier":{"issn":["2056-3744"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2023_EvLetters_Mrnjavac.pdf","date_created":"2023-08-16T11:43:33Z","file_size":2592189,"date_updated":"2023-08-16T11:43:33Z","creator":"dernst","success":1,"file_id":"14068","checksum":"a240a041cb9b9b7c8ba93a4706674a3f","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"ec_funded":1,"volume":7,"issue":"1","abstract":[{"lang":"eng","text":"Differentiated X chromosomes are expected to have higher rates of adaptive divergence than autosomes, if new beneficial mutations are recessive (the “faster-X effect”), largely because these mutations are immediately exposed to selection in males. The evolution of X chromosomes after they stop recombining in males, but before they become hemizygous, has not been well explored theoretically. We use the diffusion approximation to infer substitution rates of beneficial and deleterious mutations under such a scenario. Our results show that selection is less efficient on diploid X loci than on autosomal and hemizygous X loci under a wide range of parameters. This “slower-X” effect is stronger for genes affecting primarily (or only) male fitness, and for sexually antagonistic genes. These unusual dynamics suggest that some of the peculiar features of X chromosomes, such as the differential accumulation of genes with sex-specific functions, may start arising earlier than previously appreciated."}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","intvolume":" 7","month":"02"},{"date_created":"2023-02-26T12:24:21Z","date_published":"2023-04-01T00:00:00Z","doi":"10.1016/j.conb.2023.102695","year":"2023","isi":1,"has_accepted_license":"1","publication":"Current Opinion in Neurobiology","day":"01","oa":1,"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"I wish to thank all current and past members of the Hippenmeyer laboratory at ISTA for exciting discussions on the subject of this review. I apologize to colleagues whose work I could not cite and/or discuss in the frame of the available space. Work in the Hippenmeyer laboratory on the\r\ndiscussed topic is supported by ISTA institutional funds, FWF SFB F78 to S.H., and the European Research Council (ERC) under the European Union’s Horizon 2020 Research and Innovation Programme (grant agree-ment no. 725780 LinPro) to SH.","external_id":{"pmid":["36842274"],"isi":["000953497700001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"}],"title":"Principles of neural stem cell lineage progression: Insights from developing cerebral cortex","citation":{"mla":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology, vol. 79, no. 4, 102695, Elsevier, 2023, doi:10.1016/j.conb.2023.102695.","apa":"Hippenmeyer, S. (2023). Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/j.conb.2023.102695","ama":"Hippenmeyer S. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 2023;79(4). doi:10.1016/j.conb.2023.102695","short":"S. Hippenmeyer, Current Opinion in Neurobiology 79 (2023).","ieee":"S. Hippenmeyer, “Principles of neural stem cell lineage progression: Insights from developing cerebral cortex,” Current Opinion in Neurobiology, vol. 79, no. 4. Elsevier, 2023.","chicago":"Hippenmeyer, Simon. “Principles of Neural Stem Cell Lineage Progression: Insights from Developing Cerebral Cortex.” Current Opinion in Neurobiology. Elsevier, 2023. https://doi.org/10.1016/j.conb.2023.102695.","ista":"Hippenmeyer S. 2023. Principles of neural stem cell lineage progression: Insights from developing cerebral cortex. Current Opinion in Neurobiology. 79(4), 102695."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F07805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"article_number":"102695","ec_funded":1,"issue":"4","volume":79,"publication_status":"published","publication_identifier":{"issn":["0959-4388"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2023-08-16T12:29:06Z","file_size":1787894,"date_created":"2023-08-16T12:29:06Z","file_name":"2023_CurrentOpinionNeurobio_Hippenmeyer.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14071","checksum":"4d11c4ca87e6cbc4d2ac46d3225ea615","success":1}],"scopus_import":"1","intvolume":" 79","month":"04","abstract":[{"lang":"eng","text":"How to generate a brain of correct size and with appropriate cell-type diversity during development is a major question in Neuroscience. In the developing neocortex, radial glial progenitor (RGP) cells are the main neural stem cells that produce cortical excitatory projection neurons, glial cells, and establish the prospective postnatal stem cell niche in the lateral ventricles. RGPs follow a tightly orchestrated developmental program that when disrupted can result in severe cortical malformations such as microcephaly and megalencephaly. The precise cellular and molecular mechanisms instructing faithful RGP lineage progression are however not well understood. This review will summarize recent conceptual advances that contribute to our understanding of the general principles of RGP lineage progression."}],"oa_version":"Published Version","pmid":1,"file_date_updated":"2023-08-16T12:29:06Z","department":[{"_id":"SiHi"}],"date_updated":"2023-08-16T12:30:25Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"review","keyword":["General Neuroscience"],"status":"public","_id":"12679"},{"abstract":[{"lang":"eng","text":"In this paper, we consider traces at initial times for functions with mixed time-space smoothness. Such results are often needed in the theory of evolution equations. Our result extends and unifies many previous results. Our main improvement is that we can allow general interpolation couples. The abstract results are applied to regularity problems for fractional evolution equations and stochastic evolution equations, where uniform trace estimates on the half-line are shown."}],"oa_version":"Published Version","scopus_import":"1","month":"04","intvolume":" 296","publication_identifier":{"eissn":["1522-2616"],"issn":["0025-584X"]},"publication_status":"published","file":[{"file_name":"2023_MathNachrichten_Agresti.pdf","date_created":"2023-08-16T11:40:02Z","file_size":449280,"date_updated":"2023-08-16T11:40:02Z","creator":"dernst","success":1,"file_id":"14067","checksum":"6f099f1d064173784d1a27716a2cc795","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"issue":"4","volume":296,"license":"https://creativecommons.org/licenses/by-nc/4.0/","_id":"12429","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"status":"public","date_updated":"2023-08-16T11:41:42Z","ddc":["510"],"file_date_updated":"2023-08-16T11:40:02Z","department":[{"_id":"JuFi"}],"acknowledgement":"The first author has been partially supported by the Nachwuchsring—Network for the promotion of young scientists—at TU Kaiserslautern. The second and third authors were supported by the Vidi subsidy 639.032.427 of the Netherlands Organisation for Scientific Research (NWO).","quality_controlled":"1","publisher":"Wiley","oa":1,"isi":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"Mathematische Nachrichten","page":"1319-1350","date_published":"2023-04-01T00:00:00Z","doi":"10.1002/mana.202100192","date_created":"2023-01-29T23:00:59Z","citation":{"ieee":"A. Agresti, N. Lindemulder, and M. Veraar, “On the trace embedding and its applications to evolution equations,” Mathematische Nachrichten, vol. 296, no. 4. Wiley, pp. 1319–1350, 2023.","short":"A. Agresti, N. Lindemulder, M. Veraar, Mathematische Nachrichten 296 (2023) 1319–1350.","apa":"Agresti, A., Lindemulder, N., & Veraar, M. (2023). On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. Wiley. https://doi.org/10.1002/mana.202100192","ama":"Agresti A, Lindemulder N, Veraar M. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 2023;296(4):1319-1350. doi:10.1002/mana.202100192","mla":"Agresti, Antonio, et al. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten, vol. 296, no. 4, Wiley, 2023, pp. 1319–50, doi:10.1002/mana.202100192.","ista":"Agresti A, Lindemulder N, Veraar M. 2023. On the trace embedding and its applications to evolution equations. Mathematische Nachrichten. 296(4), 1319–1350.","chicago":"Agresti, Antonio, Nick Lindemulder, and Mark Veraar. “On the Trace Embedding and Its Applications to Evolution Equations.” Mathematische Nachrichten. Wiley, 2023. https://doi.org/10.1002/mana.202100192."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","first_name":"Antonio","last_name":"Agresti","orcid":"0000-0002-9573-2962","full_name":"Agresti, Antonio"},{"last_name":"Lindemulder","full_name":"Lindemulder, Nick","first_name":"Nick"},{"last_name":"Veraar","full_name":"Veraar, Mark","first_name":"Mark"}],"article_processing_charge":"No","external_id":{"isi":["000914134900001"],"arxiv":["2104.05063"]},"title":"On the trace embedding and its applications to evolution equations"},{"quality_controlled":"1","publisher":"World Scientific Publishing","oa":1,"isi":1,"year":"2023","day":"09","publication":"Reviews in Mathematical Physics","doi":"10.1142/S0129055X2350006X","date_published":"2023-01-09T00:00:00Z","date_created":"2023-01-29T23:00:59Z","article_number":"2350006","citation":{"chicago":"Falconi, Marco, Nikolai K Leopold, David Johannes Mitrouskas, and Sören P Petrat. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics. World Scientific Publishing, 2023. https://doi.org/10.1142/S0129055X2350006X.","ista":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. 2023. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 35(4), 2350006.","mla":"Falconi, Marco, et al. “Bogoliubov Dynamics and Higher-Order Corrections for the Regularized Nelson Model.” Reviews in Mathematical Physics, vol. 35, no. 4, 2350006, World Scientific Publishing, 2023, doi:10.1142/S0129055X2350006X.","short":"M. Falconi, N.K. Leopold, D.J. Mitrouskas, S.P. Petrat, Reviews in Mathematical Physics 35 (2023).","ieee":"M. Falconi, N. K. Leopold, D. J. Mitrouskas, and S. P. Petrat, “Bogoliubov dynamics and higher-order corrections for the regularized Nelson model,” Reviews in Mathematical Physics, vol. 35, no. 4. World Scientific Publishing, 2023.","ama":"Falconi M, Leopold NK, Mitrouskas DJ, Petrat SP. Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. 2023;35(4). doi:10.1142/S0129055X2350006X","apa":"Falconi, M., Leopold, N. K., Mitrouskas, D. J., & Petrat, S. P. (2023). Bogoliubov dynamics and higher-order corrections for the regularized Nelson model. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X2350006X"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marco","full_name":"Falconi, Marco","last_name":"Falconi"},{"id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","first_name":"Nikolai K","last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822"},{"first_name":"David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas","full_name":"Mitrouskas, David Johannes"},{"first_name":"Sören P","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrat, Sören P","orcid":"0000-0002-9166-5889","last_name":"Petrat"}],"article_processing_charge":"No","external_id":{"arxiv":["2110.00458"],"isi":["000909760300001"]},"title":"Bogoliubov dynamics and higher-order corrections for the regularized Nelson model","abstract":[{"lang":"eng","text":"We study the time evolution of the Nelson model in a mean-field limit in which N nonrelativistic bosons weakly couple (with respect to the particle number) to a positive or zero mass quantized scalar field. Our main result is the derivation of the Bogoliubov dynamics and higher-order corrections. More precisely, we prove the convergence of the approximate wave function to the many-body wave function in norm, with a convergence rate proportional to the number of corrections taken into account in the approximation. We prove an analogous result for the unitary propagator. As an application, we derive a simple system of partial differential equations describing the time evolution of the first- and second-order approximations to the one-particle reduced density matrices of the particles and the quantum field, respectively."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2110.00458"}],"month":"01","intvolume":" 35","publication_identifier":{"issn":["0129-055X"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":35,"issue":"4","_id":"12430","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-08-16T11:47:27Z","department":[{"_id":"RoSe"}]},{"year":"2023","has_accepted_license":"1","publication":"Nature Computational Science","day":"20","page":"254-263","date_created":"2023-03-26T22:01:08Z","doi":"10.1038/s43588-023-00410-9","date_published":"2023-03-20T00:00:00Z","acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","oa":1,"publisher":"Springer Nature","quality_controlled":"1","citation":{"mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science, vol. 3, Springer Nature, 2023, pp. 254–63, doi:10.1038/s43588-023-00410-9.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” Nature Computational Science, vol. 3. Springer Nature, pp. 254–263, 2023.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 2023;3:254-263. doi:10.1038/s43588-023-00410-9","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-023-00410-9","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” Nature Computational Science. Springer Nature, 2023. https://doi.org/10.1038/s43588-023-00410-9.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2108.06686"]},"author":[{"first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio","last_name":"Lombardi"},{"id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","first_name":"Selver","full_name":"Pepic, Selver","last_name":"Pepic"},{"last_name":"Shriki","full_name":"Shriki, Oren","first_name":"Oren"},{"last_name":"Tkačik","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper"},{"orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"}],"title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"name":"Functional Advantages of Critical Brain Dynamics","grant_number":"M03318","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67"},{"name":"Efficient coding with biophysical realism","grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"publication_status":"published","publication_identifier":{"eissn":["2662-8457"]},"language":[{"iso":"eng"}],"file":[{"file_id":"14073","checksum":"7c63b2b2edfd68aaffe96d70ca6a865a","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2023-08-16T12:39:57Z","file_name":"2023_NatureCompScience_Lombardi.pdf","creator":"dernst","date_updated":"2023-08-16T12:39:57Z","file_size":4474284}],"ec_funded":1,"volume":3,"abstract":[{"text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 3","month":"03","date_updated":"2023-08-16T12:41:53Z","ddc":["570"],"department":[{"_id":"GaTk"},{"_id":"GradSch"}],"file_date_updated":"2023-08-16T12:39:57Z","_id":"12762","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public"},{"author":[{"first_name":"Gramoz","full_name":"Goranci, Gramoz","last_name":"Goranci"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"article_processing_charge":"Yes","external_id":{"unknown":["2211.09606"]},"title":"Efficient data structures for incremental exact and approximate maximum flow","citation":{"mla":"Goranci, Gramoz, and Monika H. Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69.","apa":"Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69","ama":"Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69","short":"G. Goranci, M.H. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","chicago":"Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.","ista":"Goranci G, Henzinger MH. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 69."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775 "}],"article_number":"69","doi":"10.4230/LIPIcs.ICALP.2023.69","date_published":"2023-07-01T00:00:00Z","date_created":"2023-08-20T22:01:14Z","has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the\r\nAustrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”,\r\nI 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nThis work was done in part while Gramoz Goranci was at Institute for Theoretical Studies, ETH Zurich, Switzerland. There, he was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation. We also thank Richard Peng, Thatchaphol Saranurak, Sebastian Forster and Sushant Sachdeva for helpful discussions, and the anonymous reviewers for their insightful comments.","department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T06:59:05Z","date_updated":"2023-08-21T07:00:49Z","ddc":["000"],"type":"conference","conference":{"start_date":"2023-07-10","location":"Paderborn, Germany","end_date":"2023-07-14","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"14085","volume":261,"ec_funded":1,"publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"publication_status":"published","file":[{"file_size":875910,"date_updated":"2023-08-21T06:59:05Z","creator":"dernst","file_name":"2023_LIPIcsICALP_Goranci.pdf","date_created":"2023-08-21T06:59:05Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"14089","checksum":"074177e815a1656de5d4071c7a3dffa6"}],"language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["LIPIcs"],"month":"07","intvolume":" 261","abstract":[{"lang":"eng","text":"We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee."}],"oa_version":"Published Version"},{"type":"conference","conference":{"location":"Paderborn, Germany","end_date":"2023-07-14","start_date":"2023-07-10","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"14084","file_date_updated":"2023-08-21T06:45:16Z","department":[{"_id":"VlKo"}],"date_updated":"2023-08-21T06:49:11Z","ddc":["000","510"],"scopus_import":"1","alternative_title":["LIPIcs"],"month":"07","intvolume":" 261","abstract":[{"lang":"eng","text":"A central problem in computational statistics is to convert a procedure for sampling combinatorial objects into a procedure for counting those objects, and vice versa. We will consider sampling problems which come from Gibbs distributions, which are families of probability distributions over a discrete space Ω with probability mass function of the form μ^Ω_β(ω) ∝ e^{β H(ω)} for β in an interval [β_min, β_max] and H(ω) ∈ {0} ∪ [1, n].\r\nThe partition function is the normalization factor Z(β) = ∑_{ω ∈ Ω} e^{β H(ω)}, and the log partition ratio is defined as q = (log Z(β_max))/Z(β_min)\r\nWe develop a number of algorithms to estimate the counts c_x using roughly Õ(q/ε²) samples for general Gibbs distributions and Õ(n²/ε²) samples for integer-valued distributions (ignoring some second-order terms and parameters), We show this is optimal up to logarithmic factors. We illustrate with improved algorithms for counting connected subgraphs and perfect matchings in a graph."}],"oa_version":"Published Version","volume":261,"publication_identifier":{"isbn":["9783959772785"],"issn":["1868-8969"]},"publication_status":"published","file":[{"file_name":"2023_LIPIcsICALP_Harris.pdf","date_created":"2023-08-21T06:45:16Z","creator":"dernst","file_size":917791,"date_updated":"2023-08-21T06:45:16Z","success":1,"checksum":"6dee0684245bb1c524b9c955db1e933d","file_id":"14088","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"article_number":"72","author":[{"first_name":"David G.","full_name":"Harris, David G.","last_name":"Harris"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"external_id":{"arxiv":["2007.10824"]},"article_processing_charge":"Yes","title":"Parameter estimation for Gibbs distributions","citation":{"mla":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.","apa":"Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72","ama":"Harris DG, Kolmogorov V. Parameter estimation for Gibbs distributions. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.72","short":"D.G. Harris, V. Kolmogorov, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"D. G. Harris and V. Kolmogorov, “Parameter estimation for Gibbs distributions,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","chicago":"Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.72.","ista":"Harris DG, Kolmogorov V. 2023. Parameter estimation for Gibbs distributions. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 72."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"We thank Heng Guo for helpful explanations of algorithms for sampling connected subgraphs and matchings, Maksym Serbyn for bringing to our attention the Wang-Landau algorithm and its use in physics.","date_published":"2023-07-01T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2023.72","date_created":"2023-08-20T22:01:14Z","has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming"},{"date_updated":"2023-08-21T07:05:47Z","ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2023-08-21T07:04:36Z","_id":"14086","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Paderborn, Germany","end_date":"2023-07-14","start_date":"2023-07-10"},"status":"public","publication_identifier":{"isbn":["9783959772785"],"issn":["18688969"]},"publication_status":"published","file":[{"success":1,"file_id":"14090","checksum":"a5eef225014e003efbfbe4830fdd23cb","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_LIPIcsICALP_HenzingerM.pdf","date_created":"2023-08-21T07:04:36Z","creator":"dernst","file_size":930943,"date_updated":"2023-08-21T07:04:36Z"}],"language":[{"iso":"eng"}],"volume":261,"ec_funded":1,"abstract":[{"text":"The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint has been investigated extensively due to its algorithmic properties and expressive power. Though tight approximation algorithms for general matroid constraints exist in theory, the running times of such algorithms typically scale quadratically, and are not practical for truly large scale settings. Recent progress has focused on fast algorithms for important classes of matroids given in explicit form. Currently, nearly-linear time algorithms only exist for graphic and partition matroids [Alina Ene and Huy L. Nguyen, 2019]. In this work, we develop algorithms for monotone submodular maximization constrained by graphic, transversal matroids, or laminar matroids in time near-linear in the size of their representation. Our algorithms achieve an optimal approximation of 1-1/e-ε and both generalize and accelerate the results of Ene and Nguyen [Alina Ene and Huy L. Nguyen, 2019]. In fact, the running time of our algorithm cannot be improved within the fast continuous greedy framework of Badanidiyuru and Vondrák [Ashwinkumar Badanidiyuru and Jan Vondrák, 2014].\r\nTo achieve near-linear running time, we make use of dynamic data structures that maintain bases with approximate maximum cardinality and weight under certain element updates. These data structures need to support a weight decrease operation and a novel Freeze operation that allows the algorithm to freeze elements (i.e. force to be contained) in its basis regardless of future data structure operations. For the laminar matroid, we present a new dynamic data structure using the top tree interface of Alstrup, Holm, de Lichtenberg, and Thorup [Stephen Alstrup et al., 2005] that maintains the maximum weight basis under insertions and deletions of elements in O(log n) time. This data structure needs to support certain subtree query and path update operations that are performed every insertion and deletion that are non-trivial to handle in conjunction. For the transversal matroid the Freeze operation corresponds to requiring the data structure to keep a certain set S of vertices matched, a property that we call S-stability. While there is a large body of work on dynamic matching algorithms, none are S-stable and maintain an approximate maximum weight matching under vertex updates. We give the first such algorithm for bipartite graphs with total running time linear (up to log factors) in the number of edges.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","month":"07","intvolume":" 261","citation":{"ista":"Henzinger MH, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 74.","chicago":"Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.","ama":"Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74","apa":"Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74","short":"M.H. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","mla":"Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Liu, Paul","last_name":"Liu","first_name":"Paul"},{"last_name":"Vondrák","full_name":"Vondrák, Jan","first_name":"Jan"},{"first_name":"Da Wei","last_name":"Zheng","full_name":"Zheng, Da Wei"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2305.00122"]},"title":"Faster submodular maximization for several classes of matroids","article_number":"74","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775 ","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"has_accepted_license":"1","year":"2023","day":"01","publication":"50th International Colloquium on Automata, Languages, and Programming","doi":"10.4230/LIPIcs.ICALP.2023.74","date_published":"2023-07-01T00:00:00Z","date_created":"2023-08-20T22:01:14Z","acknowledgement":" Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Jan Vondrák: Supported by NSF Award 2127781.","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1}]