The programme pscan has been developed to distribute protein databank scans over a network of computers that share a common file system. pscan may be used in conjunction with most conventional sequence comparison programmes with few modifications. In test runs using the Smith-Waterman dynamic programming algorithm, the time required to scan a 6858 sequence databank using a query sequence 740 re...

Examines the causes and effects of stimulant and nicotine usage in schizophrenics. Compares three schools of thought on the smoking-schizophrenia connection: smoking causes schizophrenia; smoking out of boredom; smoking to ameliorate side effects of medications. Considers the shortcomings of current treatment modalities in drug abuse and smoking cessation where psychotic clients are concerned. ...

1Center for Geometric Computing, Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912-1910, U.S.A. 2Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, Via della Vasca Navale 79, 00146 Roma, Italy 3Department of Computer Science and Engineering, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260-2000, U.S.A...

During the last few years more and more functionalities of RNA have been discovered that were previously thought of being carried out by proteins alone. One of the most striking discoveries was the detection of microRNAs, a class of noncoding RNAs that play an important role in post-transcriptional gene regulation. Large-scale analyses are needed for the still increasingly growing amount of seq...

In this paper, we present a geometric method for describing the effects of the delay induced uncertainty on the stability of a standard Smith Predictor control scheme. The method consists of deriving the stability crossing curves in the parameter space defined by the nominal delay, and delay uncertainty, respectively. More precisely, we start by computing the crossing set, which consists of all...

We present in this paper an algorithm for nding degenerated common features by multiple comparison of a set of biological sequences (nucleic acids or proteins). The features that are of interest to us are words in the sequences. The algorithm uses the concept of a model we introduced earlier for locating these features. A model can be seen as a generalization of a consensus pattern as deened by...

We introduce the following general question: Let V be a complex n-dimensional space and for m k consider the GL V -module V n m k V m defined by V n m k f v vm V m dimSpanfv vmg k g We would like to determine dimV n m k for any choice of n m k. This question appears in various disguises in computer vision problems where the constraints of a multi-linear problem occupy a lowdimensional subspace....

The dynamic programming algorithm for optimal local alignment is similar to the dynamic programming algorithm for optimal global alignment given in Section 3.3. It proceeds by filling in a table with the values of v(i; j), with i; j increasing. The value of each entry is calculated according to a new basis and recurrence for v(i; j), given below. Unlike the global alignment algorithm, however, ...