TY - JOUR AB - Multicellular organisms develop complex shapes from much simpler, single-celled zygotes through a process commonly called morphogenesis. Morphogenesis involves an interplay between several factors, ranging from the gene regulatory networks determining cell fate and differentiation to the mechanical processes underlying cell and tissue shape changes. Thus, the study of morphogenesis has historically been based on multidisciplinary approaches at the interface of biology with physics and mathematics. Recent technological advances have further improved our ability to study morphogenesis by bridging the gap between the genetic and biophysical factors through the development of new tools for visualizing, analyzing, and perturbing these factors and their biochemical intermediaries. Here, we review how a combination of genetic, microscopic, biophysical, and biochemical approaches has aided our attempts to understand morphogenesis and discuss potential approaches that may be beneficial to such an inquiry in the future. AU - Mishra, Nikhil AU - Heisenberg, Carl-Philipp J ID - 10406 JF - Annual Review of Genetics KW - morphogenesis KW - forward genetics KW - high-resolution microscopy KW - biophysics KW - biochemistry KW - patterning SN - 0066-4197 TI - Dissecting organismal morphogenesis by bridging genetics and biophysics VL - 55 ER - TY - GEN AB - The zip file includes source data used in the main text of the manuscript "Theory of branching morphogenesis by local interactions and global guidance", as well as a representative Jupyter notebook to reproduce the main figures. A sample script for the simulations of branching and annihilating random walks is also included (Sample_script_for_simulations_of_BARWs.ipynb) to generate exemplary branched networks under external guidance. A detailed description of the simulation setup is provided in the supplementary information of the manuscipt. AU - Ucar, Mehmet C ID - 13058 TI - Source data for the manuscript "Theory of branching morphogenesis by local interactions and global guidance" ER - TY - CONF AB - Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds log(N) keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting 2log(N) ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks. AU - Alwen, Joel F AU - Auerbach, Benedikt AU - Baig, Mirza Ahad AU - Cueto Noval, Miguel AU - Klein, Karen AU - Pascual Perez, Guillermo AU - Pietrzak, Krzysztof Z AU - Walter, Michael ID - 10408 SN - 0302-9743 T2 - 19th International Conference TI - Grafting key trees: Efficient key management for overlapping groups VL - 13044 ER - TY - JOUR AB - We show that in a two-dimensional electron gas with an annular Fermi surface, long-range Coulomb interactions can lead to unconventional superconductivity by the Kohn-Luttinger mechanism. Superconductivity is strongly enhanced when the inner and outer Fermi surfaces are close to each other. The most prevalent state has chiral p-wave symmetry, but d-wave and extended s-wave pairing are also possible. We discuss these results in the context of rhombohedral trilayer graphene, where superconductivity was recently discovered in regimes where the normal state has an annular Fermi surface. Using realistic parameters, our mechanism can account for the order of magnitude of Tc, as well as its trends as a function of electron density and perpendicular displacement field. Moreover, it naturally explains some of the outstanding puzzles in this material, that include the weak temperature dependence of the resistivity above Tc, and the proximity of spin singlet superconductivity to the ferromagnetic phase. AU - Ghazaryan, Areg AU - Holder, Tobias AU - Serbyn, Maksym AU - Berg, Erez ID - 10527 IS - 24 JF - Physical Review Letters KW - general physics and astronomy SN - 0031-9007 TI - Unconventional superconductivity in systems with annular Fermi surfaces: Application to rhombohedral trilayer graphene VL - 127 ER - TY - JOUR AB - For many years, fullerene derivatives have been the main n-type material of organic electronics and optoelectronics. Recently, fullerene derivatives functionalized with ethylene glycol (EG) side chains have been showing important properties such as enhanced dielectric constants, facile doping and enhanced self-assembly capabilities. Here, we have prepared field-effect transistors using a series of these fullerene derivatives equipped with EG side chains of different lengths. Transport data show the beneficial effect of increasing the EG side chain. In order to understand the material properties, full structural determination of these fullerene derivatives has been achieved by coupling the X-ray data with molecular dynamics (MD) simulations. The increase in transport properties is paired with the formation of extended layered structures, efficient molecular packing and an increase in the crystallite alignment. The layer-like structure is composed of conducting layers, containing of closely packed C60 balls approaching the inter-distance of 1 nm, that are separated by well-defined EG layers, where the EG chains are rather splayed with the chain direction almost perpendicular to the layer normal. Such a layered structure appears highly ordered and highly aligned with the C60 planes oriented parallel to the substrate in the thin film configuration. The order inside the thin film increases with the EG chain length, allowing the systems to achieve mobilities as high as 0.053 cm2 V−1 s−1. Our work elucidates the structure of these interesting semiconducting organic molecules and shows that the synergistic use of X-ray structural analysis and MD simulations is a powerful tool to identify the structure of thin organic films for optoelectronic applications. AU - Dong, Jingjin AU - Sami, Selim AU - Balazs, Daniel AU - Alessandri, Riccardo AU - Jahani, Fatimeh AU - Qiu, Li AU - Marrink, Siewert J. AU - Havenith, Remco W.A. AU - Hummelen, Jan C. AU - Loi, Maria A. AU - Portale, Giuseppe ID - 10534 IS - 45 JF - Journal of Materials Chemistry C SN - 2050-7534 TI - Fullerene derivatives with oligoethylene-glycol side chains: An investigation on the origin of their outstanding transport properties VL - 9 ER - TY - JOUR AB - Flowering plants utilize small RNA molecules to guide DNA methyltransferases to genomic sequences. This RNA-directed DNA methylation (RdDM) pathway preferentially targets euchromatic transposable elements. However, RdDM is thought to be recruited by methylation of histone H3 at lysine 9 (H3K9me), a hallmark of heterochromatin. How RdDM is targeted to euchromatin despite an affinity for H3K9me is unclear. Here we show that loss of histone H1 enhances heterochromatic RdDM, preferentially at nucleosome linker DNA. Surprisingly, this does not require SHH1, the RdDM component that binds H3K9me. Furthermore, H3K9me is dispensable for RdDM, as is CG DNA methylation. Instead, we find that non-CG methylation is specifically associated with small RNA biogenesis, and without H1 small RNA production quantitatively expands to non-CG methylated loci. Our results demonstrate that H1 enforces the separation of euchromatic and heterochromatic DNA methylation pathways by excluding the small RNA-generating branch of RdDM from non-CG methylated heterochromatin. AU - Choi, Jaemyung AU - Lyons, David B AU - Zilberman, Daniel ID - 10533 JF - eLife KW - genetics and molecular biology SN - 2050-084X TI - Histone H1 prevents non-CG methylation-mediated small RNA biogenesis in Arabidopsis heterochromatin VL - 10 ER - TY - JOUR AB - TGFβ overexpression is commonly detected in cancer patients and correlates with poor prognosis and metastasis. Cancer progression is often associated with an enhanced recruitment of myeloid-derived cells to the tumor microenvironment. Here we show that functional TGFβ-signaling in myeloid cells is required for metastasis to the lungs and the liver. Myeloid-specific deletion of Tgfbr2 resulted in reduced spontaneous lung metastasis, which was associated with a reduction of proinflammatory cytokines in the metastatic microenvironment. Notably, CD8+ T cell depletion in myeloid-specific Tgfbr2-deficient mice rescued lung metastasis. Myeloid-specific Tgfbr2-deficiency resulted in reduced liver metastasis with an almost complete absence of myeloid cells within metastatic foci. On contrary, an accumulation of Tgfβ-responsive myeloid cells was associated with an increased recruitment of monocytes and granulocytes and higher proinflammatory cytokine levels in control mice. Monocytic cells isolated from metastatic livers of Tgfbr2-deficient mice showed increased polarization towards the M1 phenotype, Tnfα and Il-1β expression, reduced levels of M2 markers and reduced production of chemokines responsible for myeloid-cell recruitment. No significant differences in Tgfβ levels were observed at metastatic sites of any model. These data demonstrate that Tgfβ signaling in monocytic myeloid cells suppresses CD8+ T cell activity during lung metastasis, while these cells actively contribute to tumor growth during liver metastasis. Thus, myeloid cells modulate metastasis through different mechanisms in a tissue-specific manner. AU - Stefanescu, Cristina AU - Van Gogh, Merel AU - Roblek, Marko AU - Heikenwalder, Mathias AU - Borsig, Lubor ID - 10536 JF - Frontiers in Oncology TI - TGFβ signaling in myeloid cells promotes lung and liver metastasis through different mechanisms VL - 11 ER - TY - JOUR AB - We consider the quantum many-body evolution of a homogeneous Fermi gas in three dimensions in the coupled semiclassical and mean-field scaling regime. We study a class of initial data describing collective particle–hole pair excitations on the Fermi ball. Using a rigorous version of approximate bosonization, we prove that the many-body evolution can be approximated in Fock space norm by a quasi-free bosonic evolution of the collective particle–hole excitations. AU - Benedikter, Niels P AU - Nam, Phan Thành AU - Porta, Marcello AU - Schlein, Benjamin AU - Seiringer, Robert ID - 10537 JF - Annales Henri Poincaré SN - 1424-0637 TI - Bosonization of fermionic many-body dynamics ER - TY - JOUR AB - We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on \mathbb {R}^d with stationary law (that is spatially homogeneous statistics) and fast decay of correlations on scales larger than the microscale \varepsilon >0, we establish homogenization error estimates of the order \varepsilon in case d\geqq 3, and of the order \varepsilon |\log \varepsilon |^{1/2} in case d=2. Previous results in nonlinear stochastic homogenization have been limited to a small algebraic rate of convergence \varepsilon ^\delta . We also establish error estimates for the approximation of the homogenized operator by the method of representative volumes of the order (L/\varepsilon )^{-d/2} for a representative volume of size L. Our results also hold in the case of systems for which a (small-scale) C^{1,\alpha } regularity theory is available. AU - Fischer, Julian L AU - Neukamm, Stefan ID - 10549 IS - 1 JF - Archive for Rational Mechanics and Analysis KW - Mechanical Engineering KW - Mathematics (miscellaneous) KW - Analysis SN - 0003-9527 TI - Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems VL - 242 ER - TY - CONF AB - We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a SO(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(δwlog(S)) , δ being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity. with only a SO(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(δwlog(S)) , δ being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity. AU - Kamath Hosdurg, Chethan AU - Klein, Karen AU - Pietrzak, Krzysztof Z ID - 10409 SN - 0302-9743 T2 - 19th International Conference TI - On treewidth, separators and Yao’s garbling VL - 13043 ER -