Partial purification of tightly bound mitochondrial hexokinase from maize (Zea mays L.) root membranes

In mammals, hexokinase (HK) is strategically located at the outer membrane of mitochondria bound to the porin protein. The mitochondrial HK is a crucial modulator of apoptosis and reactive oxygen species generation. In plants, these properties related to HK are unknown. In order to better understand the physiological role of non-cytosolic hexokinase (NC-HK) in plants, we developed a purification strategy here described. Crude extract of 400 g of maize roots (230 mg protein) contained a specific activity of 0.042 µmol G6P min-1 mg PTN-1. After solubilization with detergent two fractions were obtained by DEAE column chromatography, NC-HK 1 (specific activity = 3.6 µmol G6P min-1 mg PTN-1 and protein recovered = 0.7 mg) and NC-HK 2. A major purification (yield = 500-fold) was obtained after passage of NC-HK 1 through the hydrophobic phenyl-Sepharose column. The total amount of protein and activity recovered were 0.04 and 18%, respectively. The NC-HK 1 binds to the hydrophobic phenyl-Sepharose matrix, as observed for rat brain HK. Mild chymotrypsin digestion did not affect adsorption of NC-HK 1 to the hydrophobic column as it does for rat HK I. In contrast to mammal mitochondrial HK, glucose-6-phosphate, clotrimazole or thiopental did not dissociate NC-HK from maize (Zea mays) or rice (Oryza sativa) mitochondrial membranes. These data show that the interaction between maize or rice NC-HK to mitochondria differs from that reported in mammals, where the mitochondrial enzyme can be displaced by modulators or pharmacological agents known to interfere with the enzyme binding properties with the mitochondrial porin protein.

The Streptococcus mutans GlnR protein exhibits an increased affinity for the glnRA operon promoter when bound to GlnK

The control of nitrogen metabolism in pathogenic Gram-positive bacteria has been studied in a variety of species and is involved with the expression of virulence factors. To date, no data have been reported regarding nitrogen metabolism in the odontopathogenic species Streptococcus mutans. GlnR, which controls nitrogen assimilation in the related bacterial species, Bacillus subtilis, was assessed in S. mutans for its DNA and protein binding activity. Electrophoretic mobility shift assay of the S. mutans GlnR protein indicated that GlnR binds to promoter regions of the glnRA and amtB-glnK operons. Cross-linking and pull-down assays demonstrated that GlnR interacts with GlnK, a signal transduction protein that coordinates the regulation of nitrogen metabolism. Upon formation of this stable complex, GlnK enhances the affinity of GlnR for the glnRA operon promoter. These results support an involvement of GlnR in transcriptional regulation of nitrogen metabolism-related genes and indicate that GlnK relays information regarding ammonium availability to GlnR.

Screening of iron-enriched fungus from natural environment and evaluation of organically bound iron bioavailability in rats

Iron is an essential element for nearly all living organisms, and its deficiency is the most common form of malnutrition in the world. The organic forms of trace elements are considered more bioavailable than the inorganic forms. Although Saccharomyces cerevisiae can enrich metal elements and convert inorganic iron to organic species, its tolerability and transforming capacity are limited. The aim of this study was to screen higher biomass and other iron-enriched fungi strains besides Saccharomyces cerevisiae from the natural environment. A PDA medium containing 800 μg/mL iron was used for initial screening. Fifty strains that tolerated high iron concentration were isolated from the natural environment, and only one strain, No.BY1109, grew well at Fe (II) concentration of 10,000μg/ml. According to morphological characterization, 18S rDNA sequence analysis, and biophysical and biochemical characterization, the strain No.BY1109 was identified as Rhodotorula. The iron content of No.BY1109 (10 mg Fe/g dry cell) was determined using atomic absorption spectrometry. The results of distribution of iron in the cells showed that iron ion was mainly chelated in the cell walls and vacuoles. The bioavailability in rats confirmed that strain No.BY1109 had higher absorption efficiency than that of ferrous sulfate after single dose oral administration. The present study introduces new iron supplements, and it is a basis for finding new iron supplements from natural environment.

Power and Performance Management Strategies on NoC-Based Multicore Platforms, Using DVFS, Adaptive Algorithm and Task Parallelism

This work presents synopsis of efficient strategies used in power managements for achieving the most economical power and energy consumption in multicore systems, FPGA and NoC Platforms. In this work, a practical approach was taken, in an effort to validate the significance of the proposed Adaptive Power Management Algorithm (APMA), proposed for system developed, for this thesis project. This system comprise arithmetic and logic unit, up and down counters, adder, state machine and multiplexer. The essence of carrying this project firstly, is to develop a system that will be used for this power management project. Secondly, to perform area and power synopsis of the system on these various scalable technology platforms, UMC 90nm nanotechnology 1.2v, UMC 90nm nanotechnology 1.32v and UMC 0.18 μmNanotechnology 1.80v, in order to examine the difference in area and power consumption of the system on the platforms. Thirdly, to explore various strategies that can be used to reducing system’s power consumption and to propose an adaptive power management algorithm that can be used to reduce the power consumption of the system. The strategies introduced in this work comprise Dynamic Voltage Frequency Scaling (DVFS) and task parallelism. After the system development, it was run on FPGA board, basically NoC Platforms and on these various technology platforms UMC 90nm nanotechnology1.2v, UMC 90nm nanotechnology 1.32v and UMC180 nm nanotechnology 1.80v, the system synthesis was successfully accomplished, the simulated result analysis shows that the system meets all functional requirements, the power consumption and the area utilization were recorded and analyzed in chapter 7 of this work. This work extensively reviewed various strategies for managing power consumption which were quantitative research works by many researchers and companies, it's a mixture of study analysis and experimented lab works, it condensed and presents the whole basic concepts of power management strategy from quality technical papers.

Gaining a better understanding of how Outward Bound Western Canada course outcomes are achieved : a research study /

This study examined how Outward Bound Western Canada (OBWC) course outcomes are achieved by exploring the relationships among course components, students' characteristics, and course outcomes. OBWC is a wilderness-based adventure education organization that helps students achieve outcomes such as increased self-awareness, self-confidence, motivation, interpersonal skills, concern for others, and concern for the environment. This study explored the ways in which the various components of courses and the characteristics of students contribute to determining the outcomes students experience as a result of their courses. The purpose of the study was to gain a better understanding of how OBWC course outcomes are achieved in order to strengthen adventure education theory, enhance practice at OBWC and other adventure education organizations, and provide a foundation for further research on this topic. As an interpretive case study, this study sought to describe how OBWC course outcomes are achieved and to provide interpretations of the research findings. Data was gathered from OBWC students and instructors using the quantitative and qualitative data collection techniques of questionnaire, interview, and observation. Data collected from 98 participants ensured a considerable breadth to the study, while interviews with a number of participants also enabled the collection of in-depth data. Analysis and triangulation of the data from the various sources allowed discernment of the research findings. A comprehensive and detailed picture of how course outcomes are achieved emerged from the findings. Twenty-nine course components were found to influence course outcomes, including various aspects of course activities, the physical environment, instructors, and the group. The findings indicated that certain course components were most influential in determining increases to students' self-awareness, self-confidence, self-reliance, self-esteem, self-concept, motivation, self-responsibility, interpersonal skills, concern for others, and concern for the environment. A number of course components were found to indirectly contribute to positive course outcomes by helping maximize the effectiveness of other components, by increasing students' motivation while on course, or by facilitating the processing and transference of new information. The findings also suggested that several course components either directly or indirectly affected course outcomes in negative ways. In addition, the gender, age, population, and expectations of students were found to play a role in determining the course outcomes they experienced and in determining which course components caused those outcomes. Interpretation of the findings resulted in the generation of research-based theory. The main theoretical argument derived from the results of the study was that course outcomes are influenced by a combination of course components and characteristics of students. More specifically, the theory generated by the study indicated that five groupings of factors contribute to course outcomes, including course activities, the physical environment, instructors, the group, and students' characteristics. The study was considered in relation to existing adventure education literature and larger theoretical issues. The generated theory and research findings were then used to develop suggestions for improving practice at OBWC and other adventure education organizations, as well as for enhancing future research studies.

Enhancing personal effectiveness : the impacts of Costa Rica Outward Bound on students in an independent school in southwestern Ontario

This project examines students in a private school in southwestern Ontario on a 17 -day Costa Rica Outward Bound Rainforest multielement course. The study attempted to discover whether voluntary teenage participants could increase their self-perceptions of life effectiveness by participating in a 17-day expedition. A total of9 students participated in the study. The experimental design that was implemented was a mixed methods design. Participants filled in a Life Effectiveness Questionnaire (LEQ) at four predesignated times during the study. These time intervals occurred (a) before the trip commenced, (b) the first day of the trip, ( c) the last day of the trip, and (d) 1 month after the trip ended. Fieldnotes and recordings from informal group debriefing sessions were also used to gather information. Data collected in this study were analyzed in a variety of ways by the researcher. Analyses that were run on the data included the Friedman test for covariance, means, medians, and the Wilcoxon Pairs Test. The questionnaires were analyzed quantitatively, and the fieldnotes were analyzed qualitatively. Nonparametric statistical analysis was implemented as a result of the small group size of participants. Both sets of data were grouped and discussed according to similarities and differences. The data indicate that voluntary teenage participants experience significant changes over time in the areas of time management, social competency, emotional control, active initiative, and self-confidence. The types of outcomes from this study illustrate that Outward Bound-type opportunities should be offered to teenagers in Ontario schools as a means to bring about self-development.

The Salmon Algorithm - A New Population Based Search Metaheuristic

This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming upstream to spawn. There are a number of tunable parameters in the algorithm, so experiments were conducted to find the optimum parameter settings for different search spaces. The algorithm was tested on one instance of the Traveling Salesman Problem and found to have superior performance to an Ant Colony Algorithm and a Genetic Algorithm. It was then tested on three coding theory problems - optimal edit codes, optimal Hamming distance codes, and optimal covering codes. The algorithm produced improvements on the best known values for five of six of the test cases using edit codes. It matched the best known results on four out of seven of the Hamming codes as well as three out of three of the covering codes. The results suggest the Salmon Algorithm is competitive with established guided random search techniques, and may be superior in some search spaces.

A Multi-Objective Genetic Algorithm with Side Effect Machines for Motif Discovery

Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of side effect machines for degenerate motif discovery. We compare some suggested objectives for the motifs they find, test different multi-objective scoring schemes and probabilistic models for the background sequence models and report our results on a synthetic dataset and some biological benchmarking suites. We conclude with a comparison of our algorithm with some widely used motif discovery algorithms in the literature and suggest future directions for research in this area.

New Contig Creation Algorithm for the de novo DNA Assembly Problem

DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the human genome using Next-Generation-Sequencing (NGS) technologies is shown to be very difficult because of the highly repetitive and complex nature of the human genome, short read lengths, uneven data coverage and tools that are not specifically built for human genomes. Moreover, many algorithms are not even scalable to human genome datasets containing hundreds of millions of short reads. The DNA assembly problem is usually divided into several subproblems including DNA data error detection and correction, contig creation, scaffolding and contigs orientation; each can be seen as a distinct research area. This thesis specifically focuses on creating contigs from the short reads and combining them with outputs from other tools in order to obtain better results. Three different assemblers including SOAPdenovo [Li09], Velvet [ZB08] and Meraculous [CHS+11] are selected for comparative purposes in this thesis. Obtained results show that this thesis’ work produces comparable results to other assemblers and combining our contigs to outputs from other tools, produces the best results outperforming all other investigated assemblers.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Disease-Gene Association Using a Genetic Algorithm

Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments performed in the last few years has resulted in an unprecedented growth in computational methods to tackle the disease gene association problem. Nowadays, it is clear that a genetic disease is not a consequence of a defect in a single gene. Instead, the disease phenotype is a reflection of various genetic components interacting in a complex network. In fact, genetic diseases, like any other phenotype, occur as a result of various genes working in sync with each other in a single or several biological module(s). Using a genetic algorithm, our method tries to evolve communities containing the set of potential disease genes likely to be involved in a given genetic disease. Having a set of known disease genes, we first obtain a protein-protein interaction (PPI) network containing all the known disease genes. All the other genes inside the procured PPI network are then considered as candidate disease genes as they lie in the vicinity of the known disease genes in the network. Our method attempts to find communities of potential disease genes strongly working with one another and with the set of known disease genes. As a proof of concept, we tested our approach on 16 breast cancer genes and 15 Parkinson's Disease genes. We obtained comparable or better results than CIPHER, ENDEAVOUR and GPEC, three of the most reliable and frequently used disease-gene ranking frameworks.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.

Some Implications of the Zero Lower Bound on Interest Rates for the Term Structure and Monetary Policy

In an economy where cash can be stored costlessly (in nominal terms), the nominal interest rate is bounded below by zero. This paper derives the implications of this nonnegativity constraint for the term structure and shows that it induces a nonlinear and convex relation between short- and long-term interest rates. As a result, the long-term rate responds asymmetrically to changes in the short-term rate, and by less than predicted by a benchmark linear model. In particular, a decrease in the short-term rate leads to a decrease in the long-term rate that is smaller in magnitude than the increase in the long-term rate associated with an increase in the short-term rate of the same size. Up to the extent that monetary policy acts by affecting long-term rates through the term structure, its power is considerably reduced at low interest rates. The empirical predictions of the model are examined using data from Japan.

Models and algorithms for the capacitated location-routing problem

Le problème de localisation-routage avec capacités (PLRC) apparaît comme un problème clé dans la conception de réseaux de distribution de marchandises. Il généralisele problème de localisation avec capacités (PLC) ainsi que le problème de tournées de véhicules à multiples dépôts (PTVMD), le premier en ajoutant des décisions liées au routage et le deuxième en ajoutant des décisions liées à la localisation des dépôts. Dans cette thèse on dévelope des outils pour résoudre le PLRC à l’aide de la programmation mathématique. Dans le chapitre 3, on introduit trois nouveaux modèles pour le PLRC basés sur des flots de véhicules et des flots de commodités, et on montre comment ceux-ci dominent, en termes de la qualité de la borne inférieure, la formulation originale à deux indices [19]. Des nouvelles inégalités valides ont été dévelopées et ajoutées aux modèles, de même que des inégalités connues. De nouveaux algorithmes de séparation ont aussi été dévelopés qui dans la plupart de cas généralisent ceux trouvés dans la litterature. Les résultats numériques montrent que ces modèles de flot sont en fait utiles pour résoudre des instances de petite à moyenne taille. Dans le chapitre 4, on présente une nouvelle méthode de génération de colonnes basée sur une formulation de partition d’ensemble. Le sous-problème consiste en un problème de plus court chemin avec capacités (PCCC). En particulier, on utilise une relaxation de ce problème dans laquelle il est possible de produire des routes avec des cycles de longueur trois ou plus. Ceci est complété par des nouvelles coupes qui permettent de réduire encore davantage le saut d’intégralité en même temps que de défavoriser l’apparition de cycles dans les routes. Ces résultats suggèrent que cette méthode fournit la meilleure méthode exacte pour le PLRC. Dans le chapitre 5, on introduit une nouvelle méthode heuristique pour le PLRC. Premièrement, on démarre une méthode randomisée de type GRASP pour trouver un premier ensemble de solutions de bonne qualité. Les solutions de cet ensemble sont alors combinées de façon à les améliorer. Finalement, on démarre une méthode de type détruir et réparer basée sur la résolution d’un nouveau modèle de localisation et réaffectation qui généralise le problème de réaffectaction [48].

Développement et caractérisation d’une méthode photonique pour créer des distributions spatiales de protéines

Les cellules sont capables de détecter les distributions spatiales de protéines et ainsi de migrer ou s’étendre dans la direction appropriée. Une compréhension de la réponse cellulaire aux modifications de ces distributions spatiales de protéines est essentielle pour l’avancement des connaissances dans plusieurs domaines de recherches tels que le développement, l’immunologie ou l’oncologie. Un exemple particulièrement complexe est le guidage d’axones se déroulant pendant le développement du système nerveux. Ce dernier nécessite la présence de plusieurs distributions de molécules de guidages étant attractives ou répulsives pour connecter correctement ce réseau complexe qu’est le système nerveux. Puisque plusieurs indices de guidage collaborent, il est particulièrement difficile d’identifier la contribution individuelle ou la voie de signalisation qui est déclenchée in vivo, il est donc nécessaire d’utiliser des méthodes pour reproduire ces distributions de protéines in vitro. Plusieurs méthodes existent pour produire des gradients de protéines solubles ou liées aux substrats. Quelques méthodes pour produire des gradients solubles sont déjà couramment utilisées dans plusieurs laboratoires, mais elles limitent l’étude aux distributions de protéines qui sont normalement sécrétées in vivo. Les méthodes permettant de produire des distributions liées au substrat sont particulièrement complexes, ce qui restreint leur utilisation à quelques laboratoires. Premièrement, nous présentons une méthode simple qui exploite le photoblanchiment de molécules fluorescentes pour créer des motifs de protéines liées au substrat : Laser-assisted protein adsorption by photobleaching (LAPAP). Cette méthode permet de produire des motifs de protéines complexes d’une résolution micrométrique et d’une grande portée dynamique. Une caractérisation de la technique a été faite et en tant que preuve de fonctionnalité, des axones de neurones du ganglion spinal ont été guidés sur des gradients d’un peptide provenant de la laminine. Deuxièmement, LAPAP a été amélioré de manière à pouvoir fabriquer des motifs avec plusieurs composantes grâce à l’utilisation de lasers à différentes longueurs d’onde et d’anticorps conjugués à des fluorophores correspondants à ces longueurs d’onde. De plus, pour accélérer et simplifier le processus de fabrication, nous avons développé LAPAP à illumination à champ large qui utilise un modulateur spatial de lumière, une diode électroluminescente et un microscope standard pour imprimer directement un motif de protéines. Cette méthode est particulièrement simple comparativement à la version originale de LAPAP puisqu’elle n’implique pas le contrôle de la puissance laser et de platines motorisées, mais seulement d’envoyer l’image du motif désiré au modulateur spatial. Finalement, nous avons utilisé LAPAP pour démontrer que notre technique peut être utilisée dans des analyses de haut contenu pour quantifier les changements morphologiques résultant de la croissance neuronale sur des gradients de protéines de guidage. Nous avons produit des milliers de gradients de laminin-1 ayant différentes pentes et analysé les variations au niveau du guidage de neurites provenant d’une lignée cellulaire neuronale (RGC-5). Un algorithme pour analyser les images des cellules sur les gradients a été développé pour détecter chaque cellule et quantifier la position du centroïde du soma ainsi que les angles d’initiation, final et de braquage de chaque neurite. Ces données ont démontré que les gradients de laminine influencent l’angle d’initiation des neurites des RGC-5, mais n’influencent pas leur braquage. Nous croyons que les résultats présentés dans cette thèse faciliteront l’utilisation de motifs de protéines liées au substrat dans les laboratoires des sciences de la vie, puisque LAPAP peut être effectué à l’aide d’un microscope confocal ou d’un microscope standard légèrement modifié. Cela pourrait contribuer à l’augmentation du nombre de laboratoires travaillant sur le guidage avec des gradients liés au substrat afin d’atteindre la masse critique nécessaire à des percées majeures en neuroscience.