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.

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.