Graph-Based Approaches to Protein StructureComparison - From Local to Global Similarity

The comparative analysis of protein structure data is a central aspect of structural bioinformatics. Drawing upon structural information allows the inference of function for unknown proteins even in cases where no apparent homology can be found on the sequence level. Regarding the function of an enzyme, the overall fold topology might less important than the specific structural conformation of the catalytic site or the surface region of a protein, where the interaction with other molecules, such as binding partners, substrates and ligands occurs. Thus, a comparison of these regions is especially interesting for functional inference, since structural constraints imposed by the demands of the catalyzed biochemical function make them more likely to exhibit structural similarity. Moreover, the comparative analysis of protein binding sites is of special interest in pharmaceutical chemistry, in order to predict cross-reactivities and gain a deeper understanding of the catalysis mechanism. From an algorithmic point of view, the comparison of structured data, or, more generally, complex objects, can be attempted based on different methodological principles. Global methods aim at comparing structures as a whole, while local methods transfer the problem to multiple comparisons of local substructures. In the context of protein structure analysis, it is not a priori clear, which strategy is more suitable. In this thesis, several conceptually different algorithmic approaches have been developed, based on local, global and semi-global strategies, for the task of comparing protein structure data, more specifically protein binding pockets. The use of graphs for the modeling of protein structure data has a long standing tradition in structural bioinformatics. Recently, graphs have been used to model the geometric constraints of protein binding sites. The algorithms developed in this thesis are based on this modeling concept, hence, from a computer scientist's point of view, they can also be regarded as global, local and semi-global approaches to graph comparison. The developed algorithms were mainly designed on the premise to allow for a more approximate comparison of protein binding sites, in order to account for the molecular flexibility of the protein structures. A main motivation was to allow for the detection of more remote similarities, which are not apparent by using more rigid methods. Subsequently, the developed approaches were applied to different problems typically encountered in the field of structural bioinformatics in order to assess and compare their performance and suitability for different problems. Each of the approaches developed during this work was capable of improving upon the performance of existing methods in the field. Another major aspect in the experiments was the question, which methodological concept, local, global or a combination of both, offers the most benefits for the specific task of protein binding site comparison, a question that is addressed throughout this thesis

Galectin-3 interacts with components of the nuclear ribonucleoprotein complex

Differentially spliced mRNAs following galectin‐3 depletion. (PDF 122 kb

YM155-Adapted Cancer Cell Lines Reveal Drug-Induced Heterogeneity and Enable the Identification of Biomarker Candidates for the Acquired Resistance Setting

Survivin is a drug target and its suppressant YM155 a drug candidate mainly investigated for high-risk neuroblastoma. Findings from one YM155-adapted subline of the neuroblastoma cell line UKF-NB-3 had suggested that increased ABCB1 (mediates YM155 efflux) levels, decreased SLC35F2 (mediates YM155 uptake) levels, decreased survivin levels, and TP53 mutations indicate YM155 resistance. Here, the investigation of 10 additional YM155-adapted UKF-NB-3 sublines only confirmed the roles of ABCB1 and SLC35F2. However, cellular ABCB1 and SLC35F2 levels did not indicate YM155 sensitivity in YM155-naïve cells, as indicated by drug response data derived from the Cancer Therapeutics Response Portal (CTRP) and the Genomics of Drug Sensitivity in Cancer (GDSC) databases. Moreover, the resistant sublines were characterized by a remarkable heterogeneity. Only seven sublines developed on-target resistance as indicated by resistance to RNAi-mediated survivin depletion. The sublines also varied in their response to other anti-cancer drugs. In conclusion, cancer cell populations of limited intrinsic heterogeneity can develop various resistance phenotypes in response to treatment. Therefore, individualized therapies will require monitoring of cancer cell evolution in response to treatment. Moreover, biomarkers can indicate resistance formation in the acquired resistance setting, even when they are not predictive in the intrinsic resistance setting

Choice of binding sites for CTCFL compared to CTCF is driven by chromatin and by sequence preference

The two paralogous zinc finger factors CTCF and CTCFL differ in expression such that CTCF is ubiquitously expressed, whereas CTCFL is found during spermatogenesis and in some cancer types in addition to other cell types. Both factors share the highly conserved DNA binding domain and are bound to DNA sequences with an identical consensus. In contrast, both factors differ substantially in the number of bound sites in the genome. Here, we addressed the molecular features for this binding specificity. In contrast to CTCF we found CTCFL highly enriched at 'open' chromatin marked by H3K27 acetylation, H3K4 di- and trimethylation, H3K79 dimethylation and H3K9 acetylation plus the histone variant H2A.Z. CTCFL is enriched at transcriptional start sites and regions bound by transcription factors. Consequently, genes deregulated by CTCFL are highly cell specific. In addition to a chromatin-driven choice of binding sites, we determined nucleotide positions critical for DNA binding by CTCFL, but not by CTCF

Graph-Based Approaches to Protein StructureComparison - From Local to Global Similarity

The comparative analysis of protein structure data is a central aspect of structural bioinformatics. Drawing upon structural information allows the inference of function for unknown proteins even in cases where no apparent homology can be found on the sequence level. Regarding the function of an enzyme, the overall fold topology might less important than the specific structural conformation of the catalytic site or the surface region of a protein, where the interaction with other molecules, such as binding partners, substrates and ligands occurs. Thus, a comparison of these regions is especially interesting for functional inference, since structural constraints imposed by the demands of the catalyzed biochemical function make them more likely to exhibit structural similarity. Moreover, the comparative analysis of protein binding sites is of special interest in pharmaceutical chemistry, in order to predict cross-reactivities and gain a deeper understanding of the catalysis mechanism. From an algorithmic point of view, the comparison of structured data, or, more generally, complex objects, can be attempted based on different methodological principles. Global methods aim at comparing structures as a whole, while local methods transfer the problem to multiple comparisons of local substructures. In the context of protein structure analysis, it is not a priori clear, which strategy is more suitable. In this thesis, several conceptually different algorithmic approaches have been developed, based on local, global and semi-global strategies, for the task of comparing protein structure data, more specifically protein binding pockets. The use of graphs for the modeling of protein structure data has a long standing tradition in structural bioinformatics. Recently, graphs have been used to model the geometric constraints of protein binding sites. The algorithms developed in this thesis are based on this modeling concept, hence, from a computer scientist's point of view, they can also be regarded as global, local and semi-global approaches to graph comparison. The developed algorithms were mainly designed on the premise to allow for a more approximate comparison of protein binding sites, in order to account for the molecular flexibility of the protein structures. A main motivation was to allow for the detection of more remote similarities, which are not apparent by using more rigid methods. Subsequently, the developed approaches were applied to different problems typically encountered in the field of structural bioinformatics in order to assess and compare their performance and suitability for different problems. Each of the approaches developed during this work was capable of improving upon the performance of existing methods in the field. Another major aspect in the experiments was the question, which methodological concept, local, global or a combination of both, offers the most benefits for the specific task of protein binding site comparison, a question that is addressed throughout this thesis