The incidence of schizophrenia: A systematic review

There has been a debate on whether or not the incidence of schizophrenia varies across time and place. In order to optimise the evidence upon which this debate is based, we have undertaken a systematicsystematic review of the literature. In this paper we provide an overview of the methods of the review and a preliminary analysis of the studies identified to date. Electronic databases (Medline, Psychlnfo, Embase, LILAC) were systematically searched for articles published between January 1965 and December 2001. The search terms were: (schizo* OR psycho*)AND (incidence OR prevalence). References were also identified from review articles, reference list and by writing to authors. To date we have identified 137 papers drawn from 33 nations. 37 papers in language other than English await translation. The currently included papers have generated 1413 different items of rate information data. In order to analyze these data we have undertaken several sequential filters in order to identify (a) non-overlapping data, (b) birth cohort study versus noncohort studies, (c) overall and sex-specific rates, (d) diagnostic criteria, (e) age ranges, (f) epoch of study, and (g) data on migrant or other special interest groups. In addition, we will examine the impact of urbanicity of site, age and/or sex standardization, and quality score on the incidence rates. The various discrete incidence rates will be presented graphically and the impact of various filters on these rates will be inspected using meta-analytic techniques. The use of meta-analysis may help elucidate the epidemiological landscape with respect to the incidence of schizophrenia and aid in the generation of new hypothesis. Acknowledgements: The Stanley Medical Research Institute supported project

Bioinformatics for characterisation of allergens, allergenicity and allergic crossreactivity

Allergies are a major cause of chronic ill health in industrialised countries with the incidence of reported cases steadily increasing. This Research Focus details how bioinformatics is transforming the field of allergy through providing databases for management of allergen data, algorithms for characterisation of allergic crossreactivity, structural motifs and B- and T-cell epitopes, tools for prediction of allergenicity and techniques for genomic and proteomic analysis of allergens.

Identification of a minimal promoter sequence for the human N-acetyltransferase Type I gene that binds AP-1 (activator protein 1) and YY-1 (Yin and Yang 1)

Human N-acetyltransferase Type I (NAT1) catalyses the acetylation of many aromatic amine and hydrazine compounds and it has been implicated in the catabolism of folic acid. The enzyme is widely expressed in the body, although there are considerable differences in the level of activity between tissues. A search of the mRNA databases revealed the presence of several NAT1 transcripts in human tissue that appear to be derived from different promoters. Because little is known about NAT1 gene regulation, the present study was undertaken to characterize one of the putative promoter sequences of the NAT1 gene located just upstream of the coding region. We show with reverse-transcriptase PCR that mRNA transcribed from this promoter (Promoter 1) is present in a variety of human cell-lines, but not in quiescent peripheral blood mononuclear cells. Using deletion mutant constructs, we identified a 20 bp sequence located 245 bases upstream of the translation start site which was sufficient for basal NAT1 expression. It comprised an AP-1 (activator protein 1)-binding site, flanked on either side by a TCATT motif. Mutational analysis showed that the AP-1 site and the 3' TCATT sequence were necessary for gene expression, whereas the 5' TCATT appeared to attenuate promoter activity. Electromobility shift assays revealed two specific bands made up by complexes of c-Fos/Fra, c-Jun, YY-1 (Yin and Yang 1) and possibly Oct-1. PMA treatment enhanced expression from the NAT1 promoter via the AP-1-binding site. Furthermore, in peripheral blood mononuclear cells, PMA increased endogenous NAT1 activity and induced mRNA expression from Promoter I, suggesting that it is functional in vivo.

Computational methods for prediction of T-cell epitopes - a framework for modelling, testing, and applications

Computational models complement laboratory experimentation for efficient identification of MHC-binding peptides and T-cell epitopes. Methods for prediction of MHC-binding peptides include binding motifs, quantitative matrices, artificial neural networks, hidden Markov models, and molecular modelling. Models derived by these methods have been successfully used for prediction of T-cell epitopes in cancer, autoimmunity, infectious disease, and allergy. For maximum benefit, the use of computer models must be treated as experiments analogous to standard laboratory procedures and performed according to strict standards. This requires careful selection of data for model building, and adequate testing and validation. A range of web-based databases and MHC-binding prediction programs are available. Although some available prediction programs for particular MHC alleles have reasonable accuracy, there is no guarantee that all models produce good quality predictions. In this article, we present and discuss a framework for modelling, testing, and applications of computational methods used in predictions of T-cell epitopes. (C) 2004 Elsevier Inc. All rights reserved.

Trade spectrum of K4-e

A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

On the spectrum for K_{m+2}/K_m designs

The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

d-cube decompositions of K-n/K-m

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

2m-cycle systems of K2m+1/C-m

For all m greater than or equal to 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Star decompositions of cubes

Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.

The effects of normalisation on the ability of business end-users to detect data anomalies: An experimental evaluation

With the proliferation of relational database programs for PC's and other platforms, many business end-users are creating, maintaining, and querying their own databases. More importantly, business end-users use the output of these queries as the basis for operational, tactical, and strategic decisions. Inaccurate data reduce the expected quality of these decisions. Implementing various input validation controls, including higher levels of normalisation, can reduce the number of data anomalies entering the databases. Even in well-maintained databases, however, data anomalies will still accumulate. To improve the quality of data, databases can be queried periodically to locate and correct anomalies. This paper reports the results of two experiments that investigated the effects of different data structures on business end-users' abilities to detect data anomalies in a relational database. The results demonstrate that both unnormalised and higher levels of normalisation lower the effectiveness and efficiency of queries relative to the first normal form. First normal form databases appear to provide the most effective and efficient data structure for business end-users formulating queries to detect data anomalies.