Characterization of the mitochondrial active-site serine protein LACTB: filaments in the mitochondrial intermembrane space

Mitochondria have evolved from endosymbiotic alpha-proteobacteria. During the endosymbiotic process early eukaryotes dumped the major component of the bacterial cell wall, the peptidoglycan layer. Peptidoglycan is synthesized and maintained by active-site serine enzymes belonging to the penicillin-binding protein and the β-lactamase superfamily. Mammals harbor a protein named LACTB that shares sequence similarity with bacterial penicillin-binding proteins and β-lactamases. Since eukaryotes lack the synthesis machinery for peptidoglycan, the physiological role of LACTB is intriguing. Recently, LACTB has been validated in vivo to be causative for obesity, suggesting that LACTB is implicated in metabolic processes. The aim of this study was to investigate the phylogeny, structure, biochemistry and cell biology of LACTB in order to elucidate its physiological function. Phylogenetic analysis revealed that LACTB has evolved from penicillin binding-proteins present in the bacterial periplasmic space. A structural model of LACTB indicates that LACTB shares characteristic features common to all penicillin-binding proteins and β-lactamases. Recombinat LACTB protein expressed in E. coli was recovered in significant quantities. Biochemical and cell biology studies showed that LACTB is a soluble protein localized in the mitochondrial intermembrane space. Further analysis showed that LACTB preprotein underwent proteolytic processing disclosing an N-terminal tetrapeptide motif also found in a set of cell death-inducing proteins. Electron microscopy structural studies revealed that LACTB can polymerize to form stable filaments with lengths ranging from twenty to several hundred nanometers. These data suggest that LACTB filaments define a distinct microdomain in the intermembrane space. A possible role of LACTB filaments is proposed in the intramitochondrial membrane organization and microcompartmentation. The implications of these findings offer novel insight into the evolution of mitochondria. Further studies of the LACTB function might provide a tool to treat mitochondria-related metabolic diseases.

Zinc, cadmium and lead resistance mechanisms in bacteria and their contribution to biosensing

In bacteria resistance to heavy metals is mainly achieved through active efflux, but also sequestration with proteins or as insoluble compounds is used. Although numerous studies have dealt with zinc, cadmium and lead resistance mechanisms in bacteria, it has still remained unclear how different transporters are integrated into an effective homeostasis/resistance network and whether specific mechanisms for lead sequestration exist. Furthermore, since metals are toxic not only to bacteria but to higher organisms as well, it is important to be able to estimate possible biological effects of heavy metals in the environment. This could be done by determining the bioavailable amount of the metals in the environment with bacterial bioreporters. That is, one can employ bacteria that respond to metal contamination by a measurable signal to assess the property of metals to cross biological membranes and to cause harmful effects in a possibly polluted environment. In this thesis a new lead resistance mechanism is described, interplay between CBA transporters and P-type ATPases in zinc and cadmium resistance is presented and finally the acquired knowledge is used to construct bacterial bioreporters for heavy metals with increased sensitivity and specificity. The new lead resistance model employs a P-type ATPase that removes Pb2+ ions from the cytoplasm and a phosphatase that produces inorganic phosphate for lead sequestration in the periplasm. This was the first study where the molecular mechanism of lead sequestration has been described. Characterization of two P-type ATPases and two CBA transporters showed that resistance mechanisms for Zn2+ and Cd2+ are somewhat different than for Pb2+ as these metals cannot be sequestered as insoluble compounds as easily. Resistance to Zn2+ was conferred merely by the CBA transporter that could export both cytoplasmic and periplasmic ions; whereas, full resistance to Cd2+ required interplay of a P-type ATPase that exported cytoplasmic ions to periplasm and a CBA transporter that further exported periplasmic ions to the outside. The knowledge on functionality of the transporters and metal-inducible promoters was exploited in bioreporter technology. A transporter-deficient bioreporter strain that lacked exporters for Zn2+/Cd2+/Pb2+ could detect up to 45-fold lower metal concentrations than its wild type counterpart due to the accumulation of metals in the cell. The broad specificity issue of bioreporters was overcome by using Zn-specific promoter as a sensor element, thus achieving Zn-specific bioreporter.

Lactic acid bacteria and their antimicrobial peptides : Induction,detection,partial characterization, and potential applications

Bacteriocin-producing lactic acid bacteria and their isolated peptide bacteriocins are of value to control pathogens and spoiling microorganisms in foods and feed. Nisin is the only bacteriocin that is commonly accepted as a food preservative and has a broad spectrum of activity against Gram-positive organisms including spore forming bacteria. In this study nisin induction was studied from two perspectives, induction from inside of the cell and selection of nisin inducible strains with increased nisin induction sensitivity. The results showed that a mutation in the nisin precursor transporter NisT rendered L. lactis incapable of nisin secretion and lead to nisin accumulation inside the cells. Intracellular proteolytic activity could cleave the N-terminal leader peptide of nisin precursor, resulting in active nisin in the cells. Using a nisin sensitive GFP bioassay it could be shown, that the active intracellular nisin could function as an inducer without any detectable release from the cells. The results suggested that nisin can be inserted into the cytoplasmic membrane from inside the cell and activate NisK. This model of two-component regulation may be a general mechanism of how amphiphilic signals activate the histidine kinase sensor and would represent a novel way for a signal transduction pathway to recognize its signal. In addition, nisin induction was studied through the isolation of natural mutants of the GFPuv nisin bioassay strain L. lactis LAC275 using fl uorescence-activated cell sorting (FACS). The isolated mutant strains represent second generation of GFPuv bioassay strains which can allow the detection of nisin at lower levels. The applied aspect of this thesis was focused on the potential of bacteriocins in chicken farming. One aim was to study nisin as a potential growth promoter in chicken feed. Therefore, the lactic acid bacteria of chicken crop and the nisin sensitivity of the isolated strains were tested. It was found that in the crop Lactobacillus reuteri, L. salivarius and L. crispatus were the dominating bacteria and variation in nisin resistance level of these strains was found. This suggested that nisin may be used as growth promoter without wiping out the dominating bacterial species in the crop. As the isolated lactobacilli may serve as bacteria promoting chicken health or reducing zoonoosis and bacteriocin production is one property associated with probiotics, the isolated strains were screened for bacteriocin activity against the pathogen Campylobacter jejuni. The results showed that many of the isolated L. salivarius strains could inhibit the growth of C. jejuni. The bacteriocin of the L. salivarius LAB47 strain, with the strongest activity, was further characterized. Salivaricin 47 is heat-stable and active in pH range 3 to 8, and the molecular mass was estimated to be approximately 3.2 kDa based on tricine SDS-PAGE analysis.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Viivesietoisten verkkojen nykytila ja tulevaisuuden haasteet

Delay and disruption tolerant networks (DTNs) are computer networks where round trip delays and error rates are high and disconnections frequent. Examples of these extreme networks are space communications, sensor networks, connecting rural villages to the Internet and even interconnecting commodity portable wireless devices and mobile phones. Basic elements of delay tolerant networks are a store-and-forward message transfer resembling traditional mail delivery, an opportunistic and intermittent routing, and an extensible cross-region resource naming service. Individual nodes of the network take an active part in routing the traffic and provide in-network data storage for application data that flows through the network. Application architecture for delay tolerant networks differs also from those used in traditional networks. It has become feasible to design applications that are network-aware and opportunistic, taking an advantage of different network connection speeds and capabilities. This might change some of the basic paradigms of network application design. DTN protocols will also support in designing applications which depend on processes to be persistent over reboots and power failures. DTN protocols could also be applicable to traditional networks in cases where high tolerance to delays or errors would be desired. It is apparent that challenged networks also challenge the traditional strictly layered model of network application design. This thesis provides an extensive introduction to delay tolerant networking concepts and applications. Most attention is given to challenging problems of routing and application architecture. Finally, future prospects of DTN applications and implementations are envisioned through recent research results and an interview with an active researcher of DTN networks.

Alignment of the ALICE Inner Tracking System with cosmic-ray tracks

ALICE (A Large Ion Collider Experiment) is the LHC (Large Hadron Collider) experiment devoted to investigating the strongly interacting matter created in nucleus-nucleus collisions at the LHC energies. The ALICE ITS, Inner Tracking System, consists of six cylindrical layers of silicon detectors with three different technologies; in the outward direction: two layers of pixel detectors, two layers each of drift, and strip detectors. The number of parameters to be determined in the spatial alignment of the 2198 sensor modules of the ITS is about 13,000. The target alignment precision is well below 10 micron in some cases (pixels). The sources of alignment information include survey measurements, and the reconstructed tracks from cosmic rays and from proton-proton collisions. The main track-based alignment method uses the Millepede global approach. An iterative local method was developed and used as well. We present the results obtained for the ITS alignment using about 10^5 charged tracks from cosmic rays that have been collected during summer 2008, with the ALICE solenoidal magnet switched off.

Tonically Active Kainate Receptors (tKARs) : A Novel Mechanism Regulating Neuronal Function in the Brain

Fast excitatory transmission between neurons in the central nervous system is mainly mediated by L-glutamate acting on ligand gated (ionotropic) receptors. These are further categorized according to their pharmacological properties to AMPA (2-amino-3-(5-methyl-3-oxo-1,2- oxazol-4-yl)propanoic acid), NMDA (N-Methyl-D-aspartic acid) and kainate (KAR) subclasses. In the rat and the mouse hippocampus, development of glutamatergic transmission is most dynamic during the first postnatal weeks. This coincides with the declining developmental expression of the GluK1 subunit-containing KARs. However, the function of KARs during early development of the brain is poorly understood. The present study reveals novel types of tonically active KARs (hereafter referred to as tKARs) which play a central role in functional development of the hippocampal CA3-CA1 network. The study shows for the first time how concomitant pre- and postsynaptic KAR function contributes to development of CA3-CA1 circuitry by regulating transmitter release and interneuron excitability. Moreover, the tKAR-dependent regulation of transmitter release provides a novel mechanism for silencing and unsilencing early synapses and thus shaping the early synaptic connectivity. The role of GluK1-containing KARs was studied in area CA3 of the neonatal hippocampus. The data demonstrate that presynaptic KARs in excitatory synapses to both pyramidal cells and interneurons are tonically activated by ambient glutamate and that they regulate glutamate release differentially, depending on target cell type. At synapses to pyramidal cells these tKARs inhibit glutamate release in a G-protein dependent manner but in contrast, at synapses to interneurons, tKARs facilitate glutamate release. On the network level these mechanisms act together upregulating activity of GABAergic microcircuits and promoting endogenous hippocampal network oscillations. By virtue of this, tKARs are likely to have an instrumental role in the functional development of the hippocampal circuitry. The next step was to investigate the role of GluK1 -containing receptors in the regulation of interneuron excitability. The spontaneous firing of interneurons in the CA3 stratum lucidum is markedly decreased during development. The shift involves tKARs that inhibit medium-duration afterhyperpolarization (mAHP) in these neurons during the first postnatal week. This promotes burst spiking of interneurons and thereby increases GABAergic activity in the network synergistically with the tKAR-mediated facilitation of their excitatory drive. During development the amplitude of evoked medium afterhyperpolarizing current (ImAHP) is dramatically increased due to decoupling tKAR activation and ImAHP modulation. These changes take place at the same time when the endogeneous network oscillations disappear. These tKAR-driven mechanisms in the CA3 area regulate both GABAergic and glutamatergic transmission and thus gate the feedforward excitatory drive to the area CA1. Here presynaptic tKARs to CA1 pyramidal cells suppress glutamate release and enable strong facilitation in response to high-frequency input. Therefore, CA1 synapses are finely tuned to high-frequency transmission; an activity pattern that is common in neonatal CA3-CA1 circuitry both in vivo and in vitro. The tKAR-regulated release probability acts as a novel presynaptic silencing mechanism that can be unsilenced in response to Hebbian activity. The present results shed new light on the mechanisms modulating the early network activity that paves the way for oscillations lying behind cognitive tasks such as learning and memory. Kainate receptor antagonists are already being developed for therapeutic use for instance against pain and migraine. Because of these modulatory actions, tKARs also represent an attractive candidate for therapeutic treatment of developmentally related complications such as learning disabilities.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.