Elucidation of a PTS–Carbohydrate Chemotactic Signal Pathway in Escherichia coli Using a Time-resolved Behavioral Assay

Chemotaxis of Escherichia coli toward phosphotransferase systems (PTSs)–carbohydrates requires phosphoenolpyruvate-dependent PTSs as well as the chemotaxis response regulator CheY and its kinase, CheA. Responses initiated by flash photorelease of a PTS substrates d-glucose and its nonmetabolizable analog methyl α-d-glucopyranoside were measured with 33-ms time resolution using computer-assisted motion analysis. This, together with chemotactic mutants, has allowed us to map out and characterize the PTS chemotactic signal pathway. The responses were absent in mutants lacking the general PTS enzymes EI or HPr, elevated in PTS transport mutants, retarded in mutants lacking CheZ, a catalyst of CheY autodephosphorylation, and severely reduced in mutants with impaired methyl-accepting chemotaxis protein (MCP) signaling activity. Response kinetics were comparable to those triggered by MCP attractant ligands over most of the response range, the most rapid being 11.7 ± 3.1 s−1. The response threshold was <10 nM for glucose. Responses to methyl α-d-glucopyranoside had a higher threshold, commensurate with a lower PTS affinity, but were otherwise kinetically indistinguishable. These facts provide evidence for a single pathway in which the PTS chemotactic signal is relayed rapidly to MCP–CheW–CheA signaling complexes that effect subsequent amplification and slower CheY dephosphorylation. The high sensitivity indicates that this signal is generated by transport-induced dephosphorylation of the PTS rather than phosphoenolpyruvate consumption.

The optimization principle in phylogenetic analysis tends to give incorrect topologies when the number of nucleotides or amino acids used is small

In the maximum parsimony (MP) and minimum evolution (ME) methods of phylogenetic inference, evolutionary trees are constructed by searching for the topology that shows the minimum number of mutational changes required (M) and the smallest sum of branch lengths (S), respectively, whereas in the maximum likelihood (ML) method the topology showing the highest maximum likelihood (A) of observing a given data set is chosen. However, the theoretical basis of the optimization principle remains unclear. We therefore examined the relationships of M, S, and A for the MP, ME, and ML trees with those for the true tree by using computer simulation. The results show that M and S are generally greater for the true tree than for the MP and ME trees when the number of nucleotides examined (n) is relatively small, whereas A is generally lower for the true tree than for the ML tree. This finding indicates that the optimization principle tends to give incorrect topologies when n is small. To deal with this disturbing property of the optimization principle, we suggest that more attention should be given to testing the statistical reliability of an estimated tree rather than to finding the optimal tree with excessive efforts. When a reliability test is conducted, simplified MP, ME, and ML algorithms such as the neighbor-joining method generally give conclusions about phylogenetic inference very similar to those obtained by the more extensive tree search algorithms.

Characteristic enrichment of DNA repeats in different genomes

Using computer programs developed for this purpose, we searched for various repeated sequences including inverted, direct tandem, and homopurine–homopyrimidine mirror repeats in various prokaryotes, eukaryotes, and an archaebacterium. Comparison of observed frequencies with expectations revealed that in bacterial genomes and organelles the frequency of different repeats is either random or enriched for inverted and/or direct tandem repeats. By contrast, in all eukaryotic genomes studied, we observed an overrepresentation of all repeats, especially homopurine–homopyrimidine mirror repeats. Analysis of the genomic distribution of all abundant repeats showed that they are virtually excluded from coding sequences. Unexpectedly, the frequencies of abundant repeats normalized for their expectations were almost perfect exponential functions of their size, and for a given repeat this function was indistinguishable between different genomes.

A two-year experience teaching computer literacy to first-year medical students using skill-based cohorts

Because it is widely accepted that providing information online will play a major role in both the teaching and practice of medicine in the near future, a short formal course of instruction in computer skills was proposed for the incoming class of students entering medical school at the State University of New York at Stony Brook. The syllabus was developed on the basis of a set of expected outcomes, which was accepted by the dean of medicine and the curriculum committee for classes beginning in the fall of 1997. Prior to their arrival, students were asked to complete a self-assessment survey designed to elucidate their initial skill base; the returned surveys showed students to have computer skills ranging from complete novice to that of a systems engineer. The classes were taught during the first three weeks of the semester to groups of students separated on the basis of their knowledge of and comfort with computers. Areas covered included computer basics, e-mail management, MEDLINE, and Internet search tools. Each student received seven hours of hands-on training followed by a test. The syllabus and emphasis of the classes were tailored to the initial skill base but the final test was given at the same level to all students. Student participation, test scores, and course evaluations indicated that this noncredit program was successful in achieving an acceptable level of comfort in using a computer for almost all of the student body.