@article{BennHiepenOsterlandetal., author = {Benn, Andreas and Hiepen, Christian and Osterland, Marc and Sch{\"u}tte, Christof and Zwijsen, An and Knaus, Petra}, title = {Role of bone morphogenetic proteins in sprouting angiogenesis: differential BMP receptor-dependent signaling pathways balance stalk vs. tip cell competence}, series = {FASEB Journal}, volume = {31}, journal = {FASEB Journal}, number = {11}, doi = {10.1096/fj.201700193RR}, pages = {4720 -- 4733}, abstract = {Before the onset of sprouting angiogenesis, the endothelium is prepatterned for the positioning of tip and stalk cells. Both cell identities are not static, as endothelial cells (ECs) constantly compete for the tip cell position in a dynamic fashion. Here, we show that both bone morphogenetic protein (BMP) 2 and BMP6 are proangiogenic in vitro and ex vivo and that the BMP type I receptors, activin receptor-like kinase (ALK)3 and ALK2, play crucial and distinct roles in this process. BMP2 activates the expression of tip cell-associated genes, such as DLL4 (delta-like ligand 4) and KDR (kinase insert domain receptor), and p38-heat shock protein 27 (HSP27)-dependent cell migration, thereby generating tip cell competence. Whereas BMP6 also triggers collective cell migration via the p38-HSP27 signaling axis, BMP6 induces in addition SMAD1/5 signaling, thereby promoting the expression of stalk cell-associated genes, such as HES1 (hairy and enhancer of split 1) and FLT1 (fms-like tyrosine kinase 1). Specifically, ALK3 is required for sprouting from HUVEC spheroids, whereas ALK2 represses sprout formation. We demonstrate that expression levels and respective complex formation of BMP type I receptors in ECs determine stalk vs. tip cell identity, thus contributing to endothelial plasticity during sprouting angiogenesis. As antiangiogenic monotherapies that target the VEGF or ALK1 pathways have not fulfilled efficacy objectives in clinical trials, the selective targeting of the ALK2/3 pathways may be an attractive new approach.}, language = {en} } @article{HuisingaBestCordesetal.1999, author = {Huisinga, Wilhelm and Best, Christoph and Cordes, Frank and Roitzsch, Rainer and Sch{\"u}tte, Christof}, title = {Identification of Molecular Conformations via Statistical Analysis of Simulation Data}, series = {Comp. Chem.}, volume = {20}, journal = {Comp. Chem.}, pages = {1760 -- 1774}, year = {1999}, language = {en} } @article{vonKleistSchuetteZhang, author = {von Kleist, Max and Sch{\"u}tte, Christof and Zhang, Wei}, title = {Statistical analysis of the first passage path ensemble of jump processes}, series = {Journal of Statistical Physics}, volume = {170}, journal = {Journal of Statistical Physics}, doi = {10.1007/s10955-017-1949-x}, pages = {809 -- 843}, abstract = {The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study the first passage path ensemble of both discrete-time and continuous-time jump processes on a finite state space. The main approach is to divide each first passage path into nonreactive and reactive segments and to study them separately. The analysis can be applied to jump processes which are non-ergodic, as well as continuous-time jump processes where the waiting time distributions are non-exponential. In the particular case that the jump processes are both Markovian and ergodic, our analysis elucidates the relations between the study of the first passage paths and the study of the transition paths in transition path theory. We provide algorithms to numerically compute statistics of the first passage path ensemble. The computational complexity of these algorithms scales with the complexity of solving a linear system, for which efficient methods are available. Several examples demonstrate the wide applicability of the derived results across research areas.}, language = {en} } @misc{OsterlandBennProhaskaetal., author = {Osterland, Marc and Benn, Andreas and Prohaska, Steffen and Sch{\"u}tte, Christof}, title = {Single Cell Tracking in Phase-Contrast Microscopy}, series = {EMBL Symposium 2015 - Seeing is Believing - Imaging the Processes of Life}, journal = {EMBL Symposium 2015 - Seeing is Believing - Imaging the Processes of Life}, abstract = {In this work, we developed an automatic algorithm to analyze cell migration in chemotaxis assays, based on phase-contrast time-lapse microscopy. While manual approaches are still widely used in recent publications, our algorithm is able to track hundreds of single cells per frame. The extracted paths are analysed with traditional geometrical approaches as well as diffusion-driven Markov state models (MSM). Based on these models, a detailed view on spatial and temporal effects is possible. Using our new approach on experimental data, we are able to distinguish between directed migration (e.g. towards a VEGF gradient) and random migration without favored direction. A calculation of the committor probabilities reveals that cells of the whole image area are more likely to migrate directly towards the VEGF than away from it during the first four hours. However, in absence of a chemoattractant, cells migrate more likely to their nearest image border. These conclusions are supported by the spatial mean directions. In a next step, the cell-cell interaction during migration and the migration of cell clusters will be analyzed. Furthermore, we want to observe phenotypical changes during migration based on fluorescence microscopy and machine learning. The algorithm is part of a collaborative platform which brings the experimental expertise of scientists from life sciences and the analytical knowledge of computer scientists together. This platform is built using web-based technologies with a responsive real-time user interface. All data, including raw and metadata as well as the accompanying results, will be stored in a secure and scalable compute cluster. The compute cluster provides sufficient space and computational power for modern image-based experiments and their analyses. Specific versions of data and results can be tagged to keep immutable records for archival.}, language = {en} } @misc{HorenkoSchmidtEhrenbergSchuette2006, author = {Horenko, Illia and Schmidt-Ehrenberg, Johannes and Sch{\"u}tte, Christof}, title = {Set-oriented dimension reduction: Localizing principal component analysis via hidden Markov models}, series = {Computational Life Sciences II}, volume = {4216}, journal = {Computational Life Sciences II}, publisher = {Springer}, pages = {98 -- 115}, year = {2006}, language = {en} } @article{ShaoBjaanaesHellandetal., author = {Shao, Borong and Bjaanaes, Maria and Helland, Aslaug and Sch{\"u}tte, Christof and Conrad, Tim}, title = {EMT network-based feature selection improves prognosis prediction in lung adenocarcinoma}, series = {PLOS ONE}, volume = {14}, journal = {PLOS ONE}, number = {1}, doi = {10.1371/journal.pone.0204186}, abstract = {Various feature selection algorithms have been proposed to identify cancer prognostic biomarkers. In recent years, however, their reproducibility is criticized. The performance of feature selection algorithms is shown to be affected by the datasets, underlying networks and evaluation metrics. One of the causes is the curse of dimensionality, which makes it hard to select the features that generalize well on independent data. Even the integration of biological networks does not mitigate this issue because the networks are large and many of their components are not relevant for the phenotype of interest. With the availability of multi-omics data, integrative approaches are being developed to build more robust predictive models. In this scenario, the higher data dimensions create greater challenges. We proposed a phenotype relevant network-based feature selection (PRNFS) framework and demonstrated its advantages in lung cancer prognosis prediction. We constructed cancer prognosis relevant networks based on epithelial mesenchymal transition (EMT) and integrated them with different types of omics data for feature selection. With less than 2.5\% of the total dimensionality, we obtained EMT prognostic signatures that achieved remarkable prediction performance (average AUC values above 0.8), very significant sample stratifications, and meaningful biological interpretations. In addition to finding EMT signatures from different omics data levels, we combined these single-omics signatures into multi-omics signatures, which improved sample stratifications significantly. Both single- and multi-omics EMT signatures were tested on independent multi-omics lung cancer datasets and significant sample stratifications were obtained.}, language = {en} } @article{ConradGenzelCvetkovicetal., author = {Conrad, Tim and Genzel, Martin and Cvetkovic, Nada and Wulkow, Niklas and Vybiral, Jan and Kutyniok, Gitta and Sch{\"u}tte, Christof}, title = {Sparse Proteomics Analysis - a compressed sensing-based approach for feature selection and classification of high-dimensional proteomics mass spectrometry data}, series = {BMC Bioinformatics}, volume = {18}, journal = {BMC Bioinformatics}, number = {160}, doi = {10.1186/s12859-017-1565-4}, pages = {1 -- 20}, abstract = {Motivation: High-throughput proteomics techniques, such as mass spectrometry (MS)-based approaches, produce very high-dimensional data-sets. In a clinical setting one is often interested how MS spectra dier between patients of different classes, for example spectra from healthy patients vs. spectra from patients having a particular disease. Machine learning algorithms are needed to (a) identify these discriminating features and (b) classify unknown spectra based on this feature set. Since the acquired data is usually noisy, the algorithms should be robust to noise and outliers, and the identied feature set should be as small as possible. Results: We present a new algorithm, Sparse Proteomics Analysis (SPA), based on the theory of Compressed Sensing that allows to identify a minimal discriminating set of features from mass spectrometry data-sets. We show how our method performs on artificial and real-world data-sets.}, language = {en} } @article{ConradGenzelCvetkovicetal., author = {Conrad, Tim and Genzel, Martin and Cvetkovic, Nada and Wulkow, Niklas and Leichtle, Alexander Benedikt and Vybiral, Jan and Kytyniok, Gitta and Sch{\"u}tte, Christof}, title = {Sparse Proteomics Analysis - a compressed sensing-based approach for feature selection and classification of high-dimensional proteomics mass spectrometry data}, series = {BMC Bioinfomatics}, volume = {18}, journal = {BMC Bioinfomatics}, number = {160}, doi = {10.1186/s12859-017-1565-4}, abstract = {Background: High-throughput proteomics techniques, such as mass spectrometry (MS)-based approaches, produce very high-dimensional data-sets. In a clinical setting one is often interested in how mass spectra differ between patients of different classes, for example spectra from healthy patients vs. spectra from patients having a particular disease. Machine learning algorithms are needed to (a) identify these discriminating features and (b) classify unknown spectra based on this feature set. Since the acquired data is usually noisy, the algorithms should be robust against noise and outliers, while the identified feature set should be as small as possible. Results: We present a new algorithm, Sparse Proteomics Analysis (SPA),based on thet heory of compressed sensing that allows us to identify a minimal discriminating set of features from mass spectrometry data-sets. We show (1) how our method performs on artificial and real-world data-sets, (2) that its performance is competitive with standard (and widely used) algorithms for analyzing proteomics data, and (3) that it is robust against random and systematic noise. We further demonstrate the applicability of our algorithm to two previously published clinical data-sets.}, language = {en} } @article{VegaSchuetteConrad, author = {Vega, Iliusi and Sch{\"u}tte, Christof and Conrad, Tim}, title = {Finding metastable states in real-world time series with recurrence networks}, series = {Physica A: Statistical Mechanics and its Applications}, volume = {445}, journal = {Physica A: Statistical Mechanics and its Applications}, doi = {10.1016/j.physa.2015.10.041}, pages = {1 -- 17}, abstract = {In the framework of time series analysis with recurrence networks, we introduce a self-adaptive method that determines the elusive recurrence threshold and identifies metastable states in complex real-world time series. As initial step, we introduce a way to set the embedding parameters used to reconstruct the state space from the time series. We set them as the ones giving the maximum Shannon entropy of the diagonal line length distribution for the first simultaneous minima of recurrence rate and Shannon entropy. To identify metastable states, as well as the transitions between them, we use a soft partitioning algorithm for module finding which is specifically developed for the case in which a system shows metastability. We illustrate our method with a complex time series example. Finally, we show the robustness of our method for identifying metastable states. Our results suggest that our method is robust for identifying metastable states in complex time series, even when introducing considerable levels of noise and missing data points.}, language = {en} } @misc{SchuetteConrad, author = {Sch{\"u}tte, Christof and Conrad, Tim}, title = {Showcase 3: Information-based medicine}, series = {MATHEON-Mathematics for Key Technologies}, volume = {1}, journal = {MATHEON-Mathematics for Key Technologies}, editor = {Deuflhard, Peter and Gr{\"o}tschel, Martin and H{\"o}mberg, Dietmar and Horst, Ulrich and Kramer, J{\"u}rg and Mehrmann, Volker and Polthier, Konrad and Schmidt, Frank and Skutella, Martin and Sprekels, J{\"u}rgen}, publisher = {European Mathematical Society}, pages = {66 -- 67}, language = {en} }