Open Access

Tafazzin is an acyltransferase with key functions in remodeling of the mitochondrial phospholipid cardiolipin (CL) by exchanging single fatty acids species in CL. Tafazzin-mediated CL remodeling determines the actual CL compositions and has been implicated in mitochondrial morphology and function. Thus, any deficiency of tafazzin leads to altered fatty acid composition of CL which is directly associated with impaired mitochondrial respiration and ATP production. Mutations in the tafazzin encoding gene TAZ, are the cause of the severe X-linked genetic disease, BARTH syndrome (BTHS). Previous work provided first hints on a linkage of CL composition and subsequent limitations in the cellular ATP levels which may contribute to the restriction of growth. However, in C6 cells ATP levels remained unaltered due to compensatory activation of glycolysis. Moreover, it has been demonstrated that the substantial changes in CL composition are similarly resulting from knocking down either cardiolipin synthase (CRLS) or TAZ. This has also been shown in C6 glioma cells. Most notably only the knock down of TAZ, but not that of CRLS, compromised proliferation of C6 glioma cells. Therefore, a CL- independent role of TAZ in regulating cell proliferation is postulated. In this study, any linkage of the lack of tafazzin to cellular proliferation should be investigated in more detail to allow first insight into underlying mechanisms. The results of the current study demonstrate that the tafazzin knockout in C6 glioma cells show changes in global gene expression by applying transcriptome analysis using the- microarray Clarion S rat Affymetrix array. Out of 22,076 total number of genes detected, 1,099 genes were differentially expressed in C6 knockout cells which were either ≥2 and ≥4 fold up or down regulated genes. Furthermore, expression of selected target genes was validated using RT-qPCR. We have hypothesised that the changes in TAZ dependent gene expression is via PPAR transcription factor. According to eukaryotic promoter database (EPD) for selected target genes, exhibited at least one putative binding site for PPARG and PPARA transcription factors. However, pioglitazone and LG100268, synthetic ligands of PPARG and RXR, could not show any effect on changes in gene expression in C6 TAZ cells. Another class of cellular lipids, oxylipins were found to occur in significantly higher amounts in C6 TAZ cells compared to C6 cells which makes them candidates for mediating cellular effects and regulating gene expression via PPARs. A computational tool CiiiDER was used to for the prediction of transcription factor binding site. The transcription factors enriched in TAZ- regulated genes were found to be HOXA5 and PAX2, binding sites of which could be detected in 100 % of TAZ- regulated genes (>2-fold). By applying IPA to the differentially expressed genes we could identify lipid metabolism, and cholesterol superpathway in particular as the most affected pathway in C6 TAZ cells. This pathway consists of 20 genes, of which all (20/20) appeared to be differentially regulated in C6 TAZ cells. Of all the 20 genes, 4 of the differentially expressed genes were selected for further validation by RT-qPCR. By IPA it was possible to identify the upstream regulators that might be responsible for the differential expression of genes in C6 deficient cells. Some of the genes ACACA, HMGCR, FASN, ACSL1, 3 and, 5 identified was decreased by predicted activation and inhibition of the regulators. Further we have analysed the levels of cellular cholesterol content in C6 and C6 TAZ (w/o Δ5 and FL) cells. In C6 cells cholesterol is present more in its free form. C6 TAZ cells have increased amount of cholesterol compared to C6 cells. However, Δ5 and FL expressed C6 TAZ cells showed less amount of cholesterol. Previous work established that knockout of tafazzin in C6 cells showed decreased cell proliferation in the absence of any changes in ATP content. To understand this phenomenon cellular senescence associated β-galactosidase in C6 and C6 TAZ cells was performed. C6 TAZ cells showed increased percentage of β-gal positive cells compared to C6 cells. Moreover, senescent associated secretory phenotype (SASP) represented by e.g. CXCL1, IL6, and IL1α was determined using RT-qPCR. Gene expression of these SASP factors was significantly upregulated in C6 TAZ cells. Several human tafazzin isoforms exists due to alternate splicing. However, whether these isoforms differ in function and in CL remodelling activity or specificity, in particular, is unknown. The purpose of this work was to determine if specific isoforms, such as human isoform lacking exon 5 (Δ5), rat full length tafazzin (FL) and enzymatically dead full length tafazzin (H69L), can restore the wild type phenotype in terms of CL composition, cellular proliferation, and gene expression profile. Therefore, in the second part, it was demonstrated that expression of Δ5 to some extent and rat full length tafazzin can completely restore CL composition, in C6 TAZ cells which is naturally linked to the restoration of mitochondrial respiration. As expected, a comparable restoration of CL composition could not be seen after re-expressing an enzymatically dead full-length rat TAZ, (H69L; TAZ Mut). Furthermore, re-expression of the TAZ Mut largely failed to reverse the alterations in gene expression, in contrast re-expression of the TAZ FL and the Δ5 isoforms reversed gene expression to a larger extent. Moreover, only rat full length TAZ was able to reverse proliferation rate. Surprisingly, the expression of Δ5 in C6 TAZ cells did not promote proliferation of the wild type. Different effects of Δ5 and FL on CL composition and cell proliferation points to the specific and in part non-enzymatic functions of tafazzin isoforms, but this certainly requires further analysis.

Liver diseases are important causes of morbidity and mortality worldwide. The aim of this study was to identify differentially expressed microRNAs (miRNAs), target genes, and key pathways as innovative diagnostic biomarkers in liver patients with different pathology and functional state. We determined, using RT-qPCR, the expression of 472 miRNAs in 125 explanted livers from subjects with six different liver pathologies and from control livers. ANOVA was employed to obtain differentially expressed miRNAs (DEMs), and miRDB (MicroRNA target prediction database) was used to predict target genes. A miRNA–gene differential regulatory (MGDR) network was constructed for each condition. Key miRNAs were detected using topological analysis. Enrichment analysis for DEMs was performed using the Database for Annotation, Visualization, and Integrated Discovery (DAVID). We identified important DEMs common and specific to the different patient groups and disease progression stages. hsa-miR-1275 was universally downregulated regardless the disease etiology and stage, while hsa-let-7a*, hsa-miR-195, hsa-miR-374, and hsa-miR-378 were deregulated. The most significantly enriched pathways of target genes controlled by these miRNAs comprise p53 tumor suppressor protein (TP53)-regulated metabolic genes, and those involved in regulation of methyl-CpG-binding protein 2 (MECP2) expression, phosphatase and tensin homolog (PTEN) messenger RNA (mRNA) translation and copper homeostasis. Our findings show a novel panel of deregulated miRNAs in the liver tissue from patients with different liver pathologies. These miRNAs hold potential as biomarkers for diagnosis and staging of liver diseases.

Neutrophils readily infiltrate infection foci, phagocytose and usually destroy microbes. In tuberculosis (TB), a chronic pulmonary infection caused by Mycobacterium tuberculosis (Mtb), neutrophils harbor bacilli, are abundant in tissue lesions, and their abundances in blood correlate with poor disease outcomes in patients. The biology of these innate immune cells in TB is complex. Neutrophils have been assigned host-beneficial as well as deleterious roles. The short lifespan of neutrophils purified from blood poses challenges to cell biology studies, leaving intracellular biological processes and the precise consequences of Mtb–neutrophil interactions ill-defined. The phenotypic heterogeneity of neutrophils, and their propensity to engage in cellular cross-talk and to exert various functions during homeostasis and disease, have recently been reported, and such observations are newly emerging in TB. Here, we review the interactions of neutrophils with Mtb, including subcellular events and cell fate upon infection, and summarize the cross-talks between neutrophils and lung-residing and -recruited cells. We highlight the roles of neutrophils in TB pathophysiology, discussing recent findings from distinct models of pulmonary TB, and emphasize technical advances that could facilitate the discovery of novel neutrophil-related disease mechanisms and enrich our knowledge of TB pathogenesis

Influenza A Virus (IAV) infection followed by bacterial pneumonia often leads to hospitalization and death in individuals from high risk groups. Following infection, IAV triggers the process of viral RNA replication which in turn disrupts healthy gut microbial community, while the gut microbiota plays an instrumental role in protecting the host by evolving colonization resistance. Although the underlying mechanisms of IAV infection have been unraveled, the underlying complex mechanisms evolved by gut microbiota in order to induce host immune response following IAV infection remain evasive. In this work, we developed a novel Maximal-Clique based Community Detection algorithm for Weighted undirected Networks (MCCD-WN) and compared its performance with other existing algorithms using three sets of benchmark networks. Moreover, we applied our algorithm to gut microbiome data derived from fecal samples of both healthy and IAV-infected pigs over a sequence of time-points. The results we obtained from the real-life IAV dataset unveil the role of the microbial families Ruminococcaceae, Lachnospiraceae, Spirochaetaceae and Prevotellaceae in the gut microbiome of the IAV-infected cohort. Furthermore, the additional integration of metaproteomic data enabled not only the identification of microbial biomarkers, but also the elucidation of their functional roles in protecting the host following IAV infection. Our network analysis reveals a fast recovery of the infected cohort after the second IAV infection and provides insights into crucial roles of Desulfovibrionaceae and Lactobacillaceae families in combating Influenza A Virus infection. Source code of the community detection algorithm can be downloaded from https://github.com/AniBhar84/MCCD-WN.

Universal products provide an axiomatic framework to study noncommutative independences general enough to include, besides the well known "single-faced" case (i.e., tensor, free, Boolean, monotone and antimonotone independence), also more recent "multi-faced" examples like bifree independence. Questions concerning classification have been fully answered in the single-faced case, but are in general still open in the multi-faced case. In this thesis we discuss how one can use insights in the relation between universal products and their associated moment-cumulant formula as a starting point towards a combinatorial approach to (multi-faced) universal products. We define certain classes of partitions and discuss why the defining axioms are sufficient to associate to each of them a multi-faced universal product. For the two-faced case we present our result that every positive and symmetric universal product can be produced in this fashion and we outline how these results might contribute to a classification of positive and symmetric universal products.

Simple Summary Monitoring animal behavior provides an indicator of their health and welfare. For this purpose, video surveillance is an important method to get an unbiased insight into behavior, as animals often show different behavior in the presence of humans. However, manual analysis of video data is costly and time-consuming. For this reason, we present a method for automated analysis using computer vision—a method for teaching the computer to see like a human. In this study, we use computer vision to detect red foxes and their body posture (lying, sitting, or standing). With this data we are able to monitor the animals, determine their activity, and identify their behavior. Abstract The behavior of animals is related to their health and welfare status. The latter plays a particular role in animal experiments, where continuous monitoring is essential for animal welfare. In this study, we focus on red foxes in an experimental setting and study their behavior. Although animal behavior is a complex concept, it can be described as a combination of body posture and activity. To measure body posture and activity, video monitoring can be used as a non-invasive and cost-efficient tool. While it is possible to analyze the video data resulting from the experiment manually, this method is time consuming and costly. We therefore use computer vision to detect and track the animals over several days. The detector is based on a neural network architecture. It is trained to detect red foxes and their body postures, i.e., ‘lying’, ‘sitting’, and ‘standing’. The trained algorithm has a mean average precision of 99.91%. The combination of activity and posture results in nearly continuous monitoring of animal behavior. Furthermore, the detector is suitable for real-time evaluation. In conclusion, evaluating the behavior of foxes in an experimental setting using computer vision is a powerful tool for cost-efficient real-time monitoring.

This cumulative thesis describes contributions to the field of interpretable machine learning in the healthcare domain. Three research articles are presented that lie at the intersection of biomedical and machine learning research. They illustrate how incorporating latent structure can provide a valuable compression of the information hidden in complex healthcare data. Methodologically, this thesis gives an overview of interpretable machine learning and the discovery of latent structure, including clusters, latent factors, graph structure, and hierarchical structure. Different workflows are developed and applied to two main types of complex healthcare data (cohort study data and time-resolved molecular data). The core result builds on Bayesian networks, a type of probabilistic graphical model. On the application side, we provide accurate predictive or discriminative models focusing on relevant medical conditions, related biomarkers, and their interactions.

Knowledge on the occurrence of pathogenic tick-borne bacteria Anaplasma phagocytophilum and Anaplasma ovis is scarce in sheep from Germany. In 2020, owners from five flocks reported ill thrift lambs and ewes with tick infestation. Out of 67 affected sheep, 55 animals were clinically examined and hematological values, blood chemistry and fecal examinations were performed to investigate the underlying disease causes. Serological tests (cELISA, IFAT) and qPCR were applied to all affected sheep to rule out A. phagocytophilum and A. ovis as a differential diagnosis. Ticks were collected from selected pastures and tested by qPCR. Most animals (n = 43) suffered from selenium deficiency and endoparasites were detected in each flock. Anaplasma spp. antibodies were determined in 59% of examined sheep. Seventeen animals tested positive for A. phagocytophilum by qPCR from all flocks and A. phagocytophilum was also detected in eight pools of Ixodes ricinus. Anaplasma phagocytophilum isolates from sheep and ticks were genotyped using three genes (16S rRNA, msp4 and groEL). Anaplasma ovis DNA was identified in six animals from one flock. Clinical, hematological and biochemical changes were not significantly associated with Anaplasma spp. infection. The 16S rRNA analysis revealed known variants of A. phagocytophilum, whereas the msp4 and groEL showed new genotypes. Further investigations are necessary to evaluate the dissemination and health impact of both pathogens in the German sheep population particularly in case of comorbidities.

Abstract Cellular stress has been associated with inflammation, yet precise underlying mechanisms remain elusive. In this study, various unrelated stress inducers were employed to screen for sensors linking altered cellular homeostasis and inflammation. We identified the intracellular pattern recognition receptors NOD1/2, which sense bacterial peptidoglycans, as general stress sensors detecting perturbations of cellular homeostasis. NOD1/2 activation upon such perturbations required generation of the endogenous metabolite sphingosine‐1‐phosphate (S1P). Unlike peptidoglycan sensing via the leucine‐rich repeats domain, cytosolic S1P directly bound to the nucleotide binding domains of NOD1/2, triggering NF‐κB activation and inflammatory responses. In sum, we unveiled a hitherto unknown role of NOD1/2 in surveillance of cellular homeostasis through sensing of the cytosolic metabolite S1P. We propose S1P, an endogenous metabolite, as a novel NOD1/2 activator and NOD1/2 as molecular hubs integrating bacterial and metabolic cues.

Phytopathogenic Verticillia cause Verticillium wilt on numerous economically important crops. Plant infection begins at the roots, where the fungus is confronted with rhizosphere inhabiting bacteria. The effects of different fluorescent pseudomonads, including some known biocontrol agents of other plant pathogens, on fungal growth of the haploid Verticillium dahliae and/or the amphidiploid Verticillium longisporum were compared on pectin-rich medium, in microfluidic interaction channels, allowing visualization of single hyphae, or on Arabidopsis thaliana roots. We found that the potential for formation of bacterial lipopeptide syringomycin resulted in stronger growth reduction effects on saprophytic Aspergillus nidulans compared to Verticillium spp. A more detailed analyses on bacterial-fungal co-cultivation in narrow interaction channels of microfluidic devices revealed that the strongest inhibitory potential was found for Pseudomonas protegens CHA0, with its inhibitory potential depending on the presence of the GacS/GacA system controlling several bacterial metabolites. Hyphal tip polarity was altered when V. longisporum was confronted with pseudomonads in narrow interaction channels, resulting in a curly morphology instead of straight hyphal tip growth. These results support the hypothesis that the fungus attempts to evade the bacterial confrontation. Alterations due to co-cultivation with bacteria could not only be observed in fungal morphology but also in fungal transcriptome. P. protegens CHA0 alters transcriptional profiles of V. longisporum during 2 h liquid media co-cultivation in pectin-rich medium. Genes required for degradation of and growth on the carbon source pectin were down-regulated, whereas transcripts involved in redox processes were up-regulated. Thus, the secondary metabolite mediated effect of Pseudomonas isolates on Verticillium species results in a complex transcriptional response, leading to decreased growth with precautions for self-protection combined with the initiation of a change in fungal growth direction. This interplay of bacterial effects on the pathogen can be beneficial to protect plants from infection, as shown with A. thaliana root experiments. Treatment of the roots with bacteria prior to infection with V. dahliae resulted in a significant reduction of fungal root colonization. Taken together we demonstrate how pseudomonads interfere with the growth of Verticillium spp. and show that these bacteria could serve in plant protection.

Abstract The expected signature is an analogue of the Laplace transform for probability measures on rough paths. A key question in the area has been to identify a general condition to ensure that the expected signature uniquely determines the measures. A sufficient condition has recently been given by Chevyrev and Lyons and requires a strong upper bound on the expected signature. While the upper bound was verified for many well‐known processes up to a deterministic time, it was not known whether the required bound holds for random time. In fact, even the simplest case of Brownian motion up to the exit time of a planar disc was open. For this particular case we answer this question using a suitable hyperbolic projection of the expected signature. The projection satisfies a three‐dimensional system of linear PDEs, which (surprisingly) can be solved explicitly, and which allows us to show that the upper bound on the expected signature is not satisfied.

Abstract With the advent of molecular genetic methods, an increasing number of morphologically cryptic taxa has been discovered. The majority of them, however, remains formally undescribed and without a proper name although their importance in ecology and evolution is increasingly being acknowledged. Despite suggestions to complement traditional descriptions with genetic characters, the taxonomic community appears to be reluctant to adopt this proposition. As an incentive, we introduce QUIDDICH, a tool for the QUick IDentification of DIgnostic CHaracters, which automatically scans a DNA or amino acid alignment for those columns that allow to distinguish taxa and classifies them into four different types of diagnostic characters. QUIDDICH is a system‐independent, fast and user‐friendly tool that requires few manual steps and provides a comprehensive output, which can be included in formal taxonomic descriptions. Thus, cryptic taxa do not have to remain in taxonomic crypsis and, bearing a proper name, can readily be included in biodiversity assessments and ecological and evolutionary analyses. QUIDDICH can be obtained from the comprehensive R archive network (CRAN, https://cran.r-project.org/package=quiddich).

A common task in natural sciences is to describe, characterize, and infer relations between discrete objects. A set of relations E on a set of objects V can naturally be expressed as a graph G = (V, E). It is therefore often convenient to formalize problems in natural sciences as graph theoretical problems. In this thesis we will examine a number of problems found in life sciences in particular, and show how to use graph theoretical concepts to formalize and solve the presented problems. The content of the thesis is a collection of papers all solving separate problems that are relevant to biology or biochemistry. The first paper examines problems found in self-assembling protein design. Designing polypeptides, composed of concatenated coiled coil units, to fold into polyhedra turns out to be intimately related to the concept of 1-face embeddings in graph topology. We show that 1-face embeddings can be canonicalized in linear time and present algorithms to enumerate pairwise non-isomorphic 1-face embeddings in orientable surfaces. The second and third paper examine problems found in evolutionary biology. In particular, they focus on inferring gene and species trees directly from sequence data without any a priori knowledge of the trees topology. The second paper characterize when gene trees can be inferred from estimates of orthology, paralogy and xenology relations when only partial information is available. Using this characterization an algorithm is presented that constructs a gene tree consistent with the estimates in polynomial time, if one exists. The shown algorithm is used to experimentally show that gene trees can be accurately inferred even in the case that only 20$\%$ of the relations are known. The third paper explores how to reconcile a gene tree with a species tree in a biologically feasible way, when the events of the gene tree are known. Biologically feasible reconciliations are characterized using only the topology of the gene and species tree. Using this characterization an algorithm is shown that constructs a biologically feasible reconciliation in polynomial time, if one exists. The fourth and fifth paper are concerned with with the analysis of automatically generated reaction networks. The fourth paper introduces an algorithm to predict thermodynamic properties of compounds in a chemistry. The algorithm is based on the well known group contribution methods and will automatically infer functional groups based on common structural motifs found in a set of sampled compounds. It is shown experimentally that the algorithm can be used to accurately predict a variety of molecular properties such as normal boiling point, Gibbs free energy, and the minimum free energy of RNA secondary structures. The fifth and final paper presents a framework to track atoms through reaction networks generated by a graph grammar. Using concepts found in semigroup theory, the paper defines the characteristic monoid of a reaction network. It goes on to show how natural subsystems of a reaction network organically emerge from the right Cayley graph of said monoid. The applicability of the framework is proven by applying it to the design of isotopic labeling experiments as well as to the analysis of the TCA cycle.

In this thesis, we elaborate upon Bayesian changepoint analysis, whereby our focus is on three big topics: approximate sampling via MCMC, exact inference and uncertainty quantification. Besides, modeling matters are discussed in an ongoing fashion. Our findings are underpinned through several changepoint examples with a focus on a well-log drilling data.

Given a manifold with a string structure, we construct a spinor bundle on its loop space. Our construction is in analogy with the usual construction of a spinor bundle on a spin manifold, but necessarily makes use of tools from infinite dimensional geometry. We equip this spinor bundle on loop space with an action of a bundle of Clifford algebras. Given two smooth loops in our string manifold that share a segment, we can construct a third loop by deleting this segment. If this third loop is smooth, then we say that the original pair of loops is a pair of compatible loops. It is well-known that this operation of fusing compatible loops is important if one wants to understand the geometry of a manifold through its loop space. In this work, we explain in detail how the spinor bundle on loop space behaves with respect to fusion of compatible loops. To wit, we construct a family of fusion isomorphisms indexed by pairs of compatible loops in our string manifold. Each of these fusion isomorphisms is an isomorphism from the relative tensor product of the fibres of the spinor bundle over its index pair of compatible loops to the fibre over the loop that is the result of fusing the index pair. The construction of a spinor bundle on loop space equipped with a fusion product as above was proposed by Stolz and Teichner with the goal of studying the Dirac operator on loop space". Our construction combines facets of the theory of bimodules for von Neumann algebras, infinite dimensional manifolds, and Lie groups and their representations. We moreover place our spinor bundle on loop space in the context of bundle gerbes and bundle gerbe modules.

Self-affine tiles and fractals are known as examples in analysis and topology, as models of quasicrystals and biological growth, as unit intervals of generalized number systems, and as attractors of dynamical systems. The author has implemented a software which can find new examples and handle big databases of self-affine fractals. This thesis establishes the algebraic foundation of the algorithms of the IFStile package. Lifting and projection of algebraic and rational iterated function systems and many properties of the resulting attractors are discussed.

As the tree of life is populated with sequenced genomes ever more densely, the new challenge is the accurate and consistent annotation of entire clades of genomes. In my dissertation, I address this problem with a new approach to comparative gene finding that takes a multiple genome alignment of closely related species and simultaneously predicts the location and structure of protein-coding genes in all input genomes, thereby exploiting negative selection and sequence conservation. The model prefers potential gene structures in the different genomes that are in agreement with each other, or—if not—where the exon gains and losses are plausible given the species tree. The multi-species gene finding problem is formulated as a binary labeling problem on a graph. The resulting optimization problem is NP hard, but can be efficiently approximated using a subgradient-based dual decomposition approach. I tested the novel approach on whole-genome alignments of 12 vertebrate and 12 Drosophila species. The accuracy was evaluated for human, mouse and Drosophila melanogaster and compared to competing methods. Results suggest that the new method is well-suited for annotation of a large number of genomes of closely related species within a clade, in particular, when RNA-Seq data are available for many of the genomes. The transfer of existing annotations from one genome to another via the genome alignment is more accurate than previous approaches that are based on protein-spliced alignments, when the genomes are at close to medium distances. The method is implemented in C++ as part of the gene finder AUGUSTUS.

We consider Iterated Function Systems (IFS) on the real line and on the complex plane. Every IFS defines a self-similar measure supported on a self-similar set. We study the transfer operator (which acts on the space of continuous functions on the self-similar set) and the Hutchinson operator (which acts on the space of Borel regular measures on the self-similar set). We show that the transfer operator has an infinitely countable set of polynomial eigenfunctions. These eigenfunctions can be regarded as generalized Bernoulli polynomials. The polynomial eigenfuctions define a polynomial approximation of the self-similar measure. We also study the moments of the self-similar measure and give recursions for computing them. Further, we develop a numerical method based on Markov chains to study the spectrum of the Hutchinson and transfer operators. This method provides numerical approximations of the invariant measure for which we give error bounds in terms of the Wasserstein-distance. The standard example in this thesis is the parametric family of Bernoulli convolutions.

The history of Mathematics has been lead in part by the desire for generalization: once an object was given and had been understood, there was the desire to find a more general version of it, to fit it into a broader framework. Noncommutative Mathematics fits into this description, as its interests are objects analoguous to vector spaces, or probability spaces, etc., but without the commonsense interpretation that those latter objects possess. Indeed, a space can be described by its points, but also and equivalently, by the set of functions on this space. This set is actually a commutative algebra, sometimes equipped with some more structure: *-algebra, C*-algebra, von Neumann algebras, Hopf algebras, etc. The idea that lies at the basis of noncommutative Mathematics is to replace such algebras by algebras that are not necessarily commutative any more and to interpret them as "algebras of functions on noncommutative spaces". Of course, these spaces do not exist independently from their defining algebras, but facts show that a lot of the results holding in (classical) probability or (classical) group theory can be extended to their noncommutative counterparts, or find therein powerful analogues. The extensions of group theory into the realm of noncommutative Mathematics has long been studied and has yielded the various quantum groups. The easiest version of them, the compact quantum groups, consist of C*-algebras equipped with a *-homomorphism &Delta with values in the tensor product of the algebra with itself and verifying some coassociativity condition. It is also required that the compact quantum group verifies what is known as quantum cancellation property. It can be shown that (classical) compact groups are indeed a particular case of compact quantum groups. The area of compact quantum groups, and of quantum groups at large, is a fruitful area of research. Nevertheless, another generalization of group theory could be envisioned, namely by taking a comultiplication &Delta taking values not in the tensor product but rather in the free product (in the category of unital *-algebras). This leads to the theory of dual groups in the sense of Voiculescu, also called H-algebras by Zhang. These objects have not been so thoroughly studied as their quantum counterparts. It is true that they are not so flexible and that we therefore do not know many examples of them and showing that some relations cannot exist in the dual group case because they do not pass the coproduct. Nevertheless, I have been interested during a great part of my PhD work by these objects and I have made some progress towards their understanding, especially regarding quantum Lévy processes defined on them and Haar states.

Today the process of improving technology and software allows to create, save and explore massive data sets in little time. "Big Data" are everywhere such as in social networks, meteorology, customers’ behaviour – and in biology. The Omics research field, standing for the organism-wide data exploration and analysis, is an example of biological research that has to deal with "Big Data" challenges. Possible challenges are for instance effcient storage and cataloguing of the data sets and finally the qualitative analysis and exploration of the information. In the last decade largescale genome-wide association studies and high-throughput techniques became more effcient, more profitable and less expensive. As a consequence of this rapid development, it is easier to gather massive amounts of genomic and proteomic data. However, these data need to get evaluated, analysed and explored. Typical questions that arise in this context include: which genes are active under sever al physical states, which proteins and metabolites are available, which organisms or cell types are similar or different in their enzymes’or genes’ behaviour. For this reason and because a scientist of any "Big Data" research field wants to see the data, there is an increasing need of clear, intuitively understandable and recognizable visualization to explore the data and confirm thesis. One way to get an overview of the data sets is to cluster it. Taxonomic trees and functional classification schemes are hierarchical structures used by biologists to organize the available biological knowledge in a systematic and computer readable way (such as KEGG, GO and FUNCAT). For example, proteins and genes could be clustered according to their function in an organism. These hierarchies tend to be rather complex, and many comprise thousands of biological entities. One approach for a space-filling visualization of these hierarchical structured data sets is a treemap. Existing algorithms for producing treemaps struggle with large data sets and have several other problems. This thesis addresses some of these problems and is structured as follows. After a short review of the basic concepts from graph theory some commonly used types of treemaps and a classification of treemaps according to information visualization aspects is presented in the first chapter of this thesis. The second chapter of this thesis provides several methods to improve treemap constructions. In certain applications the researcher wants to know, how the entities in a hierarchical structure are related to each other (such as enzymes in a metabolic pathway). Therefore in the 3 third chapter of this thesis, the focus is on the construction of a suitable layout overlaying an existing treemap. This gives rise to optimization problems on geometric graphs. In addition, from a practical point of view, options for enhancing the display of the computed layout are explored to help the user perform typical tasks in this context more effciently. One important aspect of the problems on geometric graphs considered in the third chapter of the thesis is that crossings of edges in a network structure are to be minimized while certain other properties such as connectedness are maintained. Motivated by this, in the fourth chapter of this thesis, related combinatorial and computational problems are explored from a more theoretical point of view. In particular some light is shed on properties of crossing-free spanning trees in geometric graphs.

In dieser Arbeit beschäftigen wir uns mit symplektischen Lie-Algebren und metrischen, symplektischen Lie-Algebren. Wir erweitern ein bestehendes Klassifikationsschema mittels quadratischer Erweiterungen für metrische Lie-Algebren mit halbeinfachen, schiefsymmetrischen Derivationen so, dass damit sämtliche metrischen, symplektischen Lie-Algebren auf Isomorphie untersucht werden können. Damit bestimmen wir die Isomorphieklassen aller nichtabelschen, metrischen, symplektischen Lie-Algebren, der Dimension kleiner als zehn, sowie alle mit einem Index von kleiner oder gleich drei. Anschließend wird in Analogie zur Herangehensweise für metrische Lie-Algebren ein Klassifikationsschema für symplektische Lie-Algebren mit ausgeartetem Zentrum mittels quadratischer Erweiterungen aufgebaut, was uns zudem ein Klassifikationsschema für nilpotente, symplektische Lie-Algebren liefert. Abschließend berechnen wir konkret ein Repräsentantensystem der Isomorphieklassen aller sechsdimensionalen, nilpotenten, symplektischen Lie-Algebren.

Jedes Metagenom umfasst die gesamte genomische Information eines kompletten Ökosystems. Die Analyse eines solchen Systems bedarf der Bestimmung aller darin enthaltenen Nukleinsäuren, stellvertretend für den Bauplan eines jeden Organismus, um Kenntnis über die in diesem Ökosystem nachweisbaren Organismen zu erlangen. Ferner bietet die diagnostische Metagenomanalyse eine Möglichkeit zur Identifizierung von sowohl bekannten als auch unbekannten Pathogenen. Zu diesem Zweck wird dem Metagenom eine Probe entnommen, welche einen repräsentativen Ausschnitt aller darin vorliegenden Organismen enthält. Da a priori keine Informationen zu den in der Probe enthaltenen Organismen vorliegen, bedarf es einer ungerichteten Methode zur Bestimmung aller enthaltenen Nukleinsäuren. Eine geeignete Lösung bietet die Sequenzierung. Darin werden alle Moleküle der Ausgangsprobe mit ungefähr gleicher Wahrscheinlichkeit bestimmt und der erzeugte Datensatz, bestehend aus Millionen kleiner Sequenzabschnitte, entspricht einem repräsentativen Querschnitt der in der Probe nachweisbaren Organismen. Die Herausforderung besteht in der Zuordnung einer jeden Sequenz zu ihren Ursprungsorganismen und die Sequenzen zu identifizieren, die mit einem potentiellen Erreger assoziiert werden können. Aktuell herrscht ein Defizit an Werkzeugen, die diese Zuordnung sowohl schnell als auch präzise vornehmen und speziell für die diagnostische Metagenomanalyse konzipiert sind. Zu diesem Zweck wurde im Rahmen dieser Arbeit eine Software-Pipeline mit Namen RIEMS (164) (Reliable Information Extraction from Metagenomic Sequence datasets) entwickelt, die bestehende Software zur Analyse von Sequenzdaten auf eine Weise verknüpft, die deren Stärken ausnutzt und Schwächen eliminiert. RIEMS ist in der Lage mit Hilfe bekannter Alignierungsalgorithmen und dem Abgleich der Sequenzen mit einschlägigen Datenbanken umfangreiche Datensätze schnell zu analysieren und Nukleinsäuresequenzen präzise ihren putativen Ursprungstaxa zuzuordnen (164). Die vorliegende Arbeit verdeutlicht die Effizienz dieses Computerprogramms im Vergleich zu bestehenden Software-Pipelines. Des Weiteren illustriert sie dessen möglichen Einsatz in der Diagnostik zur Pathogenidentifizierung anhand einiger Beispiele. Dabei können nicht nur bekannte Organismen identifiziert werden, sondern auch unbekannte, noch nicht näher beschriebene Organismen detektiert werden.