TY - GEN
AB - The reflectance field of a face describes the reflectance properties responsible for complex lighting effects including diffuse, specular, inter-reflection and self shadowing. Most existing methods for estimating the face reflectance from a monocular image assume faces to be diffuse with very few approaches adding a specular component. This still leaves out important perceptual aspects of reflectance as higher-order global illumination effects and self-shadowing are not modeled. We present a new neural representation for face reflectance where we can estimate all components of the reflectance responsible for the final appearance from a single monocular image. Instead of modeling each component of the reflectance separately using parametric models, our neural representation allows us to generate a basis set of faces in a geometric deformation-invariant space, parameterized by the input light direction, viewpoint and face geometry. We learn to reconstruct this reflectance field of a face just from a monocular image, which can be used to render the face from any viewpoint in any light condition. Our method is trained on a light-stage training dataset, which captures 300 people illuminated with 150 light conditions from 8 viewpoints. We show that our method outperforms existing monocular reflectance reconstruction methods, in terms of photorealism due to better capturing of physical premitives, such as sub-surface scattering, specularities, self-shadows and other higher-order effects.
AU - B R, Mallikarjun
AU - Tewari, Ayush
AU - Oh, Tae-Hyun
AU - Weyrich, Tim
AU - Bickel, Bernd
AU - Seidel, Hans-Peter
AU - Pfister, Hanspeter
AU - Matusik, Wojciech
AU - Elgharib, Mohamed
AU - Theobalt, Christian
ID - 9957
T2 - Computer Vision Foundation
TI - Monocular reconstruction of neural face reflectance fields
ER -
TY - CONF
AB - Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.
AU - Agarwal, Pratyush
AU - Chatterjee, Krishnendu
AU - Pathak, Shreya
AU - Pavlogiannis, Andreas
AU - Toman, Viktor
ID - 9987
SN - 0302-9743
T2 - 33rd International Conference on Computer-Aided Verification
TI - Stateless model checking under a reads-value-from equivalence
VL - 12759
ER -
TY - JOUR
AB - Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms.
AU - Schmid, Laura
AU - Shati, Pouya
AU - Hilbe, Christian
AU - Chatterjee, Krishnendu
ID - 9997
IS - 1
JF - Scientific Reports
KW - Multidisciplinary
TI - The evolution of indirect reciprocity under action and assessment generosity
VL - 11
ER -
TY - GEN
AB - We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle.
AU - Hensel, Sebastian
AU - Laux, Tim
ID - 10011
KW - Mean curvature flow
KW - gradient flows
KW - varifolds
KW - weak solutions
KW - weak-strong uniqueness
KW - calibrated geometry
KW - gradient-flow calibrations
T2 - arXiv
TI - A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness
ER -
TY - JOUR
AB - The developmental strategies used by progenitor cells to endure a safe journey from their induction place towards the site of terminal differentiation are still poorly understood. Here we uncovered a progenitor cell allocation mechanism that stems from an incomplete process of epithelial delamination that allows progenitors to coordinate their movement with adjacent extra-embryonic tissues. Progenitors of the zebrafish laterality organ originate from the surface epithelial enveloping layer by an apical constriction process of cell delamination. During this process, progenitors retain long-term apical contacts that enable the epithelial layer to pull a subset of progenitors along their way towards the vegetal pole. The remaining delaminated progenitors follow apically-attached progenitors’ movement by a co-attraction mechanism, avoiding sequestration by the adjacent endoderm, ensuring their fate and collective allocation at the differentiation site. Thus, we reveal that incomplete delamination serves as a cellular platform for coordinated tissue movements during development. Impact Statement: Incomplete delamination serves as a cellular platform for coordinated tissue movements during development, guiding newly formed progenitor cell groups to the differentiation site.
AU - Pulgar, Eduardo
AU - Schwayer, Cornelia
AU - Guerrero, Néstor
AU - López, Loreto
AU - Márquez, Susana
AU - Härtel, Steffen
AU - Soto, Rodrigo
AU - Heisenberg, Carl Philipp
AU - Concha, Miguel L.
ID - 9999
JF - eLife
KW - cell delamination
KW - apical constriction
KW - dragging
KW - mechanical forces
KW - collective 18 locomotion
KW - dorsal forerunner cells
KW - zebrafish
TI - Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism
VL - 10
ER -
TY - JOUR
AB - Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs) after acute optic nerve damage. Consistent with this, induced HDAC3 expression in cultured cells shows selective toxicity to neurons. Despite an established role for HDAC3 in neuronal pathology, little is known regarding the mechanism of this pathology.
AU - Schmitt, Heather M.
AU - Fehrman, Rachel L.
AU - Maes, Margaret E
AU - Yang, Huan
AU - Guo, Lian Wang
AU - Schlamp, Cassandra L.
AU - Pelzel, Heather R.
AU - Nickells, Robert W.
ID - 10000
IS - 10
JF - Investigative Ophthalmology and Visual Science
SN - 0146-0404
TI - Increased susceptibility and intrinsic apoptotic signaling in neurons by induced HDAC3 expression
VL - 62
ER -
TY - JOUR
AB - We define quantum equivariant K-theory of Nakajima quiver varieties. We discuss type A in detail as well as its connections with quantum XXZ spin chains and trigonometric Ruijsenaars-Schneider models. Finally we study a limit which produces a K-theoretic version of results of Givental and Kim, connecting quantum geometry of flag varieties and Toda lattice.
AU - Koroteev, Peter
AU - Pushkar, Petr
AU - Smirnov, Andrey V.
AU - Zeitlin, Anton M.
ID - 9998
IS - 5
JF - Selecta Mathematica
SN - 1022-1824
TI - Quantum K-theory of quiver varieties and many-body systems
VL - 27
ER -
TY - JOUR
AB - We study systems of nonlinear partial differential equations of parabolic type, in which the elliptic operator is replaced by the first-order divergence operator acting on a flux function, which is related to the spatial gradient of the unknown through an additional implicit equation. This setting, broad enough in terms of applications, significantly expands the paradigm of nonlinear parabolic problems. Formulating four conditions concerning the form of the implicit equation, we first show that these conditions describe a maximal monotone p-coercive graph. We then establish the global-in-time and large-data existence of a (weak) solution and its uniqueness. To this end, we adopt and significantly generalize Minty’s method of monotone mappings. A unified theory, containing several novel tools, is developed in a way to be tractable from the point of view of numerical approximations.
AU - Bulíček, Miroslav
AU - Maringová, Erika
AU - Málek, Josef
ID - 10005
IS - 09
JF - Mathematical Models and Methods in Applied Sciences
KW - Nonlinear parabolic systems
KW - implicit constitutive theory
KW - weak solutions
KW - existence
KW - uniqueness
SN - 0218-2025
TI - On nonlinear problems of parabolic type with implicit constitutive equations involving flux
VL - 31
ER -
TY - JOUR
AB - Auxin has always been at the forefront of research in plant physiology and development. Since the earliest contemplations by Julius von Sachs and Charles Darwin, more than a century-long struggle has been waged to understand its function. This largely reflects the failures, successes, and inevitable progress in the entire field of plant signaling and development. Here I present 14 stations on our long and sometimes mystical journey to understand auxin. These highlights were selected to give a flavor of the field and to show the scope and limits of our current knowledge. A special focus is put on features that make auxin unique among phytohormones, such as its dynamic, directional transport network, which integrates external and internal signals, including self-organizing feedback. Accented are persistent mysteries and controversies. The unexpected discoveries related to rapid auxin responses and growth regulation recently disturbed our contentment regarding understanding of the auxin signaling mechanism. These new revelations, along with advances in technology, usher us into a new, exciting era in auxin research.
AU - Friml, Jiří
ID - 10016
JF - Cold Spring Harbor Perspectives in Biology
SN - 1943-0264
TI - Fourteen stations of auxin
ER -
TY - GEN
AB - In order to study integral points of bounded log-anticanonical height on weak del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example, we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove an analogue of Manin's conjecture for integral points with respect to its singularities and its lines.
AU - Derenthal, Ulrich
AU - Wilsch, Florian Alexander
ID - 10018
KW - Integral points
KW - del Pezzo surface
KW - universal torsor
KW - Manin’s conjecture
T2 - arXiv
TI - Integral points on singular del Pezzo surfaces
ER -
TY - THES
AB - The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.
AU - Hensel, Sebastian
ID - 10007
SN - 2663-337X
TI - Curvature driven interface evolution: Uniqueness properties of weak solution concepts
ER -
TY - GEN
AB - We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions.
AU - Hensel, Sebastian
AU - Laux, Tim
ID - 10013
T2 - arXiv
TI - Weak-strong uniqueness for the mean curvature flow of double bubbles
ER -
TY - JOUR
AB - Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2
Thr31 phosphorylation site for growth regulation in the Arabidopsis root tip.
AU - Nikonorova, N
AU - Murphy, E
AU - Fonseca de Lima, CF
AU - Zhu, S
AU - van de Cotte, B
AU - Vu, LD
AU - Balcerowicz, D
AU - Li, Lanxin
AU - Kong, X
AU - De Rop, G
AU - Beeckman, T
AU - Friml, Jiří
AU - Vissenberg, K
AU - Morris, PC
AU - Ding, Z
AU - De Smet, I
ID - 10015
JF - Cells
KW - primary root
KW - (phospho)proteomics
KW - auxin
KW - (receptor) kinase
SN - 2073-4409
TI - The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators
VL - 10
ER -
TY - CONF
AB - We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .
AU - Chatterjee, Krishnendu
AU - Dvorak, Wolfgang
AU - Henzinger, Monika
AU - Svozil, Alexander
ID - 10002
KW - Computer science
KW - Computational modeling
KW - Markov processes
KW - Probabilistic logic
KW - Formal verification
KW - Game Theory
SN - 1043-6871
T2 - Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
TI - Symbolic time and space tradeoffs for probabilistic verification
ER -
TY - CONF
AB - Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
ID - 10004
KW - Computer science
KW - Heuristic algorithms
KW - Memory management
KW - Automata
KW - Markov processes
KW - Probability distribution
KW - Complexity theory
SN - 1043-6871
T2 - Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
TI - Stochastic processes with expected stopping time
ER -
TY - CONF
AB - In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.
AU - Henzinger, Thomas A
AU - Sarac, Naci E
ID - 10003
KW - Computer science
KW - Runtime
KW - Registers
KW - Time factors
KW - Monitoring
SN - 1043-6871
T2 - Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
TI - Quantitative and approximate monitoring
ER -
TY - JOUR
AB - Aprotic alkali metal–O2 batteries face two major obstacles to their chemistry occurring efficiently, the insulating nature of the formed alkali superoxides/peroxides and parasitic reactions that are caused by the highly reactive singlet oxygen (1O2). Redox mediators are recognized to be key for improving rechargeability. However, it is unclear how they affect 1O2 formation, which hinders strategies for their improvement. Here we clarify the mechanism of mediated peroxide and superoxide oxidation and thus explain how redox mediators either enhance or suppress 1O2 formation. We show that charging commences with peroxide oxidation to a superoxide intermediate and that redox potentials above ~3.5 V versus Li/Li+ drive 1O2 evolution from superoxide oxidation, while disproportionation always generates some 1O2. We find that 1O2 suppression requires oxidation to be faster than the generation of 1O2 from disproportionation. Oxidation rates decrease with growing driving force following Marcus inverted-region behaviour, establishing a region of maximum rate.
AU - Petit, Yann K.
AU - Mourad, Eléonore
AU - Prehal, Christian
AU - Leypold, Christian
AU - Windischbacher, Andreas
AU - Mijailovic, Daniel
AU - Slugovc, Christian
AU - Borisov, Sergey M.
AU - Zojer, Egbert
AU - Brutti, Sergio
AU - Fontaine, Olivier
AU - Freunberger, Stefan Alexander
ID - 9250
IS - 5
JF - Nature Chemistry
KW - General Chemistry
KW - General Chemical Engineering
SN - 1755-4330
TI - Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation
VL - 13
ER -
TY - THES
AB - Blood – this is what animals use to heal wounds fast and efficient. Plants do not have blood circulation and their cells cannot move. However, plants have evolved remarkable capacities to regenerate tissues and organs preventing further damage. In my PhD research, I studied the wound healing in the Arabidopsis root. I used a UV laser to ablate single cells in the root tip and observed the consequent wound healing. Interestingly, the inner adjacent cells induced a
division plane switch and subsequently adopted the cell type of the killed cell to replace it. We termed this form of wound healing “restorative divisions”. This initial observation triggered the questions of my PhD studies: How and why do cells orient their division planes, how do they feel the wound and why does this happen only in inner adjacent cells.
For answering these questions, I used a quite simple experimental setup: 5 day - old seedlings were stained with propidium iodide to visualize cell walls and dead cells; ablation was carried out using a special laser cutter and a confocal microscope. Adaptation of the novel vertical microscope system made it possible to observe wounds in real time. This revealed that restorative divisions occur at increased frequency compared to normal divisions. Additionally,
the major plant hormone auxin accumulates in wound adjacent cells and drives the expression of the wound-stress responsive transcription factor ERF115. Using this as a marker gene for wound responses, we found that an important part of wound signalling is the sensing of the collapse of the ablated cell. The collapse causes a radical pressure drop, which results in strong tissue deformations. These deformations manifest in an invasion of the now free spot specifically by the inner adjacent cells within seconds, probably because of higher pressure of the inner tissues. Long-term imaging revealed that those deformed cells continuously expand towards the wound hole and that this is crucial for the restorative division. These wound-expanding cells exhibit an abnormal, biphasic polarity of microtubule arrays
before the division. Experiments inhibiting cell expansion suggest that it is the biphasic stretching that induces those MT arrays. Adapting the micromanipulator aspiration system from animal scientists at our institute confirmed the hypothesis that stretching influences microtubule stability. In conclusion, this shows that microtubules react to tissue deformation
and this facilitates the observed division plane switch. This puts mechanical cues and tensions at the most prominent position for explaining the growth and wound healing properties of plants. Hence, it shines light onto the importance of understanding mechanical signal transduction.
AU - Hörmayer, Lukas
ID - 9992
SN - 2663-337X
TI - Wound healing in the Arabidopsis root meristem
ER -
TY - JOUR
AB - When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles, which can form lamellar structures or a disordered fluid phase when temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes, while out of equilibrium, the system forms a variety of structures at different shear rates and temperatures above melting. The shear-induced ordering is analyzed by means of principal component analysis and artificial neural networks, which are applied to data of reduced dimensionality. Our results reveal the possibility of inducing ordering by shear, potentially providing a feasible route to the fabrication of ordered lamellar structures from isotropic particles.
AU - Pȩkalski, J.
AU - Rzadkowski, Wojciech
AU - Panagiotopoulos, A. Z.
ID - 7956
IS - 20
JF - The Journal of chemical physics
TI - Shear-induced ordering in systems with competing interactions: A machine learning study
VL - 152
ER -
TY - JOUR
AB - Neurodevelopmental disorders (NDDs) are a class of disorders affecting brain development and function and are characterized by wide genetic and clinical variability. In this review, we discuss the multiple factors that influence the clinical presentation of NDDs, with particular attention to gene vulnerability, mutational load, and the two-hit model. Despite the complex architecture of
mutational events associated with NDDs, the various proteins involved appear to converge on common pathways, such as synaptic plasticity/function, chromatin remodelers and the mammalian target of rapamycin (mTOR) pathway. A thorough understanding of the mechanisms behind these pathways will hopefully lead to the identification of candidates that could be targeted for treatment approaches.
AU - Parenti, Ilaria
AU - Garcia Rabaneda, Luis E
AU - Schön, Hanna
AU - Novarino, Gaia
ID - 7957
IS - 8
JF - Trends in Neurosciences
SN - 01662236
TI - Neurodevelopmental disorders: From genetics to functional pathways
VL - 43
ER -