Tyrosine phosphorylation controls brassinosteroid receptor activation by triggering membrane release of its kinase inhibitor

Receptor tyrosine kinases control many critical processes in metazoans, but these enzymes appear to be absent in plants. Recently, two Arabidopsis receptor kinases-BRASSINOSTEROID INSENSITIVE 1 (BRI1) and BRI1-ASSOCIATED KINASE1 (BAK1), the receptor and coreceptor for brassinosteroids-were shown to autophosphorylate on tyrosines. However, the cellular roles for tyrosine phosphorylation in plants remain poorly understood. Here, we report that the BRI1 KINASE INHIBITOR 1 (BKI1) is tyrosine phosphorylated in response to brassinosteroid perception. Phosphorylation occurs within a reiterated [KR][KR] membrane targeting motif, releasing BKI1 into the cytosol and enabling formation of an active signaling complex. Our work reveals that tyrosine phosphorylation is a conserved mechanism controlling protein localization in all higher organisms

Mechanistic basis for the activation of plant membrane receptor kinases by SERK-family coreceptors.

Plant-unique membrane receptor kinases with leucine-rich repeat ectodomains (LRR-RKs) can sense small molecule, peptide, and protein ligands. Many LRR-RKs require SERK-family coreceptor kinases for high-affinity ligand binding and receptor activation. How one coreceptor can contribute to the specific binding of distinct ligands and activation of different LRR-RKs is poorly understood. Here we quantitatively analyze the contribution of SERK3 to ligand binding and activation of the brassinosteroid receptor BRI1 and the peptide hormone receptor HAESA. We show that while the isolated receptors sense their respective ligands with drastically different binding affinities, the SERK3 ectodomain binds the ligand-associated receptors with very similar binding kinetics. We identify residues in the SERK3 N-terminal capping domain, which allow for selective steroid and peptide hormone recognition. In contrast, residues in the SERK3 LRR core form a second, constitutive receptor-coreceptor interface. Genetic analyses of protein chimera between BRI1 and SERK3 define that signaling-competent complexes are formed by receptor-coreceptor heteromerization in planta. A functional BRI1-HAESA chimera suggests that the receptor activation mechanism is conserved among different LRR-RKs, and that their signaling specificity is encoded in the kinase domain of the receptor. Our work pinpoints the relative contributions of receptor, ligand, and coreceptor to the formation and activation of SERK-dependent LRR-RK signaling complexes regulating plant growth and development

Probabilistic time series forecasts with autoregressive transformation models

Probabilistic forecasting of time series is an important matter in many applications and research fields. In order to draw conclusions from a probabilistic forecast, we must ensure that the model class used to approximate the true forecasting distribution is expressive enough. Yet, characteristics of the model itself, such as its uncertainty or its feature-outcome relationship are not of lesser importance. This paper proposes Autoregressive Transformation Models (ATMs), a model class inspired by various research directions to unite expressive distributional forecasts using a semi-parametric distribution assumption with an interpretable model specification. We demonstrate the properties of ATMs both theoretically and through empirical evaluation on several simulated and real-world forecasting datasets

Detecting treatment-subgroup interactions in clustered data with generalized linear mixed-effects model trees

Identification of subgroups of patients for whom treatment A is more effective than treatment B, and vice versa, is of key importance to the development of personalized medicine. Tree-based algorithms are helpful tools for the detection of such interactions, but none of the available algorithms allow for taking into account clustered or nested dataset structures, which are particularly common in psychological research. Therefore, we propose the generalized linear mixed-effects model tree (GLMM tree) algorithm, which allows for the detection of treatment-subgroup interactions, while accounting for the clustered structure of a dataset. The algorithm uses model-based recursive partitioning to detect treatment-subgroup interactions, and a GLMM to estimate the random-effects parameters. In a simulation study, GLMM trees show higher accuracy in recovering treatment-subgroup interactions, higher predictive accuracy, and lower type II error rates than linear-model-based recursive partitioning and mixed-effects regression trees. Also, GLMM trees show somewhat higher predictive accuracy than linear mixed-effects models with pre-specified interaction effects, on average. We illustrate the application of GLMM trees on an individual patient-level data meta-analysis on treatments for depression. We conclude that GLMM trees are a promising exploratory tool for the detection of treatment-subgroup interactions in clustered datasets.Article / Letter to editorInstituut Psychologi

An AUC-based Permutation Variable Importance Measure for Random Forests

The random forest (RF) method is a commonly used tool for classification with high dimensional data as well as for ranking candidate predictors based on the so-called random forest variable importance measures (VIMs). However the classification performance of RF is known to be suboptimal in case of strongly unbalanced data, i.e. data where response class sizes differ considerably. Suggestions were made to obtain better classification performance based either on sampling procedures or on cost sensitivity analyses. However to our knowledge the performance of the VIMs has not yet been examined in the case of unbalanced response classes. In this paper we explore the performance of the permutation VIM for unbalanced data settings and introduce an alternative permutation VIM based on the area under the curve (AUC) that is expected to be more robust towards class imbalance. We investigated the performance of the standard permutation VIM and of our novel AUC-based permutation VIM for different class imbalance levels using simulated data and real data. The results suggest that the standard permutation VIM loses its ability to discriminate between associated predictors and predictors not associated with the response for increasing class imbalance. It is outperformed by our new AUC-based permutation VIM for unbalanced data settings, while the performance of both VIMs is very similar in the case of balanced classes. The new AUC-based VIM is implemented in the R package party for the unbiased RF variant based on conditional inference trees. The codes implementing our study are available from the companion website: http://www.ibe.med.uni-muenchen.de/organisation/mitarbeiter/070_drittmittel/janitza/index.html

Fast calibrated additive quantile regression

We propose a novel framework for fitting additive quantile regression models, which provides well calibrated inference about the conditional quantiles and fast automatic estimation of the smoothing parameters, for model structures as diverse as those usable with distributional GAMs, while maintaining equivalent numerical efficiency and stability. The proposed methods are at once statistically rigorous and computationally efficient, because they are based on the general belief updating framework of Bissiri et al. (2016) to loss based inference, but compute by adapting the stable fitting methods of Wood et al. (2016). We show how the pinball loss is statistically suboptimal relative to a novel smooth generalisation, which also gives access to fast estimation methods. Further, we provide a novel calibration method for efficiently selecting the 'learning rate' balancing the loss with the smoothing priors during inference, thereby obtaining reliable quantile uncertainty estimates. Our work was motivated by a probabilistic electricity load forecasting application, used here to demonstrate the proposed approach. The methods described here are implemented by the qgam R package, available on the Comprehensive R Archive Network (CRAN)