MHCPEP, a database of MHC-binding peptides: update 1997

MHCPEP (http://wehih.wehi.edu.au/mhcpep/) is a curated database comprising over 13 000 peptide sequences known to bind MHC molecules, Entries are compiled from published reports as well as from direct submissions of experimental data, Each entry contains the peptide sequence, its MHC specificity and where available, experimental method, observed activity, binding affinity, source protein and anchor positions, as well as publication references, The present format of the database allows text string matching searches but can easily be converted for use in conjunction with sequence analysis packages. The database can be accessed via Internet using WWW or FTP.

A global marker database for Phytophthora infestans

A marker database was compiled for isolates of the potato and tomato late blight pathogen, Phytophthora infestans, originating from 41 locations which include 31 countries plus 10 regions within Mexico. Presently, the database contains information on 1,776 isolates for one or more of the following markers: restriction fragment length polymorphism (RFLP) fingerprint consisting of 23 bands; mating type; dilocus allozyme genotype; mitochondrial DNA haplotype; sensitivity to the fungicide metalaxyl; and virulence. In the database, 305 entries have unique RFLP fingerprints and 258 entries have unique multilocus genotypes based on RFLP fingerprint, dilocus allozyme genotype, and mating type. A nomenclature is described for naming multilocus genotypes based on the International Organization for Standardization (ISO) two-letter country code and a unique number, Forty-two previously published multilocus genotypes are represented in the database with references to publications. As a result of compilation of the database, seven new genotypes were identified and named. Cluster analysis of genotypes from clonally propagated populations worldwide generally confirmed a previously published classification of old and new genotypes. Genotypes from geographically distant countries were frequently clustered, and several old and new genotypes were found in two or more distant countries. The cluster analysis also demonstrated that A2 genotypes from Argentina differed from all others. The database is available via the Internet, and thus can serve as a resource for Phytophthora workers worldwide.

Eigenvalues of Casimir operators for gl(m/infinity)

A full set of Casimir operators for the Lie superalgebra gl(m/infinity) is constructed and shown to be well defined in the category O-FS generated by the highest-weight irreducible representations with only a finite number of non-zero weight components. The eigenvalues of these Casimir operators are determined explicitly in terms of the highest weight. Characteristic identities satisfied by certain (infinite) matrices with entries from gl(m/infinity) are also determined.

Allergen databases

Allergies represent a significant medical and industrial problem. Molecular and clinical data on allergens are growing exponentially and in this article we have reviewed nine specialized allergen databases and identified data sources related to protein allergens contained in general purpose molecular databases. An analysis of allergens contained in public databases indicates a high level of redundancy of entries and a relatively low coverage of allergens by individual databases. From this analysis we identify current database needs for allergy research and, in particular, highlight the need for a centralized reference allergen database.

CysView: protein classification based on cysteine pairing patterns

CysView is a web-based application tool that identifies and classifies proteins according to their disulfide connectivity patterns. It accepts a dataset of annotated protein sequences in various formats and returns a graphical representation of cysteine pairing patterns. CysView displays cysteine patterns for those records in the data with disulfide annotations. It allows the viewing of records grouped by connectivity patterns. CysView's utility as an analysis tool was demonstrated by the rapid and correct classification of scorpion toxin entries from GenPept on the basis of their disulfide pairing patterns. It has proved useful for rapid detection of irrelevant and partial records, or those with incomplete annotations. CysView can be used to support distant homology between proteins. CysView is publicly available at http://research.i2r.a-star.edu.sg/CysView/.

MHCPEP, a database of MHC-binding peptides: Update 1996

MHCPEP is a curated database comprising over 9000 peptide sequences known to bind MHC molecules. Entries are compiled from published reports as well as from direct submissions of experimental data. Each entry contains the peptide sequence, its MHC specificity and, when available, experimental method, observed activity, binding affinity, source protein, anchor positions and publication references. The present format of the database allows text string matching searches but can easily be converted for use in conjunction with sequence analysis packages. The database can be accessed via Internet using WWW, FTP or Gopher.

Casimir invariants and characteristic identities for gl(infinity)

A full set of (higher-order) Casimir invariants for the Lie algebra gl(infinity) is constructed and shown to be well defined in the category O-FS generated by the highest weight (unitarizable) irreducible representations with only a finite number of nonzero weight components. Moreover, the eigenvalues of these Casimir invariants are determined explicitly in terms of the highest weight. Characteristic identities satisfied by certain (infinite) matrices with entries from gl(infinity) are also determined and generalize those previously obtained for gl(n) by Bracken and Green [A. J. Bracken and H. S. Green, J. Math. Phys. 12, 2099 (1971); H. S. Green, ibid. 12, 2106 (1971)]. (C) 1997 American Institute of Physics.

Integer matrix diagonalization

We consider algorithms for computing the Smith normal form of integer matrices. A variety of different strategies have been proposed, primarily aimed at avoiding the major obstacle that occurs in such computations-explosive growth in size of intermediate entries. We present a new algorithm with excellent performance. We investigate the complexity of such computations, indicating relationships with NP-complete problems. We also describe new heuristics which perform well in practice. Wie present experimental evidence which shows our algorithm outperforming previous methods. (C) 1997 Academic Press Limited.

Molecular Sieve Silica Membranes

The Encyclopedia of Nanoscience and NanotechnologyTM is the world's first encyclopedia ever published in the field of nanotechnology. The 10-volume Encyclopedia is an unprecedented single reference source that provides an ideal introduction and overview of recent advances and emerging new aspects of nanotechnology, spanning from science to engineering to medicine. Although there are many books/handbooks and journals focused on nanotechnology, no encyclopedic reference work has been published as of today. The Encyclopedia fills this gap to provide basic information on all fundamental and applied aspects of nanotechnology by drawing on two decades of pioneering research. It is the only scientific work of its kind since the beginning of the field of nanotechnology, bringing together core knowledge and the very latest advances. About 400 review chapters and hundreds of entries written by over 1,000 of the world's leading scientists. It is written for all audience levels, allowing non-scientists to understand the nanotechnology while providing up-to-date information to active scientists and experts in the field. This outstanding encyclopedia is an indispensable source for research professionals, technology investors and developers seeking the most up-to-date information on nanotechnology, among a wide range of disciplines, from science to engineering to medicine.

Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven

A critical set in a latin square of order n is a set of entries in a latin square which can be embedded in precisely one latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one latin square of order n. In this paper we find smallest weak and smallest totally weak critical sets for all the latin squares of orders six and seven. Moreover, we computationally prove that there is no (totally) weak critical set in the back circulant latin square of order five and we find a totally weak critical set of size seven in the other main class of latin squares of order five.

A census of critical sets in the Latin squares of order at most six

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

An investigation of 2-critical sets in latin squares

In this paper we focus on the existence of 2-critical sets in the latin square corresponding to the elementary abelian 2-group of order 2(n). It has been shown by Stinson and van Rees that this latin square contains a 2-critical set of volume 4(n) - 3(n). We provide constructions for 2-critical sets containing 4(n) - 3(n) + 1 - (2(k-1) + 2(m-1) + 2(n-(k+m+1))) entries, where 1 less than or equal to k less than or equal to n and 1 less than or equal to m less than or equal to n - k. That is, we construct 2-critical sets for certain values less than 4(n) - 3(n) + 1 - 3 (.) 2([n /3]-1). The results raise the interesting question of whether, for the given latin square, it is possible to construct 2-critical sets of volume m, where 4(n) - 3(n) + 1 - 3 (.) 2([n/3]-1) < m < 4(n) - 3(n).

Behavioural characterization of Vitamin D receptor knockout mice

Vitamin D (calcitriol) is a nuclear transcription regulator acting via a nuclear hormone receptor (VDR). In addition to its role in the regulation of calcium and phosphate horneostasis and in bone formation, Vitamin D is also thought to be involved in brain function. The aim of this study was to behaviourally phenotype VDR knockout mice. We characterized the behaviour of VDR null mutant mice and wildtype littermate controls by subjecting them to a range of tests including a primary behavioural screen (using the SHIRPA protocol), rotarod, gait analysis, Y-maze, marble burying test, bedding test, holeboard test, elevated plus maze, open field test and prepulse inhibition of the acoustic startle response. There were no effects of genotype on most of the scores from the SHIRPA protocol except that VDR -/- mice had alopecia, were shorter and weighed less than VDR +/+ mice. VDR -/- mice had a shorter gait as well as impairments on the rotarod, in the bedding test and impaired habituation in both the open field and on the acoustic startle response. The VDR -/- mice had normal acoustic startle responses but had impaired PPI at long (256 ms) but not short (64 ms) prepulse to pulse intervals. The VDR -/- mice were less active in the open field and buried fewer marbles in the marble burying test. However, there were no differences in the time spent on the open arms of the elevated plus maze or in working memory as assessed by repeat arm entries on the Y-maze. Therefore, it appears that VDR -/- mice have muscular and motor impairments that significantly affects locomotor behaviour but seemingly no impairments in cognition as indicated by exploration, working memory or anxiety. (C) 2004 Elsevier B.V. All rights reserved.