[{"author":[{"full_name":"Moussa, Hagar F.","first_name":"Hagar F.","last_name":"Moussa"},{"full_name":"Bsteh, Daniel","first_name":"Daniel","last_name":"Bsteh"},{"last_name":"Yelagandula","full_name":"Yelagandula, Ramesh","first_name":"Ramesh"},{"last_name":"Pribitzer","full_name":"Pribitzer, Carina","first_name":"Carina"},{"last_name":"Stecher","first_name":"Karin","full_name":"Stecher, Karin"},{"id":"4D883232-F248-11E8-B48F-1D18A9856A87","first_name":"Katarina","full_name":"Bartalska, Katarina","last_name":"Bartalska"},{"last_name":"Michetti","first_name":"Luca","full_name":"Michetti, Luca"},{"last_name":"Wang","first_name":"Jingkui","full_name":"Wang, Jingkui"},{"first_name":"Jorge A.","full_name":"Zepeda-Martinez, Jorge A.","last_name":"Zepeda-Martinez"},{"last_name":"Elling","first_name":"Ulrich","full_name":"Elling, Ulrich"},{"first_name":"Jacob I.","full_name":"Stuckey, Jacob I.","last_name":"Stuckey"},{"last_name":"James","full_name":"James, Lindsey I.","first_name":"Lindsey I."},{"last_name":"Frye","first_name":"Stephen V.","full_name":"Frye, Stephen V."},{"last_name":"Bell","first_name":"Oliver","full_name":"Bell, Oliver"}],"year":"2019","publication_status":"published","article_number":"1931","quality_controlled":"1","scopus_import":"1","department":[{"_id":"SaSi"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:29Z","language":[{"iso":"eng"}],"_id":"6412","date_published":"2019-04-29T00:00:00Z","issue":"1","citation":{"ieee":"H. F. Moussa <i>et al.</i>, “Canonical PRC1 controls sequence-independent propagation of Polycomb-mediated gene silencing,” <i>Nature Communications</i>, vol. 10, no. 1. Springer Nature, 2019.","apa":"Moussa, H. F., Bsteh, D., Yelagandula, R., Pribitzer, C., Stecher, K., Bartalska, K., … Bell, O. (2019). Canonical PRC1 controls sequence-independent propagation of Polycomb-mediated gene silencing. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-019-09628-6\">https://doi.org/10.1038/s41467-019-09628-6</a>","mla":"Moussa, Hagar F., et al. “Canonical PRC1 Controls Sequence-Independent Propagation of Polycomb-Mediated Gene Silencing.” <i>Nature Communications</i>, vol. 10, no. 1, 1931, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s41467-019-09628-6\">10.1038/s41467-019-09628-6</a>.","chicago":"Moussa, Hagar F., Daniel Bsteh, Ramesh Yelagandula, Carina Pribitzer, Karin Stecher, Katarina Bartalska, Luca Michetti, et al. “Canonical PRC1 Controls Sequence-Independent Propagation of Polycomb-Mediated Gene Silencing.” <i>Nature Communications</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41467-019-09628-6\">https://doi.org/10.1038/s41467-019-09628-6</a>.","short":"H.F. Moussa, D. Bsteh, R. Yelagandula, C. Pribitzer, K. Stecher, K. Bartalska, L. Michetti, J. Wang, J.A. Zepeda-Martinez, U. Elling, J.I. Stuckey, L.I. James, S.V. Frye, O. Bell, Nature Communications 10 (2019).","ama":"Moussa HF, Bsteh D, Yelagandula R, et al. Canonical PRC1 controls sequence-independent propagation of Polycomb-mediated gene silencing. <i>Nature Communications</i>. 2019;10(1). doi:<a href=\"https://doi.org/10.1038/s41467-019-09628-6\">10.1038/s41467-019-09628-6</a>","ista":"Moussa HF, Bsteh D, Yelagandula R, Pribitzer C, Stecher K, Bartalska K, Michetti L, Wang J, Zepeda-Martinez JA, Elling U, Stuckey JI, James LI, Frye SV, Bell O. 2019. Canonical PRC1 controls sequence-independent propagation of Polycomb-mediated gene silencing. Nature Communications. 10(1), 1931."},"abstract":[{"lang":"eng","text":"Polycomb group (PcG) proteins play critical roles in the epigenetic inheritance of cell fate. The Polycomb Repressive Complexes PRC1 and PRC2 catalyse distinct chromatin modifications to enforce gene silencing, but how transcriptional repression is propagated through mitotic cell divisions remains a key unresolved question. Using reversible tethering of PcG proteins to ectopic sites in mouse embryonic stem cells, here we show that PRC1 can trigger transcriptional repression and Polycomb-dependent chromatin modifications. We find that canonical PRC1 (cPRC1), but not variant PRC1, maintains gene silencing through cell division upon reversal of tethering. Propagation of gene repression is sustained by cis-acting histone modifications, PRC2-mediated H3K27me3 and cPRC1-mediated H2AK119ub1, promoting a sequence-independent feedback mechanism for PcG protein recruitment. Thus, the distinct PRC1 complexes present in vertebrates can differentially regulate epigenetic maintenance of gene silencing, potentially enabling dynamic heritable responses to complex stimuli. Our findings reveal how PcG repression is potentially inherited in vertebrates."}],"date_updated":"2026-04-03T09:38:23Z","publication_identifier":{"eissn":["2041-1723"]},"publication":"Nature Communications","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"journal_article","volume":10,"oa_version":"Published Version","oa":1,"license":"https://creativecommons.org/licenses/by/4.0/","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"29","doi":"10.1038/s41467-019-09628-6","ddc":["570"],"has_accepted_license":"1","fulldoi":"https://doi.org/10.1038/s41467-019-09628-6","external_id":{"isi":["000466118700002"]},"file":[{"relation":"main_file","file_name":"2019_NatureComm_Moussa.pdf","content_type":"application/pdf","file_size":1223647,"checksum":"6550a328335396c856db4cbdda7d2994","file_id":"6448","date_created":"2019-05-14T08:45:51Z","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:47:29Z"}],"intvolume":"        10","title":"Canonical PRC1 controls sequence-independent propagation of Polycomb-mediated gene silencing","month":"04","date_created":"2019-05-13T07:58:35Z","publisher":"Springer Nature","isi":1,"status":"public"},{"type":"conference","volume":61,"oa_version":"Published Version","ddc":["000"],"doi":"10.29007/m75b","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"day":"25","intvolume":"        61","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","has_accepted_license":"1","fulldoi":"https://doi.org/10.29007/m75b","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:48:00Z","creator":"dernst","date_created":"2020-03-24T07:36:36Z","file_id":"7617","checksum":"9138977a06fcd6a95976eb4bca875f0c","file_size":1934830,"content_type":"application/pdf","relation":"main_file","file_name":"2019_ARCH19_Immler.pdf"}],"month":"05","status":"public","date_created":"2020-03-08T23:00:49Z","publisher":"EasyChair","year":"2019","author":[{"last_name":"Immler","full_name":"Immler, Fabian","first_name":"Fabian"},{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"last_name":"Benet","full_name":"Benet, Luis","first_name":"Luis"},{"first_name":"Alexandre","full_name":"Chapoutot, Alexandre","last_name":"Chapoutot"},{"full_name":"Chen, Xin","first_name":"Xin","last_name":"Chen"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"last_name":"Geretti","first_name":"Luca","full_name":"Geretti, Luca"},{"last_name":"Kochdumper","full_name":"Kochdumper, Niklas","first_name":"Niklas"},{"full_name":"Sanders, David P.","first_name":"David P.","last_name":"Sanders"},{"orcid":"0000-0003-3658-1065","last_name":"Schilling","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian"}],"page":"41-61","publication_status":"published","article_processing_charge":"No","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:48:00Z","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15","location":"Montreal, Canada","end_date":"2019-04-15"},"quality_controlled":"1","scopus_import":"1","language":[{"iso":"eng"}],"_id":"7576","date_published":"2019-05-25T00:00:00Z","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"corr_author":"1","citation":{"short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2019, pp. 41–61.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair; 2019:41-61. doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 61:41–61. EasyChair, 2019. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>","ieee":"F. Immler <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 41–61.","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair, 2019, pp. 41–61, doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>."},"date_updated":"2026-04-03T09:51:13Z","publication_identifier":{"eissn":["2398-7340"]},"publication":"EPiC Series in Computing"},{"publisher":"Elsevier","date_created":"2020-08-10T11:50:54Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.waojou.2019.100044"}],"fulldoi":"https://doi.org/10.1016/j.waojou.2019.100044","title":"AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice","intvolume":"        12","month":"07","oa_version":"Published Version","volume":12,"extern":"1","day":"29","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.waojou.2019.100044","type":"journal_article","issue":"7","publication_identifier":{"issn":["1939-4551"]},"date_updated":"2021-01-12T08:17:36Z","citation":{"mla":"Singer, Josef, et al. “AllergoOncology: High Innate IgE Levels Are Decisive for the Survival of Cancer-Bearing Mice.” <i>World Allergy Organization Journal</i>, vol. 12, no. 7, 100044, Elsevier, 2019, doi:<a href=\"https://doi.org/10.1016/j.waojou.2019.100044\">10.1016/j.waojou.2019.100044</a>.","ieee":"J. Singer <i>et al.</i>, “AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice,” <i>World Allergy Organization Journal</i>, vol. 12, no. 7. Elsevier, 2019.","apa":"Singer, J., Achatz-Straussberger, G., Bentley-Lukschal, A., Singer, J., Achatz, G., Karagiannis, S. N., &#38; Jensen-Jarolim, E. (2019). AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. <i>World Allergy Organization Journal</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.waojou.2019.100044\">https://doi.org/10.1016/j.waojou.2019.100044</a>","chicago":"Singer, Josef, Gertrude Achatz-Straussberger, Anna Bentley-Lukschal, Judit Singer, Gernot Achatz, Sophia N. Karagiannis, and Erika Jensen-Jarolim. “AllergoOncology: High Innate IgE Levels Are Decisive for the Survival of Cancer-Bearing Mice.” <i>World Allergy Organization Journal</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.waojou.2019.100044\">https://doi.org/10.1016/j.waojou.2019.100044</a>.","ista":"Singer J, Achatz-Straussberger G, Bentley-Lukschal A, Singer J, Achatz G, Karagiannis SN, Jensen-Jarolim E. 2019. AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. World Allergy Organization Journal. 12(7), 100044.","ama":"Singer J, Achatz-Straussberger G, Bentley-Lukschal A, et al. AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. <i>World Allergy Organization Journal</i>. 2019;12(7). doi:<a href=\"https://doi.org/10.1016/j.waojou.2019.100044\">10.1016/j.waojou.2019.100044</a>","short":"J. Singer, G. Achatz-Straussberger, A. Bentley-Lukschal, J. Singer, G. Achatz, S.N. Karagiannis, E. Jensen-Jarolim, World Allergy Organization Journal 12 (2019)."},"article_type":"original","abstract":[{"lang":"eng","text":"Background: Atopics have a lower risk for malignancies, and IgE targeted to tumors is superior to IgG in fighting cancer. Whether IgE-mediated innate or adaptive immune surveillance can confer protection against tumors remains unclear.\r\nObjective: We aimed to investigate the effects of active and passive immunotherapy to the tumor-associated antigen HER-2 in three murine models differing in Epsilon-B-cell-receptor expression affecting the levels of expressed IgE.\r\nMethods: We compared the levels of several serum specific anti-HER-2 antibodies (IgE, IgG1, IgG2a, IgG2b, IgA) and the survival rates in low-IgE ΔM1M2 mice lacking the transmembrane/cytoplasmic domain of Epsilon-B-cell-receptors expressing reduced IgE levels, high-IgE KN1 mice expressing chimeric Epsilon-Gamma1-B-cell receptors with 4-6-fold elevated serum IgE levels, and wild type (WT) BALB/c. Prior engrafting mice with D2F2/E2 mammary tumors overexpressing HER-2, mice were vaccinated with HER-2 or vehicle control PBS using the Th2-adjuvant Al(OH)3 (active immunotherapy), or treated with the murine anti-HER-2 IgG1 antibody 4D5 (passive immunotherapy).\r\nResults: Overall, among the three strains of mice, HER-2 vaccination induced significantly higher levels of HER-2 specific IgE and IgG1 in high-IgE KN1, while low-IgE ΔM1M2 mice had higher IgG2a levels. HER-2 vaccination and passive immunotherapy prolonged the survival in tumor-grafted WT and low-IgE ΔM1M2 strains compared with treatment controls; active vaccination provided the highest benefit. Notably, untreated high-IgE KN1 mice displayed the longest survival of all strains, which could not be further extended by active or passive immunotherapy.\r\nConclusion: Active and passive immunotherapies prolong survival in wild type and low-IgE ΔM1M2 mice engrafted with mammary tumors. High-IgE KN1 mice have an innate survival benefit following tumor challenge."}],"publication":"World Allergy Organization Journal","_id":"8228","language":[{"iso":"eng"}],"date_published":"2019-07-29T00:00:00Z","publication_status":"published","quality_controlled":"1","article_number":"100044","article_processing_charge":"No","author":[{"full_name":"Singer, Josef","first_name":"Josef","last_name":"Singer","orcid":"0000-0002-8701-2412"},{"last_name":"Achatz-Straussberger","full_name":"Achatz-Straussberger, Gertrude","first_name":"Gertrude"},{"last_name":"Bentley-Lukschal","first_name":"Anna","full_name":"Bentley-Lukschal, Anna"},{"last_name":"Fazekas-Singer","orcid":"0000-0002-8777-3502","full_name":"Fazekas-Singer, Judit","first_name":"Judit","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Achatz, Gernot","first_name":"Gernot","last_name":"Achatz"},{"last_name":"Karagiannis","full_name":"Karagiannis, Sophia N.","first_name":"Sophia N."},{"last_name":"Jensen-Jarolim","first_name":"Erika","full_name":"Jensen-Jarolim, Erika"}],"year":"2019"},{"author":[{"orcid":"0000-0003-0120-9319","last_name":"Shelyakin","full_name":"Shelyakin, Pavel V.","first_name":"Pavel V."},{"last_name":"Bochkareva","orcid":"0000-0003-1006-6639","full_name":"Bochkareva, Olga","first_name":"Olga","id":"C4558D3C-6102-11E9-A62E-F418E6697425"},{"last_name":"Karan","full_name":"Karan, Anna A.","first_name":"Anna A."},{"full_name":"Gelfand, Mikhail S.","first_name":"Mikhail S.","last_name":"Gelfand"}],"year":"2019","publication_status":"published","article_number":"83","quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"8263","date_published":"2019-03-27T00:00:00Z","abstract":[{"lang":"eng","text":"Background: The genus Streptococcus comprises pathogens that strongly influence the health of humans and animals. Genome sequencing of multiple Streptococcus strains demonstrated high variability in gene content and order even in closely related strains of the same species and created a newly emerged object for genomic analysis, the pan-genome. Here we analysed the genome evolution of 25 strains of Streptococcus suis, 50 strains of Streptococcus pyogenes and 28 strains of Streptococcus pneumoniae.\r\n\r\nResults: Fractions of the pan-genome, unique, periphery, and universal genes differ in size, functional composition, the level of nucleotide substitutions, and predisposition to horizontal gene transfer and genomic rearrangements. The density of substitutions in intergenic regions appears to be correlated with selection acting on adjacent genes, implying that more conserved genes tend to have more conserved regulatory regions.\r\nThe total pan-genome of the genus is open, but only due to strain-specific genes, whereas other pan-genome fractions reach saturation. We have identified the set of genes with phylogenies inconsistent with species and non-conserved location in the chromosome; these genes are rare in at least one species and have likely experienced recent horizontal transfer between species. The strain-specific fraction is enriched with mobile elements and hypothetical proteins, but also contains a number of candidate virulence-related genes, so it may have a strong impact on adaptability and pathogenicity.\r\nMapping the rearrangements to the phylogenetic tree revealed large parallel inversions in all species. A parallel inversion of length 15 kB with breakpoints formed by genes encoding surface antigen proteins PhtD and PhtB in S. pneumoniae leads to replacement of gene fragments that likely indicates the action of an antigen variation mechanism.\r\n\r\nConclusions: Members of genus Streptococcus have a highly dynamic, open pan-genome, that potentially confers them with the ability to adapt to changing environmental conditions, i.e. antibiotic resistance or transmission between different hosts. Hence, integrated analysis of all aspects of genome evolution is important for the identification of potential pathogens and design of drugs and vaccines."}],"article_type":"original","citation":{"mla":"Shelyakin, Pavel V., et al. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” <i>BMC Evolutionary Biology</i>, vol. 19, 83, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1186/s12862-019-1403-6\">10.1186/s12862-019-1403-6</a>.","apa":"Shelyakin, P. V., Bochkareva, O., Karan, A. A., &#38; Gelfand, M. S. (2019). Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. <i>BMC Evolutionary Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/s12862-019-1403-6\">https://doi.org/10.1186/s12862-019-1403-6</a>","ieee":"P. V. Shelyakin, O. Bochkareva, A. A. Karan, and M. S. Gelfand, “Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow,” <i>BMC Evolutionary Biology</i>, vol. 19. Springer Nature, 2019.","chicago":"Shelyakin, Pavel V., Olga Bochkareva, Anna A. Karan, and Mikhail S. Gelfand. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” <i>BMC Evolutionary Biology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1186/s12862-019-1403-6\">https://doi.org/10.1186/s12862-019-1403-6</a>.","ista":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. 2019. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. BMC Evolutionary Biology. 19, 83.","ama":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. <i>BMC Evolutionary Biology</i>. 2019;19. doi:<a href=\"https://doi.org/10.1186/s12862-019-1403-6\">10.1186/s12862-019-1403-6</a>","short":"P.V. Shelyakin, O. Bochkareva, A.A. Karan, M.S. Gelfand, BMC Evolutionary Biology 19 (2019)."},"date_updated":"2023-02-23T13:28:54Z","publication_identifier":{"issn":["1471-2148"]},"publication":"BMC Evolutionary Biology","type":"journal_article","volume":19,"extern":"1","oa_version":"Published Version","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"27","doi":"10.1186/s12862-019-1403-6","fulldoi":"https://doi.org/10.1186/s12862-019-1403-6","intvolume":"        19","title":"Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow","month":"03","date_created":"2020-08-15T11:04:07Z","publisher":"Springer Nature","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/s12862-019-1403-6"}]},{"oa_version":"Published Version","day":"09","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"article_processing_charge":"No","doi":"10.6084/m9.figshare.9411761.v1","department":[{"_id":"LifeSc"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"6819"}]},"author":[{"last_name":"Antoniou","full_name":"Antoniou, Michael N.","first_name":"Michael N."},{"full_name":"Nicolas, Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","first_name":"Armel","last_name":"Nicolas"},{"last_name":"Mesnage","first_name":"Robin","full_name":"Mesnage, Robin"},{"last_name":"Biserni","first_name":"Martina","full_name":"Biserni, Martina"},{"full_name":"Rao, Francesco V.","first_name":"Francesco V.","last_name":"Rao"},{"first_name":"Cristina Vazquez","full_name":"Martin, Cristina Vazquez","last_name":"Martin"}],"year":"2019","type":"research_data_reference","publisher":"Springer Nature","date_created":"2021-08-06T08:14:05Z","date_updated":"2023-02-23T12:52:29Z","status":"public","citation":{"chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature, 2019. <a href=\"https://doi.org/10.6084/m9.figshare.9411761.v1\">https://doi.org/10.6084/m9.figshare.9411761.v1</a>.","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.9411761.v1\">10.6084/m9.figshare.9411761.v1</a>.","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. 2019. doi:<a href=\"https://doi.org/10.6084/m9.figshare.9411761.v1\">10.6084/m9.figshare.9411761.v1</a>","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, (2019).","mla":"Antoniou, Michael N., et al. <i>MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells</i>. Springer Nature, 2019, doi:<a href=\"https://doi.org/10.6084/m9.figshare.9411761.v1\">10.6084/m9.figshare.9411761.v1</a>.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., &#38; Martin, C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.9411761.v1\">https://doi.org/10.6084/m9.figshare.9411761.v1</a>","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells.” Springer Nature, 2019."},"abstract":[{"lang":"eng","text":"Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.9411761.v1"}],"_id":"9784","fulldoi":"https://doi.org/10.6084/m9.figshare.9411761.v1","title":"MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","month":"08","date_published":"2019-08-09T00:00:00Z"},{"abstract":[{"lang":"eng","text":"The spread of adaptive alleles is fundamental to evolution, and in theory, this process is well‐understood. However, only rarely can we follow this process—whether it originates from the spread of a new mutation, or by introgression from another population. In this issue of Molecular Ecology, Hanemaaijer et al. (2018) report on a 25‐year long study of the mosquitoes Anopheles gambiae (Figure 1) and Anopheles coluzzi in Mali, based on genotypes at 15 single‐nucleotide polymorphism (SNP). The species are usually reproductively isolated from each other, but in 2002 and 2006, bursts of hybridization were observed, when F1 hybrids became abundant. Alleles backcrossed from A. gambiae into A. coluzzi, but after the first event, these declined over the following years. In contrast, after 2006, an insecticide resistance allele that had established in A. gambiae spread into A. coluzzi, and rose to high frequency there, over 6 years (~75 generations). Whole genome sequences of 74 individuals showed that A. gambiae SNP from across the genome had become common in the A. coluzzi population, but that most of these were clustered in 34 genes around the resistance locus. A new set of SNP from 25 of these genes were assayed over time; over the 4 years since near‐fixation of the resistance allele; some remained common, whereas others declined. What do these patterns tell us about this introgression event?"}],"citation":{"apa":"Barton, N. H. (2019). Data from: The consequences of an introgression event. Dryad. <a href=\"https://doi.org/10.5061/dryad.2kb6fh4\">https://doi.org/10.5061/dryad.2kb6fh4</a>","ieee":"N. H. Barton, “Data from: The consequences of an introgression event.” Dryad, 2019.","mla":"Barton, Nicholas H. <i>Data from: The Consequences of an Introgression Event</i>. Dryad, 2019, doi:<a href=\"https://doi.org/10.5061/dryad.2kb6fh4\">10.5061/dryad.2kb6fh4</a>.","chicago":"Barton, Nicholas H. “Data from: The Consequences of an Introgression Event.” Dryad, 2019. <a href=\"https://doi.org/10.5061/dryad.2kb6fh4\">https://doi.org/10.5061/dryad.2kb6fh4</a>.","short":"N.H. Barton, (2019).","ama":"Barton NH. Data from: The consequences of an introgression event. 2019. doi:<a href=\"https://doi.org/10.5061/dryad.2kb6fh4\">10.5061/dryad.2kb6fh4</a>","ista":"Barton NH. 2019. Data from: The consequences of an introgression event, Dryad, <a href=\"https://doi.org/10.5061/dryad.2kb6fh4\">10.5061/dryad.2kb6fh4</a>."},"status":"public","date_updated":"2025-07-10T11:52:34Z","date_created":"2021-08-06T12:03:50Z","publisher":"Dryad","main_file_link":[{"url":"https://doi.org/10.5061/dryad.2kb6fh4","open_access":"1"}],"title":"Data from: The consequences of an introgression event","fulldoi":"https://doi.org/10.5061/dryad.2kb6fh4","_id":"9805","date_published":"2019-01-09T00:00:00Z","month":"01","oa_version":"Published Version","department":[{"_id":"NiBa"}],"article_processing_charge":"No","doi":"10.5061/dryad.2kb6fh4","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"day":"09","year":"2019","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"related_material":{"record":[{"status":"public","id":"40","relation":"used_in_publication"}]},"type":"research_data_reference"},{"related_material":{"record":[{"relation":"research_data","id":"9784","status":"public"}]},"type":"journal_article","oa_version":"Published Version","volume":12,"doi":"10.1186/s13104-019-4534-3","ddc":["570"],"day":"08","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","intvolume":"        12","file":[{"date_updated":"2020-07-14T12:47:40Z","creator":"dernst","access_level":"open_access","date_created":"2019-08-23T11:10:35Z","file_id":"6829","checksum":"4a2bb7994b7f2c432bf44f5127ea3102","content_type":"application/pdf","file_size":1177482,"file_name":"2019_BMC_Antoniou.pdf","relation":"main_file"}],"has_accepted_license":"1","fulldoi":"https://doi.org/10.1186/s13104-019-4534-3","external_id":{"pmid":["31395095"]},"month":"08","status":"public","publisher":"BioMed Central","date_created":"2019-08-18T22:00:39Z","pmid":1,"year":"2019","author":[{"first_name":"Michael N.","full_name":"Antoniou, Michael N.","last_name":"Antoniou"},{"last_name":"Nicolas","first_name":"Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","full_name":"Nicolas, Armel"},{"last_name":"Mesnage","first_name":"Robin","full_name":"Mesnage, Robin"},{"last_name":"Biserni","first_name":"Martina","full_name":"Biserni, Martina"},{"last_name":"Rao","full_name":"Rao, Francesco V.","first_name":"Francesco V."},{"first_name":"Cristina Vazquez","full_name":"Martin, Cristina Vazquez","last_name":"Martin"}],"publication_status":"published","file_date_updated":"2020-07-14T12:47:40Z","department":[{"_id":"LifeSc"}],"article_processing_charge":"No","quality_controlled":"1","scopus_import":1,"article_number":"494","_id":"6819","language":[{"iso":"eng"}],"date_published":"2019-08-08T00:00:00Z","date_updated":"2023-02-23T14:08:14Z","publication_identifier":{"eissn":["1756-0500"]},"abstract":[{"lang":"eng","text":"Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome."}],"citation":{"apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., &#38; Martin, C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. <i>BMC Research Notes</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s13104-019-4534-3\">https://doi.org/10.1186/s13104-019-4534-3</a>","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells,” <i>BMC Research Notes</i>, vol. 12. BioMed Central, 2019.","mla":"Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” <i>BMC Research Notes</i>, vol. 12, 494, BioMed Central, 2019, doi:<a href=\"https://doi.org/10.1186/s13104-019-4534-3\">10.1186/s13104-019-4534-3</a>.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, BMC Research Notes 12 (2019).","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. <i>BMC Research Notes</i>. 2019;12. doi:<a href=\"https://doi.org/10.1186/s13104-019-4534-3\">10.1186/s13104-019-4534-3</a>","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 12, 494.","chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” <i>BMC Research Notes</i>. BioMed Central, 2019. <a href=\"https://doi.org/10.1186/s13104-019-4534-3\">https://doi.org/10.1186/s13104-019-4534-3</a>."},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"publication":"BMC Research Notes"},{"oa_version":"Preprint","doi":"10.1145/3293611.3331633","day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"related_material":{"record":[{"id":"7939","relation":"later_version","status":"public"}]},"type":"conference","status":"public","publisher":"ACM","isi":1,"date_created":"2019-10-08T12:48:42Z","main_file_link":[{"url":"https://arxiv.org/abs/1903.05956","open_access":"1"}],"title":"Fast approximate shortest paths in the congested clique","fulldoi":"https://doi.org/10.1145/3293611.3331633","external_id":{"arxiv":["1903.05956"],"isi":["000570442000011"]},"month":"08","publication_status":"published","department":[{"_id":"DaAl"}],"article_processing_charge":"No","quality_controlled":"1","scopus_import":"1","conference":{"name":"PODC: Symposium on Principles of Distributed Computing","start_date":"2019-07-29","location":"Toronto, ON, Canada","end_date":"2019-08-02"},"year":"2019","author":[{"last_name":"Censor-Hillel","first_name":"Keren","full_name":"Censor-Hillel, Keren"},{"first_name":"Michal","full_name":"Dory, Michal","last_name":"Dory"},{"last_name":"Korhonen","full_name":"Korhonen, Janne","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"first_name":"Dean","full_name":"Leitersdorf, Dean","last_name":"Leitersdorf"}],"page":"74-83","publication_identifier":{"isbn":["9781450362177"]},"date_updated":"2026-06-18T19:28:41Z","abstract":[{"text":"We design fast deterministic algorithms for distance computation in the CONGESTED CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds.","lang":"eng"}],"citation":{"ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, Toronto, ON, Canada, 2019, pp. 74–83.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i> (pp. 74–83). Toronto, ON, Canada: ACM. <a href=\"https://doi.org/10.1145/3293611.3331633\">https://doi.org/10.1145/3293611.3331633</a>","mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, ACM, 2019, pp. 74–83, doi:<a href=\"https://doi.org/10.1145/3293611.3331633\">10.1145/3293611.3331633</a>.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>, 74–83. ACM, 2019. <a href=\"https://doi.org/10.1145/3293611.3331633\">https://doi.org/10.1145/3293611.3331633</a>.","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin</i>. ACM; 2019:74-83. doi:<a href=\"https://doi.org/10.1145/3293611.3331633\">10.1145/3293611.3331633</a>","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83.","ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83."},"publication":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin","_id":"6933","language":[{"iso":"eng"}],"date_published":"2019-08-01T00:00:00Z","arxiv":1},{"language":[{"iso":"ger"}],"fulldoi":"https://doi.org/10.1007/978-3-658-26763-6","_id":"7171","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","month":"10","edition":"1","date_published":"2019-10-30T00:00:00Z","date_created":"2019-12-11T14:15:56Z","publisher":"Springer Nature","abstract":[{"text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!","lang":"ger"}],"citation":{"chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","ama":"Kersting K, Lampert C, Rothkopf C, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>, 1st ed. Wiesbaden: Springer Nature, 2019.","apa":"Kersting, K., Lampert, C., &#38; Rothkopf, C. (Eds.). (2019). <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i> (1st ed.). Wiesbaden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>","mla":"Kersting, Kristian, et al., editors. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed., Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>."},"publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"status":"public","date_updated":"2021-12-22T14:40:58Z","editor":[{"first_name":"Kristian","full_name":"Kersting, Kristian","last_name":"Kersting"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"last_name":"Rothkopf","full_name":"Rothkopf, Constantin","first_name":"Constantin"}],"related_material":{"link":[{"relation":"press_release","description":"News on IST Website","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/"}]},"year":"2019","page":"XIV, 245","type":"book_editor","publication_status":"published","oa_version":"None","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"30","quality_controlled":"1","place":"Wiesbaden","department":[{"_id":"ChLa"}],"article_processing_charge":"No","doi":"10.1007/978-3-658-26763-6"},{"page":"1466-1470","author":[{"last_name":"Garriga","first_name":"Edgar","full_name":"Garriga, Edgar"},{"last_name":"Di Tommaso","full_name":"Di Tommaso, Paolo","first_name":"Paolo"},{"last_name":"Magis","full_name":"Magis, Cedrik","first_name":"Cedrik"},{"last_name":"Erb","full_name":"Erb, Ionas","first_name":"Ionas"},{"last_name":"Mansouri","full_name":"Mansouri, Leila","first_name":"Leila"},{"first_name":"Athanasios","full_name":"Baltzis, Athanasios","last_name":"Baltzis"},{"last_name":"Laayouni","first_name":"Hafid","full_name":"Laayouni, Hafid"},{"orcid":"0000-0001-8243-4694","last_name":"Kondrashov","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"},{"first_name":"Evan","full_name":"Floden, Evan","last_name":"Floden"},{"first_name":"Cedric","full_name":"Notredame, Cedric","last_name":"Notredame"}],"year":"2019","quality_controlled":"1","scopus_import":"1","department":[{"_id":"FyKo"}],"article_processing_charge":"No","publication_status":"published","date_published":"2019-12-01T00:00:00Z","_id":"7181","language":[{"iso":"eng"}],"publication":"Nature Biotechnology","issue":"12","date_updated":"2025-07-10T11:54:19Z","publication_identifier":{"eissn":["1546-1696"],"issn":["1087-0156"]},"abstract":[{"text":"Multiple sequence alignments (MSAs) are used for structural1,2 and evolutionary predictions1,2, but the complexity of aligning large datasets requires the use of approximate solutions3, including the progressive algorithm4. Progressive MSA methods start by aligning the most similar sequences and subsequently incorporate the remaining sequences, from leaf-to-root, based on a guide-tree. Their accuracy declines substantially as the number of sequences is scaled up5. We introduce a regressive algorithm that enables MSA of up to 1.4 million sequences on a standard workstation and substantially improves accuracy on datasets larger than 10,000 sequences. Our regressive algorithm works the other way around to the progressive algorithm and begins by aligning the most dissimilar sequences. It uses an efficient divide-and-conquer strategy to run third-party alignment methods in linear time, regardless of their original complexity. Our approach will enable analyses of extremely large genomic datasets such as the recently announced Earth BioGenome Project, which comprises 1.5 million eukaryotic genomes6.","lang":"eng"}],"article_type":"original","citation":{"chicago":"Garriga, Edgar, Paolo Di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>.","short":"E. Garriga, P. Di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, Nature Biotechnology 37 (2019) 1466–1470.","ama":"Garriga E, Di Tommaso P, Magis C, et al. Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. 2019;37(12):1466-1470. doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>","ista":"Garriga E, Di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2019. Large multiple sequence alignments with a root-to-leaf regressive method. Nature Biotechnology. 37(12), 1466–1470.","ieee":"E. Garriga <i>et al.</i>, “Large multiple sequence alignments with a root-to-leaf regressive method,” <i>Nature Biotechnology</i>, vol. 37, no. 12. Springer Nature, pp. 1466–1470, 2019.","apa":"Garriga, E., Di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2019). Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>","mla":"Garriga, Edgar, et al. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>, vol. 37, no. 12, Springer Nature, 2019, pp. 1466–70, doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>."},"type":"journal_article","related_material":{"record":[{"relation":"research_data","id":"13059","status":"public"}]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"doi":"10.1038/s41587-019-0333-6","oa_version":"Submitted Version","volume":37,"ec_funded":1,"month":"12","project":[{"grant_number":"771209","call_identifier":"H2020","name":"Characterizing the fitness landscape on population and global scales","_id":"26580278-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000500748900021"],"pmid":["31792410"]},"fulldoi":"https://doi.org/10.1038/s41587-019-0333-6","title":"Large multiple sequence alignments with a root-to-leaf regressive method","intvolume":"        37","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6894943/","open_access":"1"}],"pmid":1,"isi":1,"publisher":"Springer Nature","date_created":"2019-12-15T23:00:43Z","status":"public"},{"year":"2019","author":[{"last_name":"Erdem","full_name":"Erdem, Fatma Asli","first_name":"Fatma Asli"},{"last_name":"Ilic","full_name":"Ilic, Marija","first_name":"Marija"},{"full_name":"Koppensteiner, Peter","first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3509-1948","last_name":"Koppensteiner"},{"first_name":"Jakub","full_name":"Gołacki, Jakub","last_name":"Gołacki"},{"last_name":"Lubec","first_name":"Gert","full_name":"Lubec, Gert"},{"last_name":"Freissmuth","full_name":"Freissmuth, Michael","first_name":"Michael"},{"first_name":"Walter","full_name":"Sandtner, Walter","last_name":"Sandtner"}],"page":"1035-1050","publication_status":"published","file_date_updated":"2020-07-14T12:47:57Z","article_processing_charge":"No","department":[{"_id":"RySh"}],"scopus_import":"1","quality_controlled":"1","_id":"7398","language":[{"iso":"eng"}],"date_published":"2019-07-03T00:00:00Z","date_updated":"2023-09-07T14:52:23Z","publication_identifier":{"eissn":["1540-7748"],"issn":["0022-1295"]},"citation":{"apa":"Erdem, F. A., Ilic, M., Koppensteiner, P., Gołacki, J., Lubec, G., Freissmuth, M., &#38; Sandtner, W. (2019). A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. <i>The Journal of General Physiology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1085/jgp.201912318\">https://doi.org/10.1085/jgp.201912318</a>","ieee":"F. A. Erdem <i>et al.</i>, “A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2,” <i>The Journal of General Physiology</i>, vol. 151, no. 8. Rockefeller University Press, pp. 1035–1050, 2019.","mla":"Erdem, Fatma Asli, et al. “A Comparison of the Transport Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” <i>The Journal of General Physiology</i>, vol. 151, no. 8, Rockefeller University Press, 2019, pp. 1035–50, doi:<a href=\"https://doi.org/10.1085/jgp.201912318\">10.1085/jgp.201912318</a>.","chicago":"Erdem, Fatma Asli, Marija Ilic, Peter Koppensteiner, Jakub Gołacki, Gert Lubec, Michael Freissmuth, and Walter Sandtner. “A Comparison of the Transport Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” <i>The Journal of General Physiology</i>. Rockefeller University Press, 2019. <a href=\"https://doi.org/10.1085/jgp.201912318\">https://doi.org/10.1085/jgp.201912318</a>.","ama":"Erdem FA, Ilic M, Koppensteiner P, et al. A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. <i>The Journal of General Physiology</i>. 2019;151(8):1035-1050. doi:<a href=\"https://doi.org/10.1085/jgp.201912318\">10.1085/jgp.201912318</a>","short":"F.A. Erdem, M. Ilic, P. Koppensteiner, J. Gołacki, G. Lubec, M. Freissmuth, W. Sandtner, The Journal of General Physiology 151 (2019) 1035–1050.","ista":"Erdem FA, Ilic M, Koppensteiner P, Gołacki J, Lubec G, Freissmuth M, Sandtner W. 2019. A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2. The Journal of General Physiology. 151(8), 1035–1050."},"abstract":[{"text":"Transporters of the solute carrier 6 (SLC6) family translocate their cognate substrate together with Na+ and Cl−. Detailed kinetic models exist for the transporters of GABA (GAT1/SLC6A1) and the monoamines dopamine (DAT/SLC6A3) and serotonin (SERT/SLC6A4). Here, we posited that the transport cycle of individual SLC6 transporters reflects the physiological requirements they operate under. We tested this hypothesis by analyzing the transport cycle of glycine transporter 1 (GlyT1/SLC6A9) and glycine transporter 2 (GlyT2/SLC6A5). GlyT2 is the only SLC6 family member known to translocate glycine, Na+, and Cl− in a 1:3:1 stoichiometry. We analyzed partial reactions in real time by electrophysiological recordings. Contrary to monoamine transporters, both GlyTs were found to have a high transport capacity driven by rapid return of the empty transporter after release of Cl− on the intracellular side. Rapid cycling of both GlyTs was further supported by highly cooperative binding of cosubstrate ions and substrate such that their forward transport mode was maintained even under conditions of elevated intracellular Na+ or Cl−. The most important differences in the transport cycle of GlyT1 and GlyT2 arose from the kinetics of charge movement and the resulting voltage-dependent rate-limiting reactions: the kinetics of GlyT1 were governed by transition of the substrate-bound transporter from outward- to inward-facing conformations, whereas the kinetics of GlyT2 were governed by Na+ binding (or a related conformational change). Kinetic modeling showed that the kinetics of GlyT1 are ideally suited for supplying the extracellular glycine levels required for NMDA receptor activation.","lang":"eng"}],"article_type":"original","issue":"8","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"publication":"The Journal of General Physiology","type":"journal_article","oa_version":"Published Version","volume":151,"doi":"10.1085/jgp.201912318","ddc":["570"],"day":"03","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A comparison of the transport kinetics of glycine transporter 1 and glycine transporter 2","intvolume":"       151","file":[{"file_size":2641297,"content_type":"application/pdf","relation":"main_file","file_name":"2019_JGP_Erdem.pdf","file_id":"7450","checksum":"5706b4ccd74ee3e50bf7ecb2a203df71","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:47:57Z","date_created":"2020-02-05T07:20:32Z"}],"has_accepted_license":"1","fulldoi":"https://doi.org/10.1085/jgp.201912318","external_id":{"pmid":["31270129"],"isi":["000478792500008"]},"month":"07","status":"public","isi":1,"publisher":"Rockefeller University Press","date_created":"2020-01-29T16:06:29Z","pmid":1},{"arxiv":1,"date_published":"2019-02-07T00:00:00Z","language":[{"iso":"eng"}],"_id":"7422","publication":"The Journal of Chemical Physics","citation":{"chicago":"Sokolowski, Thomas R, Joris Paijmans, Laurens Bossen, Thomas Miedema, Martijn Wehrens, Nils B. Becker, Kazunari Kaizu, Koichi Takahashi, Marileen Dogterom, and Pieter Rein ten Wolde. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2019. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>.","ama":"Sokolowski TR, Paijmans J, Bossen L, et al. eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. 2019;150(5). doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>","short":"T.R. Sokolowski, J. Paijmans, L. Bossen, T. Miedema, M. Wehrens, N.B. Becker, K. Kaizu, K. Takahashi, M. Dogterom, P.R. ten Wolde, The Journal of Chemical Physics 150 (2019).","ista":"Sokolowski TR, Paijmans J, Bossen L, Miedema T, Wehrens M, Becker NB, Kaizu K, Takahashi K, Dogterom M, ten Wolde PR. 2019. eGFRD in all dimensions. The Journal of Chemical Physics. 150(5), 054108.","ieee":"T. R. Sokolowski <i>et al.</i>, “eGFRD in all dimensions,” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5. AIP Publishing, 2019.","apa":"Sokolowski, T. R., Paijmans, J., Bossen, L., Miedema, T., Wehrens, M., Becker, N. B., … ten Wolde, P. R. (2019). eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>","mla":"Sokolowski, Thomas R., et al. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5, 054108, AIP Publishing, 2019, doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>."},"abstract":[{"text":"Biochemical reactions often occur at low copy numbers but at once in crowded and diverse environments. Space and stochasticity therefore play an essential role in biochemical networks. Spatial-stochastic simulations have become a prominent tool for understanding how stochasticity at the microscopic level influences the macroscopic behavior of such systems. While particle-based models guarantee the level of detail necessary to accurately describe the microscopic dynamics at very low copy numbers, the algorithms used to simulate them typically imply trade-offs between computational efficiency and biochemical accuracy. eGFRD (enhanced Green’s Function Reaction Dynamics) is an exact algorithm that evades such trade-offs by partitioning the N-particle system into M ≤ N analytically tractable one- and two-particle systems; the analytical solutions (Green’s functions) then are used to implement an event-driven particle-based scheme that allows particles to make large jumps in time and space while retaining access to their state variables at arbitrary simulation times. Here we present “eGFRD2,” a new eGFRD version that implements the principle of eGFRD in all dimensions, thus enabling efficient particle-based simulation of biochemical reaction-diffusion processes in the 3D cytoplasm, on 2D planes representing membranes, and on 1D elongated cylinders representative of, e.g., cytoskeletal tracks or DNA; in 1D, it also incorporates convective motion used to model active transport. We find that, for low particle densities, eGFRD2 is up to 6 orders of magnitude faster than conventional Brownian dynamics. We exemplify the capabilities of eGFRD2 by simulating an idealized model of Pom1 gradient formation, which involves 3D diffusion, active transport on microtubules, and autophosphorylation on the membrane, confirming recent experimental and theoretical results on this system to hold under genuinely stochastic conditions.","lang":"eng"}],"article_type":"original","date_updated":"2023-09-06T14:59:28Z","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"issue":"5","year":"2019","author":[{"last_name":"Sokolowski","orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas R","full_name":"Sokolowski, Thomas R"},{"last_name":"Paijmans","first_name":"Joris","full_name":"Paijmans, Joris"},{"last_name":"Bossen","full_name":"Bossen, Laurens","first_name":"Laurens"},{"last_name":"Miedema","first_name":"Thomas","full_name":"Miedema, Thomas"},{"last_name":"Wehrens","first_name":"Martijn","full_name":"Wehrens, Martijn"},{"full_name":"Becker, Nils B.","first_name":"Nils B.","last_name":"Becker"},{"last_name":"Kaizu","full_name":"Kaizu, Kazunari","first_name":"Kazunari"},{"full_name":"Takahashi, Koichi","first_name":"Koichi","last_name":"Takahashi"},{"last_name":"Dogterom","full_name":"Dogterom, Marileen","first_name":"Marileen"},{"last_name":"ten Wolde","first_name":"Pieter Rein","full_name":"ten Wolde, Pieter Rein"}],"department":[{"_id":"GaTk"}],"article_processing_charge":"No","article_number":"054108","quality_controlled":"1","publication_status":"published","month":"02","intvolume":"       150","title":"eGFRD in all dimensions","fulldoi":"https://doi.org/10.1063/1.5064867","external_id":{"isi":["000458109300009"],"arxiv":["1708.09364"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.09364"}],"status":"public","date_created":"2020-01-30T10:34:36Z","publisher":"AIP Publishing","isi":1,"type":"journal_article","doi":"10.1063/1.5064867","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"day":"07","volume":150,"oa_version":"Preprint"},{"oa_version":"Published Version","doi":"10.6084/m9.figshare.9808850.v1","department":[{"_id":"FyKo"}],"article_processing_charge":"No","day":"12","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"year":"2019","related_material":{"record":[{"status":"public","id":"6898","relation":"used_in_publication"}]},"author":[{"last_name":"Sigalova","first_name":"Olga M.","full_name":"Sigalova, Olga M."},{"last_name":"Chaplin","first_name":"Andrei V.","full_name":"Chaplin, Andrei V."},{"first_name":"Olga","id":"C4558D3C-6102-11E9-A62E-F418E6697425","full_name":"Bochkareva, Olga","orcid":"0000-0003-1006-6639","last_name":"Bochkareva"},{"last_name":"Shelyakin","first_name":"Pavel V.","full_name":"Shelyakin, Pavel V."},{"first_name":"Vsevolod A.","full_name":"Filaretov, Vsevolod A.","last_name":"Filaretov"},{"first_name":"Evgeny E.","full_name":"Akkuratov, Evgeny E.","last_name":"Akkuratov"},{"first_name":"Valentina","full_name":"Burskaia, Valentina","last_name":"Burskaia"},{"first_name":"Mikhail S.","full_name":"Gelfand, Mikhail S.","last_name":"Gelfand"}],"type":"research_data_reference","date_updated":"2026-04-03T09:39:41Z","status":"public","citation":{"ista":"Sigalova OM, Chaplin AV, Bochkareva O, Shelyakin PV, Filaretov VA, Akkuratov EE, Burskaia V, Gelfand MS. 2019. Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.9808850.v1\">10.6084/m9.figshare.9808850.v1</a>.","short":"O.M. Sigalova, A.V. Chaplin, O. Bochkareva, P.V. Shelyakin, V.A. Filaretov, E.E. Akkuratov, V. Burskaia, M.S. Gelfand, (2019).","ama":"Sigalova OM, Chaplin AV, Bochkareva O, et al. Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction. 2019. doi:<a href=\"https://doi.org/10.6084/m9.figshare.9808850.v1\">10.6084/m9.figshare.9808850.v1</a>","chicago":"Sigalova, Olga M., Andrei V. Chaplin, Olga Bochkareva, Pavel V. Shelyakin, Vsevolod A. Filaretov, Evgeny E. Akkuratov, Valentina Burskaia, and Mikhail S. Gelfand. “Additional File 20 of Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction.” Springer Nature, 2019. <a href=\"https://doi.org/10.6084/m9.figshare.9808850.v1\">https://doi.org/10.6084/m9.figshare.9808850.v1</a>.","mla":"Sigalova, Olga M., et al. <i>Additional File 20 of Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction</i>. Springer Nature, 2019, doi:<a href=\"https://doi.org/10.6084/m9.figshare.9808850.v1\">10.6084/m9.figshare.9808850.v1</a>.","ieee":"O. M. Sigalova <i>et al.</i>, “Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction.” Springer Nature, 2019.","apa":"Sigalova, O. M., Chaplin, A. V., Bochkareva, O., Shelyakin, P. V., Filaretov, V. A., Akkuratov, E. E., … Gelfand, M. S. (2019). Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.9808850.v1\">https://doi.org/10.6084/m9.figshare.9808850.v1</a>"},"abstract":[{"lang":"eng","text":"Frameshift and nonsense mutations near homopolymeric tracts of OG1 genes. Only 374 genes with typical length and domain composition were considered. (CSV 6 kb)"}],"publisher":"Springer Nature","date_created":"2021-08-12T07:58:15Z","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.9808850.v1","open_access":"1"}],"title":"Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction","_id":"9897","fulldoi":"https://doi.org/10.6084/m9.figshare.9808850.v1","date_published":"2019-09-12T00:00:00Z","month":"09"},{"scopus_import":"1","quality_controlled":"1","article_processing_charge":"Yes","publication_status":"published","page":"9998-10002","OA_place":"publisher","author":[{"last_name":"Fu","full_name":"Fu, Tianren","first_name":"Tianren"},{"last_name":"Smith","full_name":"Smith, Shanelle","first_name":"Shanelle"},{"full_name":"Camarasa-Gómez, María","first_name":"María","last_name":"Camarasa-Gómez"},{"last_name":"Yu","full_name":"Yu, Xiaofang","first_name":"Xiaofang"},{"first_name":"Jiayi","full_name":"Xue, Jiayi","last_name":"Xue"},{"last_name":"Nuckolls","full_name":"Nuckolls, Colin","first_name":"Colin"},{"full_name":"Evers, Ferdinand","first_name":"Ferdinand","last_name":"Evers"},{"id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","full_name":"Venkataraman, Latha","last_name":"Venkataraman","orcid":"0000-0002-6957-6089"},{"full_name":"Wei, Sujun","first_name":"Sujun","last_name":"Wei"}],"OA_type":"gold","year":"2019","publication":"Chemical Science","tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/3.0/legalcode","short":"CC BY-NC (3.0)"},"issue":"43","article_type":"original","abstract":[{"lang":"eng","text":"We demonstrate that imidazole based π–π stacked dimers form strong and efficient conductance pathways in single-molecule junctions using the scanning-tunneling microscope-break junction (STM-BJ) technique and density functional theory-based calculations. We first characterize an imidazole-gold contact by measuring the conductance of imidazolyl-terminated alkanes (im-N-im, N = 3–6). We show that the conductance of these alkanes decays exponentially with increasing length, indicating that the mechanism for electron transport is through tunneling or super-exchange. We also reveal that π–π stacked dimers can be formed between imidazoles and have better coupling than through-bond tunneling. These experimental results are rationalized by calculations of molecular junction transmission using non-equilibrium Green's function formalism. This study verifies the capability of imidazole as a Au-binding ligand to form stable single- and π-stacked molecule junctions at room temperature."}],"citation":{"mla":"Fu, Tianren, et al. “Enhanced Coupling through π-Stacking in Imidazole-Based Molecular Junctions.” <i>Chemical Science</i>, vol. 10, no. 43, Royal Society of Chemistry, 2019, pp. 9998–10002, doi:<a href=\"https://doi.org/10.1039/c9sc03760h\">10.1039/c9sc03760h</a>.","ieee":"T. Fu <i>et al.</i>, “Enhanced coupling through π-stacking in imidazole-based molecular junctions,” <i>Chemical Science</i>, vol. 10, no. 43. Royal Society of Chemistry, pp. 9998–10002, 2019.","apa":"Fu, T., Smith, S., Camarasa-Gómez, M., Yu, X., Xue, J., Nuckolls, C., … Wei, S. (2019). Enhanced coupling through π-stacking in imidazole-based molecular junctions. <i>Chemical Science</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c9sc03760h\">https://doi.org/10.1039/c9sc03760h</a>","ista":"Fu T, Smith S, Camarasa-Gómez M, Yu X, Xue J, Nuckolls C, Evers F, Venkataraman L, Wei S. 2019. Enhanced coupling through π-stacking in imidazole-based molecular junctions. Chemical Science. 10(43), 9998–10002.","short":"T. Fu, S. Smith, M. Camarasa-Gómez, X. Yu, J. Xue, C. Nuckolls, F. Evers, L. Venkataraman, S. Wei, Chemical Science 10 (2019) 9998–10002.","ama":"Fu T, Smith S, Camarasa-Gómez M, et al. Enhanced coupling through π-stacking in imidazole-based molecular junctions. <i>Chemical Science</i>. 2019;10(43):9998-10002. doi:<a href=\"https://doi.org/10.1039/c9sc03760h\">10.1039/c9sc03760h</a>","chicago":"Fu, Tianren, Shanelle Smith, María Camarasa-Gómez, Xiaofang Yu, Jiayi Xue, Colin Nuckolls, Ferdinand Evers, Latha Venkataraman, and Sujun Wei. “Enhanced Coupling through π-Stacking in Imidazole-Based Molecular Junctions.” <i>Chemical Science</i>. Royal Society of Chemistry, 2019. <a href=\"https://doi.org/10.1039/c9sc03760h\">https://doi.org/10.1039/c9sc03760h</a>."},"DOAJ_listed":"1","publication_identifier":{"eissn":["2041-6539"],"issn":["2041-6520"]},"date_updated":"2024-12-11T08:08:34Z","date_published":"2019-09-16T00:00:00Z","language":[{"iso":"eng"}],"_id":"17924","license":"https://creativecommons.org/licenses/by-nc/3.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"16","doi":"10.1039/c9sc03760h","volume":10,"extern":"1","oa_version":"Published Version","type":"journal_article","pmid":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/C9SC03760H"}],"date_created":"2024-09-09T07:49:24Z","publisher":"Royal Society of Chemistry","status":"public","month":"09","external_id":{"pmid":["32055356"]},"fulldoi":"https://doi.org/10.1039/c9sc03760h","intvolume":"        10","title":"Enhanced coupling through π-stacking in imidazole-based molecular junctions"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1707.09051","open_access":"1"}],"status":"public","date_created":"2026-06-19T08:13:26Z","publisher":"Informa UK Limited","month":"02","intvolume":"        44","title":"Almost sure scattering for the energy-critical NLS with radial data below H1(R4)","external_id":{"arxiv":["1707.09051"]},"fulldoi":"https://doi.org/10.1080/03605302.2018.1541904","doi":"10.1080/03605302.2018.1541904","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","extern":"1","volume":44,"oa_version":"Preprint","type":"journal_article","das_tickbox":"1","mathsc":["35Q55"],"publication":"Communications in Partial Differential Equations","abstract":[{"lang":"eng","text":"We prove almost sure global existence and scattering for the energy-critical nonlinear Schrödinger equation with randomized spherically symmetric initial data in 𝐻𝑠⁡(ℝ4) with \r\n5/6<𝑠<1. We were inspired to consider this problem by the recent work of Dodson–Lührmann–Mendelson, which treated the analogous problem for the energy-critical wave equation."}],"citation":{"ista":"Killip R, Murphy J, Vişan M. 2019. Almost sure scattering for the energy-critical NLS with radial data below H1(R4). Communications in Partial Differential Equations. 44(1), 51–71.","ama":"Killip R, Murphy J, Vişan M. Almost sure scattering for the energy-critical NLS with radial data below H1(R4). <i>Communications in Partial Differential Equations</i>. 2019;44(1):51-71. doi:<a href=\"https://doi.org/10.1080/03605302.2018.1541904\">10.1080/03605302.2018.1541904</a>","short":"R. Killip, J. Murphy, M. Vişan, Communications in Partial Differential Equations 44 (2019) 51–71.","chicago":"Killip, Rowan, Jason Murphy, and Monica Vişan. “Almost Sure Scattering for the Energy-Critical NLS with Radial Data below H1(R4).” <i>Communications in Partial Differential Equations</i>. Informa UK Limited, 2019. <a href=\"https://doi.org/10.1080/03605302.2018.1541904\">https://doi.org/10.1080/03605302.2018.1541904</a>.","mla":"Killip, Rowan, et al. “Almost Sure Scattering for the Energy-Critical NLS with Radial Data below H1(R4).” <i>Communications in Partial Differential Equations</i>, vol. 44, no. 1, Informa UK Limited, 2019, pp. 51–71, doi:<a href=\"https://doi.org/10.1080/03605302.2018.1541904\">10.1080/03605302.2018.1541904</a>.","apa":"Killip, R., Murphy, J., &#38; Vişan, M. (2019). Almost sure scattering for the energy-critical NLS with radial data below H1(R4). <i>Communications in Partial Differential Equations</i>. Informa UK Limited. <a href=\"https://doi.org/10.1080/03605302.2018.1541904\">https://doi.org/10.1080/03605302.2018.1541904</a>","ieee":"R. Killip, J. Murphy, and M. Vişan, “Almost sure scattering for the energy-critical NLS with radial data below H1(R4),” <i>Communications in Partial Differential Equations</i>, vol. 44, no. 1. Informa UK Limited, pp. 51–71, 2019."},"article_type":"original","date_updated":"2026-06-30T07:16:06Z","publication_identifier":{"eissn":["1532-4133"],"issn":["0360-5302"]},"issue":"1","arxiv":1,"date_published":"2019-02-15T00:00:00Z","language":[{"iso":"eng"}],"_id":"22066","article_processing_charge":"No","quality_controlled":"1","scopus_import":"1","publication_status":"published","OA_place":"repository","page":"51-71","year":"2019","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"last_name":"Murphy","full_name":"Murphy, Jason","first_name":"Jason"},{"last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica"}],"OA_type":"green"},{"ddc":["000"],"doi":"10.1007/978-3-030-30806-3_1","day":"06","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","volume":11674,"type":"conference","status":"public","publisher":"Springer","isi":1,"date_created":"2019-08-19T07:58:10Z","project":[{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"month":"09","title":"Bidding games on Markov decision processes","intvolume":"     11674","file":[{"file_size":436635,"content_type":"application/pdf","file_name":"prob.pdf","relation":"main_file","file_id":"6823","checksum":"45ebbc709af2b247d28c7c293c01504b","date_updated":"2020-07-14T12:47:41Z","creator":"gavni","access_level":"open_access","date_created":"2019-08-19T07:56:40Z"}],"fulldoi":"https://doi.org/10.1007/978-3-030-30806-3_1","external_id":{"isi":["001333747500001"]},"has_accepted_license":"1","file_date_updated":"2020-07-14T12:47:41Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","conference":{"end_date":"2019-09-13","name":"RP: Reachability Problems","start_date":"2019-09-11","location":"Brussels, Belgium"},"publication_status":"published","page":"1-12","year":"2019","alternative_title":["LNCS"],"author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"}],"das_tickbox":"1","publication":"Proceedings of the 13th International Conference of Reachability Problems","publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]},"date_updated":"2026-07-07T13:29:21Z","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"citation":{"ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in <i>Proceedings of the 13th International Conference of Reachability Problems</i>, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &#38; Novotny, P. (2019). Bidding games on Markov decision processes. In <i>Proceedings of the 13th International Conference of Reachability Problems</i> (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">https://doi.org/10.1007/978-3-030-30806-3_1</a>","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” <i>Proceedings of the 13th International Conference of Reachability Problems</i>, vol. 11674, Springer, 2019, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">10.1007/978-3-030-30806-3_1</a>.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: <i>Proceedings of the 13th International Conference of Reachability Problems</i>. Vol 11674. Springer; 2019:1-12. doi:<a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">10.1007/978-3-030-30806-3_1</a>","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In <i>Proceedings of the 13th International Conference of Reachability Problems</i>, 11674:1–12. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">https://doi.org/10.1007/978-3-030-30806-3_1</a>."},"date_published":"2019-09-06T00:00:00Z","_id":"6822","language":[{"iso":"eng"}]},{"publication_status":"published","keyword":["Algebra and Number Theory"],"article_number":"9","quality_controlled":"1","scopus_import":"1","department":[{"_id":"TiBr"}],"article_processing_charge":"No","author":[{"last_name":"Ionica","first_name":"Sorina","full_name":"Ionica, Sorina"},{"last_name":"Kılıçer","full_name":"Kılıçer, Pınar","first_name":"Pınar"},{"first_name":"Kristin","full_name":"Lauter, Kristin","last_name":"Lauter"},{"last_name":"Lorenzo García","first_name":"Elisa","full_name":"Lorenzo García, Elisa"},{"first_name":"Maria-Adelina","id":"be8d652e-a908-11ec-82a4-e2867729459c","full_name":"Manzateanu, Maria-Adelina","last_name":"Manzateanu"},{"first_name":"Maike","full_name":"Massierer, Maike","last_name":"Massierer"},{"last_name":"Vincent","first_name":"Christelle","full_name":"Vincent, Christelle"}],"year":"2019","abstract":[{"lang":"eng","text":"In this article we prove an analogue of a theorem of Lachaud, Ritzenthaler, and Zykin, which allows us to connect invariants of binary octics to Siegel modular forms of genus 3. We use this connection to show that certain modular functions, when restricted to the hyperelliptic locus, assume values whose denominators are products of powers of primes of bad reduction for the associated hyperelliptic curves. We illustrate our theorem with explicit computations. This work is motivated by the study of the values of these modular functions at CM points of the Siegel upper half-space, which, if their denominators are known, can be used to effectively compute models of (hyperelliptic, in our case) curves with CM."}],"article_type":"original","citation":{"chicago":"Ionica, Sorina, Pınar Kılıçer, Kristin Lauter, Elisa Lorenzo García, Maria-Adelina Manzateanu, Maike Massierer, and Christelle Vincent. “Modular Invariants for Genus 3 Hyperelliptic Curves.” <i>Research in Number Theory</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s40993-018-0146-6\">https://doi.org/10.1007/s40993-018-0146-6</a>.","ista":"Ionica S, Kılıçer P, Lauter K, Lorenzo García E, Manzateanu M-A, Massierer M, Vincent C. 2019. Modular invariants for genus 3 hyperelliptic curves. Research in Number Theory. 5, 9.","ama":"Ionica S, Kılıçer P, Lauter K, et al. Modular invariants for genus 3 hyperelliptic curves. <i>Research in Number Theory</i>. 2019;5. doi:<a href=\"https://doi.org/10.1007/s40993-018-0146-6\">10.1007/s40993-018-0146-6</a>","short":"S. Ionica, P. Kılıçer, K. Lauter, E. Lorenzo García, M.-A. Manzateanu, M. Massierer, C. Vincent, Research in Number Theory 5 (2019).","mla":"Ionica, Sorina, et al. “Modular Invariants for Genus 3 Hyperelliptic Curves.” <i>Research in Number Theory</i>, vol. 5, 9, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/s40993-018-0146-6\">10.1007/s40993-018-0146-6</a>.","apa":"Ionica, S., Kılıçer, P., Lauter, K., Lorenzo García, E., Manzateanu, M.-A., Massierer, M., &#38; Vincent, C. (2019). Modular invariants for genus 3 hyperelliptic curves. <i>Research in Number Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40993-018-0146-6\">https://doi.org/10.1007/s40993-018-0146-6</a>","ieee":"S. Ionica <i>et al.</i>, “Modular invariants for genus 3 hyperelliptic curves,” <i>Research in Number Theory</i>, vol. 5. Springer Nature, 2019."},"publication_identifier":{"eissn":["2363-9555"],"issn":["2522-0160"]},"date_updated":"2026-08-06T12:10:57Z","publication":"Research in Number Theory","das_tickbox":"0","language":[{"iso":"eng"}],"_id":"10874","arxiv":1,"date_published":"2019-01-02T00:00:00Z","volume":5,"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"day":"02","doi":"10.1007/s40993-018-0146-6","acknowledgement":"The authors would like to thank the Lorentz Center in Leiden for hosting the Women in Numbers Europe 2 workshop and providing a productive and enjoyable environment for our initial work on this project. We are grateful to the organizers of WIN-E2, Irene Bouw, Rachel Newton and Ekin Ozman, for making this conference and this collaboration possible. We\r\nthank Irene Bouw and Christophe Ritzenhaler for helpful discussions. Ionica acknowledges support from the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. Most of Kılıçer’s work was carried out during her stay in Universiteit Leiden and Carl von Ossietzky Universität Oldenburg. Massierer was supported by the Australian Research Council (DP150101689). Vincent is supported by the National Science Foundation under Grant No. DMS-1802323 and by the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. ","type":"journal_article","date_created":"2022-03-18T12:09:48Z","publisher":"Springer Nature","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.08986"}],"fulldoi":"https://doi.org/10.1007/s40993-018-0146-6","external_id":{"arxiv":["1807.08986"]},"supplementarymaterial":"no","intvolume":"         5","title":"Modular invariants for genus 3 hyperelliptic curves","month":"01","researchdata_availability":"no"},{"publication":"35th International Symposium on Computational Geometry","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"corr_author":"1","citation":{"ista":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.","short":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.","ama":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. In: <i>35th International Symposium on Computational Geometry</i>. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.38\">10.4230/LIPICS.SOCG.2019.38</a>","chicago":"Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.” In <i>35th International Symposium on Computational Geometry</i>, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.38\">https://doi.org/10.4230/LIPICS.SOCG.2019.38</a>.","mla":"Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” <i>35th International Symposium on Computational Geometry</i>, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.38\">10.4230/LIPICS.SOCG.2019.38</a>.","apa":"Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &#38; Wagner, U. (2019). The crossing Tverberg theorem. In <i>35th International Symposium on Computational Geometry</i> (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.38\">https://doi.org/10.4230/LIPICS.SOCG.2019.38</a>","ieee":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in <i>35th International Symposium on Computational Geometry</i>, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13."},"abstract":[{"text":"The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X of at least (d+1)(r-1)+1 points in R^d, one can find a partition X=X_1 cup ... cup X_r of X, such that the convex hulls of the X_i, i=1,...,r, all share a common point. In this paper, we prove a strengthening of this theorem that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections. Possible generalizations and algorithmic aspects are also discussed. As a concrete application, we show that any n points in the plane in general position span floor[n/3] vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries have pairwise nonempty intersections; this number is clearly best possible. A previous result of Alvarez-Rebollar et al. guarantees floor[n/6] pairwise crossing triangles. Our result generalizes to a result about simplices in R^d,d >=2.","lang":"eng"}],"publication_identifier":{"isbn":["9783959771047"],"issn":["1868-8969"]},"date_updated":"2026-10-21T13:25:18Z","arxiv":1,"date_published":"2019-06-01T00:00:00Z","language":[{"iso":"eng"}],"_id":"6647","conference":{"name":"SoCG 2019: Symposium on Computational Geometry","start_date":"2019-06-18","location":"Portland, OR, United States","end_date":"2019-06-21"},"quality_controlled":"1","scopus_import":1,"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:47:35Z","publication_status":"published","page":"38:1-38:13","author":[{"last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"last_name":"Gärtner","first_name":"Bernd","full_name":"Gärtner, Bernd"},{"last_name":"Kupavskii","full_name":"Kupavskii, Andrey","first_name":"Andrey"},{"full_name":"Valtr, Pavel","first_name":"Pavel","last_name":"Valtr"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli"}],"alternative_title":["LIPIcs"],"year":"2019","date_created":"2019-07-17T10:35:04Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","month":"06","project":[{"name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02281"}],"external_id":{"arxiv":["1812.04911"]},"fulldoi":"https://doi.org/10.4230/LIPICS.SOCG.2019.38","has_accepted_license":"1","file":[{"content_type":"application/pdf","file_size":559837,"relation":"main_file","file_name":"2019_LIPICS_Fulek.pdf","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-24T06:54:52Z","file_id":"6667","checksum":"d6d017f8b41291b94d102294fa96ae9c"}],"intvolume":"       129","title":"The crossing Tverberg theorem","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","doi":"10.4230/LIPICS.SOCG.2019.38","ddc":["000","510"],"volume":129,"oa_version":"Published Version","type":"conference","related_material":{"record":[{"status":"public","relation":"later_version","id":"13974"}]}},{"page":"400-408","year":"2019","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"last_name":"Goharshady","first_name":"Ehsan Kafshdar","full_name":"Goharshady, Ehsan Kafshdar"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:32Z","conference":{"end_date":"2019-04-12","location":"Limassol, Cyprus","start_date":"2019-04-08","name":"SAC: Symposium on Applied Computing"},"scopus_import":"1","quality_controlled":"1","publication_status":"published","date_published":"2019-04-01T00:00:00Z","language":[{"iso":"eng"}],"_id":"6490","publication":"Proceedings of the 34th ACM Symposium on Applied Computing","abstract":[{"lang":"eng","text":"Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n"}],"citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:400–408. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>.","ista":"Chatterjee K, Goharshady AK, Goharshady EK. 2019. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.","ama":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:400-408. doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>","short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 400–408.","mla":"Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 400–08, doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Goharshady, E. K. (2019). The treewidth of smart contracts. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>","ieee":"K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408."},"corr_author":"1","publication_identifier":{"isbn":["9781450359337"]},"date_updated":"2026-11-17T23:30:48Z","pubrep_id":"1070","type":"conference","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"ddc":["000"],"doi":"10.1145/3297280.3297322","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","volume":"Part F147772","oa_version":"Submitted Version","month":"04","title":"The treewidth of smart contracts","external_id":{"isi":["000474685800052"]},"fulldoi":"https://doi.org/10.1145/3297280.3297322","has_accepted_license":"1","file":[{"content_type":"application/pdf","file_size":6937138,"file_name":"2019_ACM_Chatterjee.pdf","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:47:32Z","access_level":"open_access","date_created":"2020-05-14T09:50:11Z","file_id":"7827","checksum":"dddc20f6d9881f23b8755eb720ec9d6f"}],"status":"public","date_created":"2019-05-26T21:59:15Z","publisher":"ACM","isi":1},{"_id":"11064","language":[{"iso":"eng"}],"date_published":"2018-12-20T00:00:00Z","publication_identifier":{"issn":["1474-760X"]},"date_updated":"2024-10-14T11:20:00Z","abstract":[{"lang":"eng","text":"Biomarkers of aging can be used to assess the health of individuals and to study aging and age-related diseases. We generate a large dataset of genome-wide RNA-seq profiles of human dermal fibroblasts from 133 people aged 1 to 94 years old to test whether signatures of aging are encoded within the transcriptome. We develop an ensemble machine learning method that predicts age to a median error of 4 years, outperforming previous methods used to predict age. The ensemble was further validated by testing it on ten progeria patients, and our method is the only one that predicts accelerated aging in these patients."}],"citation":{"ista":"Fleischer JG, Schulte R, Tsai HH, Tyagi S, Ibarra A, Shokhirev MN, Huang L, Hetzer M, Navlakha S. 2018. Predicting age from the transcriptome of human dermal fibroblasts. Genome Biology. 19, 221.","short":"J.G. Fleischer, R. Schulte, H.H. Tsai, S. Tyagi, A. Ibarra, M.N. Shokhirev, L. Huang, M. Hetzer, S. Navlakha, Genome Biology 19 (2018).","ama":"Fleischer JG, Schulte R, Tsai HH, et al. Predicting age from the transcriptome of human dermal fibroblasts. <i>Genome Biology</i>. 2018;19. doi:<a href=\"https://doi.org/10.1186/s13059-018-1599-6\">10.1186/s13059-018-1599-6</a>","chicago":"Fleischer, Jason G., Roberta Schulte, Hsiao H. Tsai, Swati Tyagi, Arkaitz Ibarra, Maxim N. Shokhirev, Ling Huang, Martin Hetzer, and Saket Navlakha. “Predicting Age from the Transcriptome of Human Dermal Fibroblasts.” <i>Genome Biology</i>. BioMed Central, 2018. <a href=\"https://doi.org/10.1186/s13059-018-1599-6\">https://doi.org/10.1186/s13059-018-1599-6</a>.","mla":"Fleischer, Jason G., et al. “Predicting Age from the Transcriptome of Human Dermal Fibroblasts.” <i>Genome Biology</i>, vol. 19, 221, BioMed Central, 2018, doi:<a href=\"https://doi.org/10.1186/s13059-018-1599-6\">10.1186/s13059-018-1599-6</a>.","ieee":"J. G. Fleischer <i>et al.</i>, “Predicting age from the transcriptome of human dermal fibroblasts,” <i>Genome Biology</i>, vol. 19. BioMed Central, 2018.","apa":"Fleischer, J. G., Schulte, R., Tsai, H. H., Tyagi, S., Ibarra, A., Shokhirev, M. N., … Navlakha, S. (2018). Predicting age from the transcriptome of human dermal fibroblasts. <i>Genome Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s13059-018-1599-6\">https://doi.org/10.1186/s13059-018-1599-6</a>"},"article_type":"original","publication":"Genome Biology","year":"2018","author":[{"last_name":"Fleischer","first_name":"Jason G.","full_name":"Fleischer, Jason G."},{"last_name":"Schulte","full_name":"Schulte, Roberta","first_name":"Roberta"},{"last_name":"Tsai","first_name":"Hsiao H.","full_name":"Tsai, Hsiao H."},{"first_name":"Swati","full_name":"Tyagi, Swati","last_name":"Tyagi"},{"full_name":"Ibarra, Arkaitz","first_name":"Arkaitz","last_name":"Ibarra"},{"last_name":"Shokhirev","first_name":"Maxim N.","full_name":"Shokhirev, Maxim N."},{"last_name":"Huang","full_name":"Huang, Ling","first_name":"Ling"},{"first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X"},{"first_name":"Saket","full_name":"Navlakha, Saket","last_name":"Navlakha"}],"publication_status":"published","article_processing_charge":"No","quality_controlled":"1","scopus_import":"1","article_number":"221","title":"Predicting age from the transcriptome of human dermal fibroblasts","intvolume":"        19","external_id":{"pmid":["30567591"]},"fulldoi":"https://doi.org/10.1186/s13059-018-1599-6","month":"12","status":"public","publisher":"BioMed Central","date_created":"2022-04-07T07:45:40Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/s13059-018-1599-6"}],"pmid":1,"type":"journal_article","oa_version":"Published Version","extern":"1","volume":19,"doi":"10.1186/s13059-018-1599-6","day":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1}]
