Exploration of new drug delivery pathways: I. Mechanism of folate uptake in cultured human cells. II. Role of nuclear localization signal peptides in the delivery of oligonucleotide into reconstituted nuclei

The roles of the folate receptor and an anion carrier in the uptake of 5- methyltetrahydrofolate (5-MeH_4folate) were studied in cultured human (KB) cells using radioactive 5-MeH_4folate. Binding of the 5-MeH_4folate was inhibited by folic acid, but not by probenecid, an anion carrier inhibitor. The internalization of 5-MeH_4folate was inhibited by low temperature, folic acid, probenecid and methotrexate. Prolonged incubation of cells in the presence of high concentrations of probenecid appeared to inhibit endocytosis of folatereceptors as well as the anion carrier. The V_(max) and K_M values for the carrier were 8.65 ± 0.55 pmol/min/mg cell protein and 3.74 ± 0.54µM, respectively. The transport of 5-MeH4folate was competitively inhibited by folic acid, probenecid and methotrexate. The carrier dissociation constants for folic acid, probenecid and methotreate were 641 µM, 2.23 mM and 13.8 µM, respectively. Kinetic analysis suggests that 5-MeH_4folate at physiological concentration is transported through an anion carrier with the characteristics of the reduced-folate carrier after 5-MeH_4folate is endocytosed by folate receptors in KB cells. Our data with KB cells suggest that folate receptors and probenecid-sensitive carriers work in tandem to transport 5-MeH_4folate to the cytoplasm of cells, based upon the assumption that 1 mM probenecid does not interfere with the acidification of the vesicle where the folate receptors are endocytosed.

Oligodeoxynucleotides designed to hybridize to specific mRNA sequences (antisense oligonucleotides) or double stranded DNA sequences have been used to inhibit the synthesis of a number of cellular and viral proteins (Crooke, S. T. (1993) FASEB J. 7, 533-539; Carter, G. and Lemoine, N. R. (1993) Br. J. Cacer 67, 869-876; Stein, C. A. and cohen, J. S. (1988) Cancer Res. 48, 2659-2668). However, the distribution of the delivered oligonucleotides in the cell, i.e., in the cytoplasm or in the nucleus has not been clearly defined. We studied the kinetics of oligonucleotide transport into the cell nucleus using reconstituted cell nuclei as a model system. We present evidences here that oligonucleotides can freely diffuse into reconstituted nuclei. Our results are consistent with the reports by Leonetti et al. (Proc. Natl. Acad. Sci. USA, Vol. 88, pp. 2702-2706, April 1991), which were published while we were carrying this research independently. We also investigated whether a synthetic nuclear localization signal (NLS) peptide of SV40 T antigen could be used for the nuclear targeting of oligonucleotides. We synthesized a nuclear localization signal peptide-conjugated oligonucleotide to see if a nuclear localization signal peptide can enhance the uptake of oligonucleotides into reconstituted nuclei of Xenopus. Uptake of the NLS peptide-conjugated oligonucleotide was comparable to the control oligonucleotide at similar concentrations, suggesting that the NLS signal peptide does not significantly enhance the nuclear accumulation of oligonucleotides. This result is probably due to the small size of the oligonucleotide.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

On erasure coding for distributed storage and streaming communications

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.

First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases. Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small. Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.

Second, we study how distributed storage allocations affect the recovery delay in a mobile setting. Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes: the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay. We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations. It turns out that the optimal allocations for the two problems can be quite different. In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.

Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link; the receiver must subsequently decode each message within a given delay from its creation time. For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns. For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases. We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability; the objective is to maximize the decoding probability for a given message size. We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small. In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.

Finally, we consider the joint problems of routing and caching for named data networking. We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions. In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.

Model systems for the study of drug hypersensitivity

I. It was not possible to produce anti-tetracycline antibody in laboratory animals by any of the methods tried. Tetracycline protein conjugates were prepared and characterized. It was shown that previous reports of the detection of anti-tetracycline antibody by in vitro-methods were in error. Tetracycline precipitates non-specifically with serum proteins. The anaphylactic reaction reported was the result of misinterpretation, since the observations were inconsistent with the known mechanism of anaphylaxis and the supposed antibody would not sensitize guinea pig skin. The hemagglutination reaction was not reproducible and was extremely sensitive to minute amounts of microbial contamination. Both free tetracyclines and the conjugates were found to be poor antigens.

II. Anti-aspiryl antibodies were produced in rabbits using 3 protein carriers. The method of inhibition of precipitation was used to determine the specificity of the antibody produced. ε-Aminocaproate was found to be the most effective inhibitor of the haptens tested, indicating that the combining hapten of the protein is ε-aspiryl-lysyl. Free aspirin and salicylates were poor inhibitors and did not combine with the antibody to a significant extent. The ortho group was found to participate in the binding to antibody. The average binding constants were measured.

Normal rabbit serum was acetylated by aspirin under in vitro conditions, which are similar to physiological conditions. The extent of acetylation was determined by immunochemical tests. The acetylated serum proteins were shown to be potent antigens in rabbits. It was also shown that aspiryl proteins were partially acetylated. The relation of these results to human aspirin intolerance is discussed.

III. Aspirin did not induce contact sensitivity in guinea pigs when they were immunized by techniques that induce sensitivity with other reactive compounds. The acetylation mechanism is not relevant to this type of hypersensitivity, since sensitivity is not produced by potent acetylating agents like acetyl chloride and acetic anhydride. Aspiryl chloride, a totally artificial system, is a good sensitizer. Its specificity was examined.

IV. Protein conjugates were prepared with p-aminosalicylic acid and various carriers using azo, carbodiimide and mixed anhydride coupling. These antigens were injected into rabbits and guinea pigs and no anti-hapten IgG or IgM response was obtained. Delayed hypersensitivity was produced in guinea pigs by immunization with the conjugates, and its specificity was determined. Guinea pigs were not sensitized by either injections or topical application of p-amino-salicylic acid or p-aminosalicylate.