Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

Probing cell surfaces of host and nonhost species of a mycoparasite, using FITC-labeled lectins

Cell surfaces of susceptible host species (Mortierella pusllla and Cboanepilora cucurbitarum ), resistant host (Pilascolomyces articulosus ), nonhost (Mortierella candelabrum ) and the mycoparasite (Piptocepilalis virginiana) were examined for sugar distribution patterns using light and fluorescent microscopy techniques. The susceptible host, resistant host and the mycoparasite species exhibited a similar sugar distribution profile; they all showed N-acetyl glucosamine and D-glucose on their cell wall surfaces. The nonhost cell wall surface showed a positive binding reaction to FITClectins specific for N-acetyl glucosamine and also for OI.-fucose, N-acetyl galactosamine and galactose. Treatment of these fungi with mild concentrations of proteinases (both commercial as well as the mycoparasiteproteinase) resulted in the revelation of additional sugars on the fungal cell walls. The susceptible host treated with proteinase expressed higher levels of N-acetyl glucosamine and D-glucose. The susceptible host also showed the presence of OI.-fucose, N-acetyl galactosamine and galactose. The proteinasetreated susceptible host cell walls also showed an increase in the levels of attachment with the mycoparasite. Treatment of the resistant host with proteinases revealed OI.-fucose in addition to N-acetyl glucosamine and D-glucose. Treatment of the nonhost cell wall with proteinase resulted in the exposure of low levels of D-glucose, in addition to sugars found on the untreated nonhost cell wall surface. The mycoparasite treated with proteinase revealed OI.-fucose, N-acetyl galactosamine and galactose on its cell surface in addition to the sugars N-acetyl glucosamine and D-glucose. Protoplasts were isolated from hosts and nonhost fungi and their surfaces were examined for sugar distribution patterns. The susceptible host and nonhost protoplast membranes showed all the sugars (N-acetyl glucosamine, D-glucose, (It.-fucose, N-acetyl galactosamine and galactose) tested for. The resistant host protoplast membrane however, had only N-acetyl glucosamine and D-glucose exposed. This sugar distribution profile resembles that exhibited by the untreated resistant host cell wall, as well as that shown by the untreated mycoparasite cell surface. Only susceptible host protoplasts were successful in attaching to the mycoparasite surface. Resistant host protoplasts did not show any interaction with the i mycoparasite cell surface. Both susceptible as well as resistant host protoplasts were incapable of attaching to agarose beads surface-coated with specific carbohydrates. The mycoparasite however, did attach to agarose beads surface-coated with either N-acetyl glucosamine, D-glucose/Dmannose or o:,- methyl-D-mannose. The relevance of the cell wall and the protoplast membrane in the light of the present results, in reacting appropriately to bring about either a susceptible, a resistant or a nonhost response has been discussed.

The Synthesis of Imidazole Fatty Acid Conjugates as Inhibitors of Apoptosis

Ionizing radiation is known to initiate apoptosis in mammalian cells by causing the transformation of cytochrome c into a peroxidase, which results in the specific peroxidation of the mitochondrial phospholipid cardiolipin. Here we report the design and synthesis of 8 imidazole fatty acid derivatives that bind to the cyt c:CL complex and inhibit the peroxidase activity required for the initiation of apoptosis. We postulate that imidazole acts as a sixth ligand to the haem iron and stops the interaction with H2O2. Two mitochondrially directed analogues (3-hydroxypropyl)triphenylphosphonium esters) of 12-imidazole-stearic acid and 12-imidazole-oleic acid not only were demonstrated to be peroxidase inhibitors in vitro, but were also extraordinarily effective in protecting mice from lethal doses (9 Gy) of ionization radiation. We studied the structure activity relationship to a group of triphenyl phosphonium derivatives containing imidazole at different positions on the fatty acid chain, and observed that the C8-imidazole stearate analogue had marginally better activity than the others. But overall, the structure activity result were remarkable “flat” with all compounds prepared having rather similar inhibitory strength. We also synthesized carnitine mono and di-esters of 12-imidazole fatty acids but full biological data is not yet available for these compounds.

Dynamics in large scale networks

In this thesis we study the properties of two large dynamic networks, the competition network of advertisers on the Google and Bing search engines and the dynamic network of friend relationships among avatars in the massively multiplayer online game (MMOG) Planetside 2. We are particularly interested in removal patterns in these networks. Our main finding is that in both of these networks the nodes which are most commonly removed are minor near isolated nodes. We also investigate the process of merging of two large networks using data captured during the merger of servers of Planetside 2. We found that the original network structures do not really merge but rather they get gradually replaced by newcomers not associated with the original structures. In the final part of the thesis we investigate the concept of motifs in the Barabási-Albert random graph. We establish some bounds on the number of motifs in this graph.