Mitochondrial inheritance in ustilago violacea

The anther smut fungus U stilago violacea has been developed as an important model organIsm for genetic, morphological and physiological studies. Valuable information on the nuclear genetics on U stilago violacea has been obtained in the last 20-25 years. However, in this organism almost nothing is known about mitochondria which make up an important aspect of the fungal genetic system. One fundamental aspect, mitochondrial inheritance, was addressed by this investigation. Mitochondrial DNA (mtDNA) of U. violacea was purified and restriction fragments cloned. MtDNA restriction fragment length polymorphisms (RFLPs) were identified among different isolates and were used as genetic markers for studying mitochondrial inheritance in crosses between polymorphic isolates. Matings of the yeast-like haploid cells of opposite mating types resulted in dikaryons containing mitochondria from both parents. The dikaryons were induced to form hyphae and then allowed to revert to haploid growth, resulting 1ll a colony that is bisectored for the two nuclear types. Both nuclear-type progeny of each cross were examined for parental mitochondrial type: Either mitochondrial type was observed 1ll the progeny. Thus, mitochondrial inheritance is biparental in this organism. The recovery of both mitochondrial types in the progeny was non-random. In progeny with the nuclear genotype of the al mating type parent mitochondria from both parents were inherited equally well. However, 1ll progeny with the a2 mating type, mitochondria were inherited almost exclusively (94%) from the a2 parent.

Chemical, biochemical, and molecular characterization of a low vindoline Catharanthus roseus mutant.

The Madagascar periwinkle (Catharanthus roseus) is the sole source of the anticancer drug vinblastine, which is formed via the coupling of monoterpenoid indole alkaloids (MIAs) catharanthine and vindoline. A mutant line of C. roseus (M2-1865) with an altered MIA profile was identified in a screen of 4000 M2 lines generated by ethylmethanesulfonate (EMS) chemical mutagenesis. While this line did not accumulate vinblastine due to reduced levels of vindoline within the leaves, significant levels of 2,3-epoxide derivatives of tabersonine accumulated on the leaf surface. Detailed nucleotide, amino acid, and enzyme activity analyses of tabersonine 3-reductase in the M2-1865 line showed that a single amino acid substitution (H189Y) diminished the biochemical activity of T3R by 95%. Genetic crosses showed the phenotype to be recessive, exhibiting standard Mendelian single-gene inheritance. The usefulness of EMS mutagenesis in elucidating MIA biosynthesis is highlighted by the results of this study.

Winâ Foy : functional object-oriented programming language

This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a programming language is based on deficiencies found in programming languages that support both Self types and subtyping. Subtyping is a concept that is taken for granted by most software engineers programming in object-oriented languages. Subtyping supports subsumption but it does not support the inheritance of binary methods. Binary methods contain an argument of type Self, the same type as the object itself, in a contravariant position, i.e. as a parameter. There are several arguments in favour of introducing Self types into a programming language (11. This rationale led to the development of a relation that has become known as matching [4, 5). The matching relation does not support subsumption, however, it does support the inheritance of binary methods. Two forms of matching have been proposed (lJ. Specifically, these relations are known as higher-order matching and I-bound matching. Previous research on these relations indicates that the higher-order matching relation is both reflexive and transitive whereas the f-bound matching is reflexive but not transitive (7]. The higher-order matching relation provides significant flexibility regarding inheritance of methods that utilize or return values of the same type. This flexibility, in certain situations, can restrict the programmer from defining specific classes and methods which are based on constant values [21J. For this reason, the type This is used as a second reference to the type of the object that cannot, contrary to Self, be specialized in subclasses. F-bound matching allows a programmer to define a function that will work for all types of A', a subtype of an upper bound function of type A, with the result type being dependent on A'. The use of parametric polymorphism in f-bound matching provides a connection to subtyping in object-oriented languages. This thesis will contain two main sections. Firstly, significant details concerning deficiencies of the subtype relation and the need to introduce higher-order and f-bound matching relations into programming languages will be explored. Secondly, a new programming language named Win--*Foy Functional Object-Oriented Programming Language has been created, along with a suitable user interface, in order to facilitate experimentation by programmers regarding the matching relation. The construction of the programming language and the user interface will be explained in detail.

Equational Reasoning about Object-Oriented Programs

Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process is a programming language that provides powerful abstraction mechanisms combined with intensive reuse of code. In this thesis we present a strongly typed functional object-oriented programming language. This language features type operators of arbitrary kind corresponding to so-called type protocols. Sub classing and inheritance is based on higher-order matching, i.e., utilizes type protocols as basic tool for reuse of code. We define the operational and axiomatic semantics of this language formally. The latter is the basis of the interactive proof assistant VOOP (Verified Object-Oriented Programs) that allows the user to prove equational properties of programs interactively.