Search PubMed⌕ Search

Biomedical subjects

R Spang

Publications and source records attributed to R Spang.

8 recordsLinked to original sources

Predicting the clinical status of human breast cancer by using gene expression profiles.

Prognostic and predictive factors are indispensable tools in the treatment of patients with neoplastic disease. For the most part, such factors rely on a few specific cell surface, histological, or gross pathologic features. Gene expression assays have the potential to supplement what were previously a few distinct features with many thousands of features. We have developed Bayesian regression models that provide predictive capability based on gene expression data derived from DNA microarray analysis of a series of primary breast cancer samples. These patterns have the capacity to discriminate breast tumors on the basis of estrogen receptor status and also on the categorized lymph node status. Importantly, we assess the utility and validity of such models in predicting the status of tumors in crossvalidation determinations. The practical value of such approaches relies on the ability not only to assess relative probabilities of clinical outcomes for future samples but also to provide an honest assessment of the uncertainties associated with such predictive classifications on the basis of the selection of gene subsets for each validation analysis. This latter point is of critical importance in the ability to apply these methodologies to clinical assessment of tumor phenotype.

Bacillus anthracis↗

Limits of homology detection by pairwise sequence comparison.

MOTIVATION: Noise in database searches resulting from random sequence similarities increases as the databases expand rapidly. The noise problems are not a technical shortcoming of the database search programs, but a logical consequence of the idea of homology searches. The effect can be observed in simulation experiments. RESULTS: We have investigated noise levels in pairwise alignment based database searches. The noise levels of 38 releases of the SwissProt database, display perfect logarithmic growth with the total length of the databases. Clustering of real biological sequences reduces noise levels, but the effect is marginal.

Computer Simulation↗

Role for E2F in control of both DNA replication and mitotic functions as revealed from DNA microarray analysis.

We have used high-density DNA microarrays to provide an analysis of gene regulation during the mammalian cell cycle and the role of E2F in this process. Cell cycle analysis was facilitated by a combined examination of gene control in serum-stimulated fibroblasts and cells synchronized at G(1)/S by hydroxyurea block that were then released to proceed through the cell cycle. The latter approach (G(1)/S synchronization) is critical for rigorously maintaining cell synchrony for unambiguous analysis of gene regulation in later stages of the cell cycle. Analysis of these samples identified seven distinct clusters of genes that exhibit unique patterns of expression. Genes tend to cluster within these groups based on common function and the time during the cell cycle that the activity is required. Placed in this context, the analysis of genes induced by E2F proteins identified genes or expressed sequence tags not previously described as regulated by E2F proteins; surprisingly, many of these encode proteins known to function during mitosis. A comparison of the E2F-induced genes with the patterns of cell growth-regulated gene expression revealed that virtually all of the E2F-induced genes are found in only two of the cell cycle clusters; one group was regulated at G(1)/S, and the second group, which included the mitotic activities, was regulated at G(2). The activation of the G(2) genes suggests a broader role for E2F in the control of both DNA replication and mitotic activities.

Animals↗

Sequence database search using jumping alignments.

We describe a new algorithm for amino acid sequence classification and the detection of remote homologues. The rationale is to exploit both vertical and horizontal information of a multiple alignment in a well balanced manner. This is in contrast to established methods like profiles and hidden Markov models which focus on vertical information as they model the columns of the alignment independently. In our setting, we want to select from a given database of "candidate sequences" those proteins that belong to a given superfamily. In order to do so, each candidate sequence is separately tested against a multiple alignment of the known members of the superfamily by means of a new jumping alignment algorithm. This algorithm is an extension of the Smith-Waterman algorithm and computes a local alignment of a single sequence and a multiple alignment. In contrast to traditional methods, however, this alignment is not based on a summary of the individual columns of the multiple alignment. Rather, the candidate sequence at each position is aligned to one sequence of the multiple alignment, called the "reference sequence". In addition, the reference sequence may change within the alignment, while each such jump is penalized. To evaluate the discriminative quality of the jumping alignment algorithm, we compared it to hidden Markov models on a subset of the SCOP database of protein domains. The discriminative quality was assessed by counting the number of false positives that ranked higher than the first true positive (FP-count). For moderate FP-counts above five, the number of successful searches with our method was considerably higher than with hidden Markov models.

Animals↗

Statistics of large-scale sequence searching.

MOTIVATION: Database search programs such as FASTA, BLAST or a rigorous Smith-Waterman algorithm produce lists of database entries, which are assumed to be related to the query. The computation of statistical significance of similarity scores is well established for single pairs of sequences and using purely random models. However, the multi-trial context of a database search poses new problems. The credibility of a certain score obtained in a database search decreases with the amount of data that is compared. To improve p-value computation for database search experiments, statistical properties of the databases, such as the distribution of sequence length and effects induced by frequently repeated sequence patterns, need to be taken into account. RESULTS: We investigated the SWISS-PROT protein database Release 31.0 running extensive simulations of database searches. A discrepancy is observed between the theoretical predictions and the empirical distribution. To correct for this, we evaluate the statistical significance of scores in the context of a database search by a contrasting semi-random model. This model enhances purely random models by one additional parameter reflecting individual statistical properties of real databases. We call this parameter the effective size of the database. CONTACT: r.spang@dkfz-heidelberg.de;m.vingron@dkfz-hei del berg.de

Computational Biology↗