Target Cell Topography and Cytoskeletal Reorganization in Natural Killer Cell Activity

The immune system has to recognize and destroy abnormal or infected cells to maintain homeostasis. Natural killer (NK) cells directly recognize and kill transformed or virus-infected cells without prior sensitization. We have studied both virus-infected and tumor cells in order to identify the target structures involved in triggering NK activity. Mouse/human cell hybrids containing various human chromosomes were used as targets. The human chromosome responsible for activating NK cell killing was identified to chromosome number 6. The results suggest that activated NK cells recognize ligands that are encoded on human chromosome 6. We showed that the ligand on the target cell side was intercellular adhesion molecule 2 (ICAM-2). There was no difference in the level of expression of ICAM-2, however, but a drastic difference was seen in the distribution of the molecule: ICAM-2 was evenly distributed on the surface of the NK-resistant cells, but almost totally redistributed to the tip of uropods, bud-like extensions, which were absent from the parental cells. Interestingly, the gene coding for cytoskeletal linker protein ezrin has been localized to human chromosome 6, and there was a colocalization of ezrin and ICAM-2 in the uropods. Furthermore, the transfected human ezrin into NK cell-resistant cells induced uropod formation, ICAM-2 and ezrin redistribution to newly formed uropods, and sensitized target cells to NK cell killing. These data reveal a novel form of NK cell recognition: target structures are already present on normal cells; they become detectable only after abnormal redistribution into hot spots on the target cell membrane. NK cells are central players in the defence against virus infections. They inhibit the spread of infection, allowing time for specific immune responses to develop. The virus-proteins that directly activate human NK cell killing are largely unknown. We studied the sensitivity of virus-specific early proteins of Semliki Forest virus (SFV) to NK killing. The viral non-structural proteins (nsP1-4) translated early in the virus cycle were transfected in NK-resistant cells. Viral early gene nsP1 alone efficiently sensitized target cells to NK activity, and the tight membrane association of nsP1 seems to be critical in the triggering of NK killing. NsP1 protein colocalized with (redistributed) ezrin in filopodia-like structures to which the NK cells were bound. The results suggest that also in viral infections NK cells react to rapid changes in membrane topography. Based on the results of this thesis, a new model of target cell recognition of NK cells can be suggested: reorganization of the cytoskeleton induces alterations in cell surface topography, and this new pattern of surface molecules is recognized as "altered-self".

Deriving structural information from non-coding ribonucleic acids by mass spectrometry

The purpose of this study is to describe the development of application of mass spectrometry for the structural analyses of non-coding ribonucleic acids during past decade. Mass spectrometric methods are compared of traditional gel electrophoretic methods, the characteristics of performance of mass spectrometric, analyses are studied and the future trends of mass spectrometry of ribonucleic acids are discussed. Non-coding ribonucleic acids are short polymeric biomolecules which are not translated to proteins, but which may affect the gene expression in all organisms. Regulatory ribonucleic acids act through transient interactions with key molecules in signal transduction pathways. Interactions are mediated through specific secondary and tertiary structures. Posttranscriptional modifications in the structures of molecules may introduce new properties to the organism, such as adaptation to environmental changes or development of resistance to antibiotics. In the scope of this study, the structural studies include i) determination of the sequence of nucleobases in the polymer chain, ii) characterisation and localisation of posttranscriptional modifications in nucleobases and in the backbone structure, iii) identification of ribonucleic acid-binding molecules and iv) probing of higher order structures in the ribonucleic acid molecule. Bacteria, archaea, viruses and HeLa cancer cells have been used as target organisms. Synthesised ribonucleic acids consisting of structural regions of interest have been frequently used. Electrospray ionisation (ESI) and matrix-assisted laser desorption ionisation (MALDI) have been used for ionisation of ribonucleic analytes. Ammonium acetate and 2-propanol are common solvents for ESI. Trihydroxyacetophenone is the optimal MALDI matrix for ionisation of ribonucleic acids and peptides. Ammonium salts are used in ESI buffers and MALDI matrices as additives to remove cation adducts. Reverse phase high performance liquid chromatography has been used for desalting and fractionation of analytes either off-line of on-line, coupled with ESI source. Triethylamine and triethylammonium bicarbonate are used as ion pair reagents almost exclusively. Fourier transform ion cyclotron resonance analyser using ESI coupled with liquid chromatography is the platform of choice for all forms of structural analyses. Time-of-flight (TOF) analyser using MALDI may offer sensitive, easy-to-use and economical solution for simple sequencing of longer oligonucleotides and analyses of analyte mixtures without prior fractionation. Special analysis software is used for computer-aided interpretation of mass spectra. With mass spectrometry, sequences of 20-30 nucleotides of length may be determined unambiguously. Sequencing may be applied to quality control of short synthetic oligomers for analytical purposes. Sequencing in conjunction with other structural studies enables accurate localisation and characterisation of posttranscriptional modifications and identification of nucleobases and amino acids at the sites of interaction. High throughput screening methods for RNA-binding ligands have been developed. Probing of the higher order structures has provided supportive data for computer-generated three dimensional models of viral pseudoknots. In conclusion. mass spectrometric methods are well suited for structural analyses of small species of ribonucleic acids, such as short non-coding ribonucleic acids in the molecular size region of 20-30 nucleotides. Structural information not attainable with other methods of analyses, such as nuclear magnetic resonance and X-ray crystallography, may be obtained with the use of mass spectrometry. Sequencing may be applied to quality control of short synthetic oligomers for analytical purposes. Ligand screening may be used in the search of possible new therapeutic agents. Demanding assay design and challenging interpretation of data requires multidisclipinary knowledge. The implement of mass spectrometry to structural studies of ribonucleic acids is probably most efficiently conducted in specialist groups consisting of researchers from various fields of science.

Computational Methods for Locating and Analyzing Conserved Gene Regulatory DNA Elements

This thesis presents methods for locating and analyzing cis-regulatory DNA elements involved with the regulation of gene expression in multicellular organisms. The regulation of gene expression is carried out by the combined effort of several transcription factor proteins collectively binding the DNA on the cis-regulatory elements. Only sparse knowledge of the 'genetic code' of these elements exists today. An automatic tool for discovery of putative cis-regulatory elements could help their experimental analysis, which would result in a more detailed view of the cis-regulatory element structure and function. We have developed a computational model for the evolutionary conservation of cis-regulatory elements. The elements are modeled as evolutionarily conserved clusters of sequence-specific transcription factor binding sites. We give an efficient dynamic programming algorithm that locates the putative cis-regulatory elements and scores them according to the conservation model. A notable proportion of the high-scoring DNA sequences show transcriptional enhancer activity in transgenic mouse embryos. The conservation model includes four parameters whose optimal values are estimated with simulated annealing. With good parameter values the model discriminates well between the DNA sequences with evolutionarily conserved cis-regulatory elements and the DNA sequences that have evolved neutrally. In further inquiry, the set of highest scoring putative cis-regulatory elements were found to be sensitive to small variations in the parameter values. The statistical significance of the putative cis-regulatory elements is estimated with the Two Component Extreme Value Distribution. The p-values grade the conservation of the cis-regulatory elements above the neutral expectation. The parameter values for the distribution are estimated by simulating the neutral DNA evolution. The conservation of the transcription factor binding sites can be used in the upstream analysis of regulatory interactions. This approach may provide mechanistic insight to the transcription level data from, e.g., microarray experiments. Here we give a method to predict shared transcriptional regulators for a set of co-expressed genes. The EEL (Enhancer Element Locator) software implements the method for locating putative cis-regulatory elements. The software facilitates both interactive use and distributed batch processing. We have used it to analyze the non-coding regions around all human genes with respect to the orthologous regions in various other species including mouse. The data from these genome-wide analyzes is stored in a relational database which is used in the publicly available web services for upstream analysis and visualization of the putative cis-regulatory elements in the human genome.

A Floor Control Server in a Distributed Conference Service

The conferencing systems in IP Multimedia (IM) networks are going through restructuring, accomplished in the near future. One of the changes introduced is the concept of floors and floor control in its current form with matching entity roles. The Binary Floor Control Protocol (BFCP) is a novelty to be exploited in distributed tightly coupled conferencing services. The protocol defines the floor control server (FCS), which implements floor control giving access to shared resources. As the newest tendency is to distribute the conferencing services, the locations of different functionality units play an important role in developing the standards. The floor control server location is not yet single-mindedly fixed in different standardization bodies, and the debate goes on where to place it within the media server, providing the conferencing service. The thesis main objective is to evaluate two distinctive alternatives in respect the Mp interface protocol between the respective nodes, as the interface in relation to floor control is under standardization work at the moment. The thesis gives a straightforward preamble in IMS network, nodes of interest including floor control server and conferencing. Knowledge on several protocols – BFCP, SDP, SIP and H.248 provides an important background for understanding the functionality changes introduced in the Mp interface and therefore introductions on those protocols and how they are connected to the full picture is given. The actual analysis on the impact of the floor control server into the Mp reference point is concluded in relation to the locations, giving basic flows, requirements analysis including a limited implementation proposal on supporting protocol parameters. The overall conclusion of the thesis is that even if both choices are seemingly useful, not one of the locations is clearly the most suitable in the light of this work. The thesis suggests a solution having both possibilities available to be chosen from in separate circumstances, realized with consistent standardization. It is evident, that if the preliminary assumption for the analysis is kept regarding to only one right place for the floor control server, more work is to be done in connected areas to discover the one most appropriate location.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Porlyl oligopeptidase in development

Prolyl oligopeptidase (POP, prolyl endopeptidase, EC 3.4.21.26) is a serine-type peptidase (family S9 of clan SC) hydrolyzing peptides shorter than 30 amino acids. POP has been found in various mammalian and bacterial sources and it is widely distributed throughout different organisms. In human and rat, POP enzyme activity has been detected in most tissues, with the highest activity found mostly in the brain. POP has gained scientific interest as being involved in the hydrolyzis of many bioactive peptides connected with learning and memory functions, and also with neurodegenerative disorders. In drug or lesion induced amnesia models and in aged rodents, POP inhibitors have been able to revert memory loss. POP may have a fuction in IP3 signaling and it may be a possible target of mood stabilizing substances. POP may also have a role in protein trafficking, sorting and secretion. The role of POP during ontogeny has not yet been resolved. POP enzyme activity and expression have shown fluctuation during development. Specially high enzyme activities have been measured in the brain during early development. Reduced neuronal proliferation and differentation in presence of POP inhibitor have been reported. Nuclear POP has been observed in proliferating peripheral tissues and in cell cultures at the early stage of development. Also, POP coding mRNA is abundantly expressed during brain ontogeny and the highest levels of expression are associated with proliferative germinal matrices. This observation indicates a special role for POP in the regulation of neurogenesis during development. For the experimental part, the study was undertaken to investigate the expression and distribution of POP protein and enzymatic activity of POP in developing rat brain (from embryonic day 14 to post natal day 7) using immunohistochemistry, POP enzyme activity measurements and western blot-analysis. The aim was also to find in vivo confirmation of the nuclear colocalization of POP during early brain ontogeny. For immunohistochemistry, cryosections from the brains of the fetuses/rats were made and stained using specific antibody for POP and fluorescent markers for POP and nuclei. The enzyme activity assay was based on the fluorescence of 7- amino-4-methylcoumarin (AMC) generated from the fluorogenic substrate succinyl-glycyl-prolyl-7-amino-4-methylcoumarin (Suc-Gly-Pro-AMC) by POP. The amounts of POP protein and the specifity of POP antibody in rat embryos was confirmed by western blot analysis. We observed that enzymatic activity of POP is highest at embryonic day 18 while the protein amounts reach their peak at birth. POP was widely present throughout the developmental stages from embryonic day 14 to parturition day, although the POP-immunoreactivity varied abundantly. At embryonic days 14 and 18 notably amounts of POP was distributed at proliferative germinal zones. Furthermore, POP was located in the nucleus early in the development but is transferred to cytosol before birth. At P0 and P7 the POP-immunoreactivity was also widely observed, but the amount of POP was notably reduced at P7. POP was present in cytosol and in intercellular space, but no nuclear POP was observed. These findings support the idea of POP being involved in specific brain functions, such as neuronal proliferation and differentation. Our results in vivo confirm the previous cell culture results supporting the role of POP in neurogenesis. Moreover, an inconsistency of POP protein amounts and enzymatic activity late in the development suggests a strong regulation of POP activity and a possible non-hydrolytic role at that stage.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.