An investigative study on the effects of black fly (diptera: simuliidae) sugar meals on reproductive success and parasite transmission /

Black flies are opportunistic sugar-feeders. They take sugar meals from Homopteran honeydew secretions or plant nectars, depending on availability. Homopteran honeydew secretions contain both simple and complex carbohydrates while plant nectars contain primarily simple carbohydrates. In order to determine whether honeydew secretions offer more energy than plant nectars to their insect visitors a study of wild-caught black flies was undertaken in Algonquin Provincial Park, Canada during the spring of 1 998 and 1 999. It was hypothesized that female black flies maintained on honeydew sugars will survive longer, produce more eggs and have a greater parasite vectoring potential than those maintained on artificial nectar or distilled water. Results demonstrated that: (1) host-seeking female Prosimulimfuscum/mixtum and Simulium venustum maintained on artificial honeydew did not survive longer than those maintained on artificial nectar when fed ad libitum; (2) fiiUy engorged S. venustum and Simulium rugglesi maintained on artificial honeydew did not produce more eggs than those maintained on artificial nectar when fed ad libitum; and (3) S. rugglesi did not have a greater vectoring potential of Leucocytozoon simondi when maintained on artificial honeydew as opposed to artificial nectar when fed ad libitum. However, all flies maintained on the two sugars (artificial honeydew and artificial nectar) survived longer, produce more eggs and had greater vectoring potential than those maintained on distilled water alone.

Aspergillus flavus infections in Galleria mellonella : a pathogen-host model system for the study of emerging diseases

To study emerging diseases, I employed a model pathogen-host system involving infections of insect larvae with the opportunistic fungus Aspergillus flavus, providing insight into three mechanisms ofpathogen evolution namely de novo mutation, genome decay, and virulence factoracquisition In Chapter 2 as a foundational experiment, A. flavus was serially propagated through insects to study the evolution of an opportunistic pathogen during repeated exposure to a single host. While A. flavus displayed de novo phenotypic alterations, namely decreased saprobic capacity, analysis of genotypic variation in Chapter 3 signified a host-imposed bottleneck on the pathogen population, emphasizing the host's role in shaping pathogen population structure. Described in Chapter 4, the serial passage scheme enabled the isolation of an A. flavus cysteine/methionine auxotroph with characteristics reminiscent of an obligate insect pathogen, suggesting that lost biosynthetic capacity may restrict host range based on nutrient availability and provide selection pressure for further evolution. As outlined in Chapter 6, cysteine/methionine auxotrophy had the pleiotrophic effect of increasing virulence factor production, affording the slow-growing auxotroph with a modified pathogenic strategy such that virulence was not reduced. Moreover in Chapter 7, transformation with a virulence factor from a facultative insect pathogen failed to increase virulence, demonstrating the necessity of an appropriate genetic background for virulence factor acquisition to instigate pathogen evolution.

Manipulation of adenovirus early region 1 rescue plasmids by homologous recombination in Saccharomyces cerevisiae

The manipulation of large (>10 kb) plasmid systems amplifies problems common to traditional cloning strategies. Unique or rare restriction enzyme recognition sequences are uncommon and very rarely located in opportunistic locations. Making site-specific deletions and insertions in larger plasmids consequently leads to multiple step cloning strategies that are often limited by time-consuming, low efficiency linker insertions or blunt-end cloning strategies. Manipulation ofthe adenovirus genome and the genomes ofother viruses as bacterial plasmids are systems that typify such situations. Recombinational cloning techniques based on homologous recombination in Saccharomyces cerevisiae that circumvent many ofthese common problems have been developed. However, these techniques are rarely realistic options for such large plasmid systems due to the above mentioned difficulties associated with the addition ofrequired yeast DNA replication, partitioning and selectable marker sequences. To determine ifrecombinational cloning techniques could be modified to simplify the manipulation of such a large plasmid system, a recombinational cloning system for the creation of human adenovirus EI-deletion rescue plasmids was developed. Here we report for the first time that the 1,456 bp TRP1/ARS fragment ofYRp7 is alone sufficient to foster successful recombinational cloning without additional partitioning sequences, using only slight modifications of existing protocols. In addition, we describe conditions for efficient recombinational cloning involving simultaneous deletion of large segments ofDNA (>4.2 kb) and insertion of donor fragment DNA using only a single non-unique restriction site. The discovery that recombinational cloning can foster large deletions has been used to develop a novel recombiliational cloillng technique, selectable inarker 'kilockouf" recombinational cloning, that uses deletion of a yeast selectable marker coupled with simultaneous negative and positive selection to reduce background transformants to undetectable levels. The modification of existing protocols as described in this report facilitates the use of recombinational cloning strategies that are otherwise difficult or impractical for use with large plasmid systems. Improvement of general recombinational cloning strategies and strategies specific to the manipulation ofthe adenovirus genome are considered in light of data presented herein.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.