Metabolic activation of heterocyclic amines and other procarcinogens in Salmonella typhimurium umu tester strains expressing human cytochrome P4501A1, 1A2, 1B1, 2C9, 2D6, 2E1, and 3A4 and human NADPH-P450 reductase and bacterial O-acetyltransferase

We investigated roles of different forms of cytochrome P450 (P450 or CYP) in the metabolic activation of heterocyclic amines (HCAs) and other procarcinogens to genotoxic metabolite(s) in the newly developed umu tester strains Salmonella typhimurium (S. typhimurium) OY1002/1A1, OY1002/1A2, OY1002/1B1, OY1002/2C9, OY1002/2D6, OY1002/2E1 and OY 1002/3A4. which express respective human P450 enzymes and NADPH-cytochrome P350 reductase (reductase) and bacterial O-acetyltransferase (O-AT). These strains were established by introducing two plasmids into S. typhimurium TA 1535, one carrying both P450 and the reductase cDNA in a bicistronic construct under control of an IPTG-inducible double me promoter and the other, pOA 102, carrying O-AT and umuClacZ fusion genes. Expression levels of CYP were found to range between 35 to 550 nmol/l cell culture in the strains tested. O-AT activities in different strains ranged from 52 to 135 nmol isoniazid acetylated/min/mg protein. All HCAs tested, and 2-aminoanthracene and 2-aminofluorene exhibited high genotoxicity in the OY1002/1A2 strain, and genotoxicity of 2-amino-3-methylimidazo [4,5-f]quinoline was detected in both the OY1002/1A1 and OY1002/1A2 strains. 1-Amino-1,4-dimethyl-5H-pyrido[4.3-b]-indole and 3-amino-1-methyl-5H-pyrido[4,3-b]-indole were activated in the OY1002/1A1, OY1002/1B1, OY1002/1A2, and OY1002/3A4 strains. Aflatoxin B-1 exhibited genotoxicity in the OY1002/1A2, OY1002/1A1, and OY1002/3A4 strains. beta -Naphthylamine and benzo[a]pyrene did not exhibit genotoxicity in any of the strains. These results suggest that CYP1A2 is the major cytochrom P450 enzyme involved in bioactivation of HCAs. (C) 2001 Elsevier Science B.V. All rights reserved.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

Evolutionary experiments on mate recognition in the Drosophila serrata species complex

It is becoming increasingly apparent that at least some aspects of the evolution of mate recognition may be amenable to manipulation in evolutionary experiments. Quantitative genetic analyses that focus on the genetic consequences of evolutionary processes that result in mate recognition evolution may eventually provide an understanding of the genetic basis of the process of speciation. We review a series of experiments that have attempted to determine the genetic basis of the response to natural and sexual selection on mate recognition in the Drosophila serrata species complex. The genetic basis of mate recognition has been investigated at three levels: (1) between the species of D. serrata and D. birchii using interspecific hybrids, (2) between populations of D. serrata that are sympatric and allopatric with respect to D. birchii, and (3) within populations of D. serrata. These experiments suggest that it may be possible to use evolutionary experiments to observe important events such as the reinforcement of mate recognition, or the generation of the genetic associations that are central to many sexual selection models.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

Patterns of resistance to angular leaf spot, anthracnose and common bacterial blight in common bean germplasm

Diseases and insect pests are major causes of low yields of common bean (Phaseolus vulgaris L.) in Latin America and Africa. Anthracnose, angular leaf spot and common bacterial blight are widespread foliar diseases of common bean that also infect pods and seeds. One thousand and eighty-two accessions from a common bean core collection from the primary centres of origin were investigated for reaction to these three diseases. Angular leaf spot and common bacterial blight were evaluated in the field at Santander de Quilichao, Colombia, and anthracnose was evaluated in a screenhouse in Popayan, Colombia. By using the 15-group level from a hierarchical clustering procedure, it was found that 7 groups were formed with mainly Andean common bean accessions (Andean gene pool), 7 groups with mainly Middle American accessions (Middle American gene pool), while 1 group contained mixed accessions. Consistent with the theory of co-evolution, it was generally observed that accessions from the Andean gene pool were resistant to Middle American pathogen isolates causing anthracnoxe, while the Middle American accessions were resistant to pathogen isolates from the Andes. Different combinations of resistance patterns were found, and breeders can use this information to select a specific group of accessions on the basis of their need.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

Distributional profiles of homologous open reading frames among bacterial phyla: implications for vertical and lateral transmission

If open reading frames (ORFs) have been transmitted primarily by vertical descent, the distributional profile of orthologues of each ORF should be congruent with the organismal tree or a subtree thereof. Distributional patterns not reconciled parsimoniously with tree-like descent and loss are prima facie evidence of lateral gene transfer. Herein, a rigorous criterion for recognizing ORF distributions is described and implemented; it does not require the inference of phylogenetic trees, nor does it assume any specific tree. Because lineage-specific differences in rates of sequence change can also generate unexpected distributional patterns, rate artefacts, were controlled for by requiring pairwise matches between ORFs to exceed a rigorous inclusion threshold, but absence of a match was assessed against a more-permissive exclusion threshold. Applying this dual-threshold criterion to cross-domain and cross-phylum distributional patterns for ORFs in 23 bacterial genomes, a relative abundance of ORFs was observed that find a match in exactly seven other bacterial phyla; 94-99% of these ORFs also find matches among the Archaea and/or Eukarya. In the larger (and some smaller) bacterial genomes, ORFs that find matches in exactly one other bacterial phylum are also relatively abundant, but fewer of these have non-bacterial homologues; most of their matches within the Bacteria are to the Proteobacteria and/or Firmicutes, which cannot be sister lineages to all bacteria. ORFs that are neither distributed universally among the Bacteria, nor necessarily shared with topologically adjacent lineages, are preferentially enriched in large bacterial genomes.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.