--- _id: '12190' abstract: - lang: eng text: Meiotic crossover frequency varies within genomes, which influences genetic diversity and adaptation. In turn, genetic variation within populations can act to modify crossover frequency in cis and trans. To identify genetic variation that controls meiotic crossover frequency, we screened Arabidopsis accessions using fluorescent recombination reporters. We mapped a genetic modifier of crossover frequency in Col × Bur populations of Arabidopsis to a premature stop codon within TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare variant found in the British Isles, originating in South-West Ireland. Using genetics, genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers, with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq) from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread transcriptional changes, including in genes that regulate the meiotic cell cycle and recombination. Therefore, TAF4b duplication is associated with acquisition of meiocyte-specific expression and promotion of germline transcription, which act directly or indirectly to elevate crossovers. This identifies a novel mode of meiotic recombination control via a general transcription factor. acknowledgement: "We thank Gregory Copenhaver (University of North Carolina), Avraham Levy (The Weizmann Institute), and Scott Poethig (University of Pennsylvania) for FTLs; Piotr Ziolkowski for Col-420/Bur seed; Sureshkumar Balasubramanian\r\n(Monash University) for providing British and Irish Arabidopsis accessions; Mathilde Grelon (INRA, Versailles) for providing the MLH1 antibody; and the Gurdon Institute for access to microscopes. This work was supported by a BBSRC DTP studentship (E.J.L.), European Research Area Network for Coordinating Action in Plant Sciences/BBSRC ‘‘DeCOP’’ (BB/M004937/1; C.L.), a BBSRC David Phillips Fellowship (BB/L025043/1; H.G. and X.F.), the European Research Council (CoG ‘‘SynthHotspot,’’ A.J.T., C.L., and I.R.H.; StG ‘‘SexMeth,’’ X.F.), and a Sainsbury Charitable Foundation Studentship (A.R.B.)." article_processing_charge: No article_type: original author: - first_name: Emma J. full_name: Lawrence, Emma J. last_name: Lawrence - first_name: Hongbo full_name: Gao, Hongbo last_name: Gao - first_name: Andrew J. full_name: Tock, Andrew J. last_name: Tock - first_name: Christophe full_name: Lambing, Christophe last_name: Lambing - first_name: Alexander R. full_name: Blackwell, Alexander R. last_name: Blackwell - first_name: Xiaoqi full_name: Feng, Xiaoqi id: e0164712-22ee-11ed-b12a-d80fcdf35958 last_name: Feng orcid: 0000-0002-4008-1234 - first_name: Ian R. full_name: Henderson, Ian R. last_name: Henderson citation: ama: Lawrence EJ, Gao H, Tock AJ, et al. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. 2019;29(16):2676-2686.e3. doi:10.1016/j.cub.2019.06.084 apa: Lawrence, E. J., Gao, H., Tock, A. J., Lambing, C., Blackwell, A. R., Feng, X., & Henderson, I. R. (2019). Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. Elsevier BV. https://doi.org/10.1016/j.cub.2019.06.084 chicago: Lawrence, Emma J., Hongbo Gao, Andrew J. Tock, Christophe Lambing, Alexander R. Blackwell, Xiaoqi Feng, and Ian R. Henderson. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” Current Biology. Elsevier BV, 2019. https://doi.org/10.1016/j.cub.2019.06.084. ieee: E. J. Lawrence et al., “Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis,” Current Biology, vol. 29, no. 16. Elsevier BV, p. 2676–2686.e3, 2019. ista: Lawrence EJ, Gao H, Tock AJ, Lambing C, Blackwell AR, Feng X, Henderson IR. 2019. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. 29(16), 2676–2686.e3. mla: Lawrence, Emma J., et al. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” Current Biology, vol. 29, no. 16, Elsevier BV, 2019, p. 2676–2686.e3, doi:10.1016/j.cub.2019.06.084. short: E.J. Lawrence, H. Gao, A.J. Tock, C. Lambing, A.R. Blackwell, X. Feng, I.R. Henderson, Current Biology 29 (2019) 2676–2686.e3. date_created: 2023-01-16T09:16:33Z date_published: 2019-08-19T00:00:00Z date_updated: 2023-05-08T10:54:54Z day: '19' department: - _id: XiFe doi: 10.1016/j.cub.2019.06.084 extern: '1' external_id: pmid: - '31378616' intvolume: ' 29' issue: '16' keyword: - General Agricultural and Biological Sciences - General Biochemistry - Genetics and Molecular Biology language: - iso: eng month: '08' oa_version: None page: 2676-2686.e3 pmid: 1 publication: Current Biology publication_identifier: issn: - 0960-9822 publication_status: published publisher: Elsevier BV quality_controlled: '1' scopus_import: '1' status: public title: Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2019' ... --- _id: '6989' abstract: - lang: eng text: 'When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. ' acknowledgement: This research was performed in part at the 33rd BellairsWinter Workshop on Computational Geometry. Wethank all other participants for a fruitful atmosphere. article_processing_charge: No author: - first_name: Oswin full_name: Aichholzer, Oswin last_name: Aichholzer - first_name: Hugo A full_name: Akitaya, Hugo A last_name: Akitaya - first_name: Kenneth C full_name: Cheung, Kenneth C last_name: Cheung - first_name: Erik D full_name: Demaine, Erik D last_name: Demaine - first_name: Martin L full_name: Demaine, Martin L last_name: Demaine - first_name: Sandor P full_name: Fekete, Sandor P last_name: Fekete - first_name: Linda full_name: Kleist, Linda last_name: Kleist - first_name: Irina full_name: Kostitsyna, Irina last_name: Kostitsyna - first_name: Maarten full_name: Löffler, Maarten last_name: Löffler - first_name: Zuzana full_name: Masárová, Zuzana id: 45CFE238-F248-11E8-B48F-1D18A9856A87 last_name: Masárová orcid: 0000-0002-6660-1322 - first_name: Klara full_name: Mundilova, Klara last_name: Mundilova - first_name: Christiane full_name: Schmidt, Christiane last_name: Schmidt citation: ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. In: Proceedings of the 31st Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry; 2019:164-170.' apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a cube. In Proceedings of the 31st Canadian Conference on Computational Geometry (pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry.' chicago: Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” In Proceedings of the 31st Canadian Conference on Computational Geometry, 164–70. Canadian Conference on Computational Geometry, 2019. ieee: O. Aichholzer et al., “Folding polyominoes with holes into a cube,” in Proceedings of the 31st Canadian Conference on Computational Geometry, Edmonton, Canada, 2019, pp. 164–170. ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference on Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 164–170.' mla: Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–70. short: O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–170. conference: end_date: 2019-08-10 location: Edmonton, Canada name: 'CCCG: Canadian Conference in Computational Geometry' start_date: 2019-08-08 date_created: 2019-11-04T16:46:11Z date_published: 2019-08-01T00:00:00Z date_updated: 2023-08-04T10:57:42Z day: '01' department: - _id: HeEd external_id: arxiv: - '1910.09917' language: - iso: eng main_file_link: - open_access: '1' url: https://cccg.ca/proceedings/2019/proceedings.pdf month: '08' oa: 1 oa_version: Published Version page: 164-170 publication: Proceedings of the 31st Canadian Conference on Computational Geometry publication_status: published publisher: Canadian Conference on Computational Geometry quality_controlled: '1' related_material: record: - id: '8317' relation: extended_version status: public scopus_import: '1' status: public title: Folding polyominoes with holes into a cube type: conference user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 year: '2019' ... --- _id: '6884' abstract: - lang: eng text: 'In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the "bank" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players'' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. ' alternative_title: - LIPIcs article_number: '11' author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic citation: ama: 'Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11' apa: 'Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11' chicago: Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11. ieee: 'G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.' ista: 'Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.' mla: Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11. short: G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Aachen, Germany name: 'MFCS: nternational Symposium on Mathematical Foundations of Computer Science' start_date: 2019-08-26 date_created: 2019-09-18T08:04:26Z date_published: 2019-08-01T00:00:00Z date_updated: 2023-08-07T14:08:34Z day: '01' ddc: - '004' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPICS.MFCS.2019.11 ec_funded: 1 external_id: arxiv: - '1905.03835' file: - access_level: open_access checksum: 6346e116a4f4ed1414174d96d2c4fbd7 content_type: application/pdf creator: kschuh date_created: 2019-09-27T11:45:15Z date_updated: 2020-07-14T12:47:42Z file_id: '6913' file_name: 2019_LIPIcs_Avni.pdf file_size: 554457 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 138' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '08' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '9239' relation: later_version status: public scopus_import: 1 status: public title: Bidding mechanisms in graph games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 138 year: '2019' ... --- _id: '9726' abstract: - lang: eng text: A detailed description of the two stochastic models, table of parameters, supplementary data for Figures 4 and 5, parameter dependence of the results, and an analysis on motors with different force–velocity functions (PDF) article_processing_charge: No author: - first_name: Mehmet C full_name: Ucar, Mehmet C id: 50B2A802-6007-11E9-A42B-EB23E6697425 last_name: Ucar orcid: 0000-0003-0506-4217 - first_name: Reinhard full_name: Lipowsky, Reinhard last_name: Lipowsky citation: ama: Ucar MC, Lipowsky R. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001 apa: Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s001 chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” American Chemical Society , 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001. ieee: M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding.” American Chemical Society , 2019. ista: Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding, American Chemical Society , 10.1021/acs.nanolett.9b04445.s001. mla: Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding. American Chemical Society , 2019, doi:10.1021/acs.nanolett.9b04445.s001. short: M.C. Ucar, R. Lipowsky, (2019). date_created: 2021-07-27T09:51:46Z date_published: 2019-12-19T00:00:00Z date_updated: 2023-08-17T14:07:52Z day: '19' department: - _id: EdHa doi: 10.1021/acs.nanolett.9b04445.s001 month: '12' oa_version: Published Version publisher: 'American Chemical Society ' related_material: record: - id: '7166' relation: used_in_publication status: public status: public title: Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ... --- _id: '6671' abstract: - lang: eng text: 'In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points.' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: André full_name: Lieutier, André last_name: Lieutier - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat J-D, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 2019;3(1-2):29–58. doi:10.1007/s41468-019-00029-8 apa: Boissonnat, J.-D., Lieutier, A., & Wintraecken, M. (2019). The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-019-00029-8 chicago: Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology. Springer Nature, 2019. https://doi.org/10.1007/s41468-019-00029-8. ieee: J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion, geodesic convexity and the variation of tangent spaces,” Journal of Applied and Computational Topology, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019. ista: Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 3(1–2), 29–58. mla: Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:10.1007/s41468-019-00029-8. short: J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational Topology 3 (2019) 29–58. date_created: 2019-07-24T08:37:29Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-08-22T12:37:47Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s41468-019-00029-8 ec_funded: 1 file: - access_level: open_access checksum: a5b244db9f751221409cf09c97ee0935 content_type: application/pdf creator: dernst date_created: 2019-07-31T08:09:56Z date_updated: 2020-07-14T12:47:36Z file_id: '6741' file_name: 2019_JournAppliedComputTopol_Boissonnat.pdf file_size: 2215157 relation: main_file file_date_updated: 2020-07-14T12:47:36Z has_accepted_license: '1' intvolume: ' 3' issue: 1-2 language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 29–58 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Journal of Applied and Computational Topology publication_identifier: eissn: - 2367-1734 issn: - 2367-1726 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: The reach, metric distortion, geodesic convexity and the variation of tangent spaces tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2019' ...