Die Bedeutung von molekularem Sauerstoff für die Evolution des genetischen Codes

Die Entstehung und Evolution des genetischen Codes, der die Nukleotidsequenz der mRNA in die Aminosäuresequenz der Proteine übersetzt, zählen zu den größten Rätseln der Biologie. Die ersten Organismen, die vor etwa 3,8 Milliarden Jahren auf der Erde auftraten, nutzten einen ursprünglichen genetischen Code, der vermutlich ausschließlich abiotisch verfügbare Aminosäuren terrestrischer oder extraterrestrischer Herkunft umfasste. Neue Aminosäuren wurden sukzessive biosynthetisiert und selektiv in den Code aufgenommen, welcher in der modernen Form aus bis zu 22 Aminosäuren besteht. Die Ursachen für die Selektion und die Chronologie ihrer Aufnahme sind bis heute unbekannt und sollten im Rahmen der vorliegenden Arbeit erforscht werden. Auf Grundlage quanten-chemischer Berechnungen konnte in dieser Arbeit zunächst ein Zusammenhang zwischen der HOMO-LUMO-Energiedifferenz (H-L-Distanz), die ein inverses quanten-chemisches Korrelat für allgemeine chemische Reaktivität darstellt, und der chronologischen Aufnahme der Aminosäuren in den genetischen Code aufgezeigt werden. Demnach sind ursprüngliche Aminosäuren durch große H-L-Distanzen und neue Aminosäuren durch kleine H-L-Distanzen gekennzeichnet. Bei einer Analyse des Metabolismus von Tyrosin und Tryptophan, bei denen es sich um die beiden jüngsten Standard-Aminosäuren handelt, wurde ihre Bedeutung als Vorläufer von Strukturen ersichtlich, die sich durch eine hohe Redox-Aktivität auszeichnen und deren Synthese gleichzeitig molekularen Sauerstoff erfordert. Aus diesem Grund wurden die Redox-Aktivitäten der 20 Standard-Aminosäuren gegenüber Peroxylradikalen und weiteren Radikalen getestet. Die Untersuchungen ergaben eine Korrelation zwischen evolutionärem Auftreten und chemischer Reaktivität der jeweiligen Aminosäure, die sich insbesondere in der effizienten Reaktion zwischen Tryptophan bzw. Tyrosin und Peroxylradikalen widerspiegelte. Dies indizierte eine potentielle Bedeutung reaktiver Sauerstoffspezies (ROS) bei der Konstituierung des genetischen Codes. Signifikante Mengen an ROS wurden erst zu Beginn der Oxygenierung der Geobiosphäre, die als Great Oxidation Event (GOE) bezeichnet wird und vor circa 2,3 Milliarden Jahren begann, gebildet und müssen zur oxidativen Schädigung vulnerabler, zellulärer Strukturen geführt haben. Aus diesem Grund wurde das antioxidative Potential von Aminosäuren beim Prozess der Lipidperoxidation untersucht. Es konnte gezeigt werden, dass lipophile Derivate von Tryptophan und Tyrosin befähigt sind, die Peroxidation von Rattenhirnmembranen zu verhindern und humane Fibroblasten vor oxidativem Zelltod zu schützen. Daraus gründete sich das in dieser Arbeit aufgestellte Postulat eines Selektionsvorteils primordialer Organismen während des GOEs, die Tryptophan und Tyrosin als redox-aktive Aminosäuren in Membranproteine einbauen konnten und somit vor Oxidationsprozessen geschützt waren. Demzufolge wurde die biochemische Reaktivität als Selektionsparameter sowie oxidativer Stress als prägender Faktor der Evolution des genetischen Codes identifiziert.

Polar Codes for error correction: Analysis and Decoding Algorithms

I Polar Codes sono la prima classe di codici a correzione d’errore di cui è stato dimostrato il raggiungimento della capacità per ogni canale simmetrico, discreto e senza memoria, grazie ad un nuovo metodo introdotto recentemente, chiamato ”Channel Polarization”. In questa tesi verranno descritti in dettaglio i principali algoritmi di codifica e decodifica. In particolare verranno confrontate le prestazioni dei simulatori sviluppati per il ”Successive Cancellation Decoder” e per il ”Successive Cancellation List Decoder” rispetto ai risultati riportati in letteratura. Al fine di migliorare la distanza minima e di conseguenza le prestazioni, utilizzeremo uno schema concatenato con il polar code come codice interno ed un CRC come codice esterno. Proporremo inoltre una nuova tecnica per analizzare la channel polarization nel caso di trasmissione su canale AWGN che risulta il modello statistico più appropriato per le comunicazioni satellitari e nelle applicazioni deep space. In aggiunta, investigheremo l’importanza di una accurata approssimazione delle funzioni di polarizzazione.

Learning Spike-Based Population Codes by Reward and Population Feedback

We investigate a recently proposed model for decision learning in a population of spiking neurons where synaptic plasticity is modulated by a population signal in addition to reward feedback. For the basic model, binary population decision making based on spike/no-spike coding, a detailed computational analysis is given about how learning performance depends on population size and task complexity. Next, we extend the basic model to n-ary decision making and show that it can also be used in conjunction with other population codes such as rate or even latency coding.

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.

BREAKING CODES: MAKING THEORIES ON MENSTRUATION ACCESSIBLE THROUGH THIRD-WAVE FEMINISM

Men and women respond to situations according to their community’s social codes. With menstruation, people adhere to “menstrual codes”. Within academic communities, people adhere to “academic codes”. This report paper investigates performances of academic codes and menstrual codes. Implications of gender identity and race are missing and/or minimal in past feminist work regarding menstruation. This paper includes considerations for gender identity and race. Within the examination of academic codes, this paper discusses the inhibitive process of idea creation within the academic sphere, and the limitations to the predominant ways of knowledge sharing within, and outside of, the academic community. The digital project (www.hu.mtu.edu/~creynolds) is one example of how academic and menstrual codes can be broken. The report and project provide a broadly accessible deconstruction of menstrual advertising and academic theories while fostering conversations on menstruation through the sharing of knowledge with others, regardless of gender, race, or academic standing.

Summary of the recommendations of the EFNS/MDS-ES review on therapeutic management of Parkinson's disease.

OBJECTIVE To summarize the 2010 EFNS/MDS-ES evidence-based treatment recommendations for the management of Parkinson's disease (PD). This summary includes the treatment recommendations for early and late PD. METHODS For the 2010 publication, a literature search was undertaken for articles published up to September 2009. For this summary, an additional literature search was undertaken up to December 2010. Classification of scientific evidence and the rating of recommendations were made according to the EFNS guidance. In cases where there was insufficient scientific evidence, a consensus statement ('good practice point') is made. RESULTS AND CONCLUSIONS For each clinical indication, a list of therapeutic interventions is provided, including classification of evidence.

Growth Codes: Intermediate Performance Analysis and Application to Video

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where partial data presents some utility. In this paper, we investigate the asymptotic performance of Growth codes using the Wormald method, which was proposed for studying the Peeling Decoder of LDPC and LDGM codes. Compared to previous works, the Wormald differential equations are set on nodes' perspective which enables a numerical solution to the computation of the expected asymptotic decoding performance of Growth codes. Our framework is appropriate for any class of Rateless codes that does not include a precoding step. We further study the performance of Growth codes with moderate and large size codeblocks through simulations and we use the generalized logistic function to model the decoding probability. We then exploit the decoding probability model in an illustrative application of Growth codes to error resilient video transmission. The video transmission problem is cast as a joint source and channel rate allocation problem that is shown to be convex with respect to the channel rate. This illustrative application permits to highlight the main advantage of Growth codes, namely improved performance in the intermediate loss region.

Cancer intelligence acquired (CIA): tumor glycosylation and sialylation codes dismantling antitumor defense

Aberrant glycosylation is a key feature of malignant transformation and reflects epigenetic and genetic anomalies among the multitude of molecules involved in glycan biosynthesis. Although glycan biosynthesis is not template bound, altered tumor glycosylation is not random, but associated with common glycosylation patterns. Evidence suggests that acquisition of distinct glycosylation patterns evolves from a ‘microevolutionary’ process conferring advantages in terms of tumor growth, tumor dissemination, and immune escape. Such glycosylation modifications also involve xeno- and hypersialylation. Xeno-autoantigens such as Neu5Gc-gangliosides provide potential targets for immunotherapy. Hypersialylation may display ‘enhanced self’ to escape immunosurveillance and involves several not mutually exclusive inhibitory pathways that all rely on protein–glycan interactions. A better understanding of tumor ‘glycan codes’ as deciphered by lectins, such as siglecs, selectins, C-type lectins and galectins, may lead to novel treatment strategies, not only in cancer, but also in autoimmune disease or transplantation.