Structure specificity of some immunoadjuvant synthetic glycopeptides

Summary The immunoadjuvant activity of muramyl dipeptide seems to be critically dependent on the type of substitution of the -carboxyl group of the D-isoglutamine residue. Moreover the nonapeptide L-Ala-D-isoGlu-L-Lys-D-Ala-(Gly)₅-OME also shows a definite effect.     

Minimum information about a microarray experiment (MIAME)-toward standards for microarray data.

Microarray analysis has become a widely used tool for the generation of gene expression data on a genomic scale. Although many significant results have been derived from microarray studies, one limitation has been the lack of standards for presenting and exchanging such data. Here we present a proposal, the Minimum Information About a Microarray Experiment (MIAME), that describes the minimum information required to ensure that microarray data can be easily interpreted and that results derived from its analysis can be independently verified. The ultimate goal of this work is to establish a standard for recording and reporting microarray-based gene expression data, which will in turn facilitate the establishment of databases and public repositories and enable the development of data analysis tools. With respect to MIAME, we concentrate on defining the content and structure of the necessary information rather than the technical format for capturing it.     

Mutations in the gene encoding the basal body protein RPGRIP1L, a nephrocystin-4 interactor, cause Joubert syndrome

Protein-protein interaction analyses have uncovered a ciliary and basal body protein network that, when disrupted, can result in nephronophthisis (NPHP), Leber congenital amaurosis, Senior-L?ken syndrome (SLSN) or Joubert syndrome (JBTS). However, details of the molecular mechanisms underlying these disorders remain poorly understood. RPGRIP1-like protein (RPGRIP1L) is a homolog of RPGRIP1 (RPGR-interacting protein 1), a ciliary protein defective in Leber congenital amaurosis. We show that RPGRIP1L interacts with nephrocystin-4 and that mutations in the gene encoding nephrocystin-4 (NPHP4) that are known to cause SLSN disrupt this interaction. RPGRIP1L is ubiquitously expressed, and its protein product localizes to basal bodies. Therefore, we analyzed RPGRIP1L as a candidate gene for JBTS and identified loss-of-function mutations in three families with typical JBTS, including the characteristic mid-hindbrain malformation. This work identifies RPGRIP1L as a gene responsible for JBTS and establishes a central role for cilia and basal bodies in the pathophysiology of this disorder.     

Association scan of 14,500 nonsynonymous SNPs in four diseases identifies autoimmunity variants

We have genotyped 14,436 nonsynonymous SNPs (nsSNPs) and 897 major histocompatibility complex (MHC) tag SNPs from 1,000 independent cases of ankylosing spondylitis (AS), autoimmune thyroid disease (AITD), multiple sclerosis (MS) and breast cancer (BC). Comparing these data against a common control dataset derived from 1,500 randomly selected healthy British individuals, we report initial association and independent replication in a North American sample of two new loci related to ankylosing spondylitis, ARTS1 and IL23R, and confirmation of the previously reported association of AITD with TSHR and FCRL3. These findings, enabled in part by increased statistical power resulting from the expansion of the control reference group to include individuals from the other disease groups, highlight notable new possibilities for autoimmune regulation and suggest that IL23R may be a common susceptibility factor for the major 'seronegative' diseases.     

Clustering patents using non-exhaustive overlaps

Patent documents are unique external sources of information that reveal the core technology underlying new inventions.Patents also serve as a strategic data source that can be mined to discover state-of-the-art technical development and subsequently help guide R&D investments.This research incorporates an ontology schema to extract and represent patent concepts.A clustering algorithm with non-exhaustive overlaps is proposed to overcome deficiencies with exhaustive clustering methods used in patent mining and technology discovery.The non-exhaustive clustering approach allows for the clustering of patent documents with overlapping technical findings and claims,a feature that enables the grouping of patents that define related key innovations.Legal advisors can use this approach to study potential cases of patent infringement or devise strategies to avoid litigation.The case study demonstrates the use of non-exhaustive overlaps algorithm by clustering US and Japan radio frequency identification (RFID) patents and by analyzing the legal implications of automated discovery of patent infringement.     

Automatic patent document summarization for collaborative knowledge systems and services

Engineering and research teams often develop new products and technologies by referring to inventions described in patent databases. Efficient patent analysis builds R&D knowledge, reduces new product development time, increases market success, and reduces potential patent infringement. Thus, it is beneficial to automatically and systematically extract information from patent documents in order to improve knowledge sharing and collaboration among R&D team members. In this research, patents are summarized using a combined ontology based and TF-IDF concept clustering approach. The ontology captures the general knowledge and core meaning of patents in a given domain. Then, the proposed methodology extracts, clusters, and integrates the content of a patent to derive a summary and a cluster tree diagram of key terms. Patents from the International Patent Classification (IPC) codes B25C, B25D, B25F (categories for power hand tools) and B24B, C09G and H011 (categories for chemical mechanical polishing) are used as case studies to evaluate the compression ratio, retention ratio, and classification accuracy of the summarization results. The evaluation uses statistics to represent the summary generation and its compression ratio, the ontology based keyword extraction retention ratio, and the summary classification accuracy. The results show that the ontology based approach yields about the same compression ratio as previous non-ontology based research but yields on average an 11% improvement for the retention ratio and a 14% improvement for classification accuracy.     

Direct multicriteria clustering algorithms

In a multicriteria clustering problem, optimization over more than one criterion is required. The problem can be treated in different ways: by reduction to a clustering problem with the single criterion obtained as a combination of the given criteria; by constrained clustering algorithms where a selected critetion is considered as the clustering criterion and all others determine the constraints; or by direct algorithms. In this paper two types of direct algorithms for solving multicriteria clustering problem are proposed: the modified relocation algorithm, and the modified agglomerative algorithm. Different elaborations of these two types of algorithms are discussed and compared. Finally, two applications of the proposed algorithms are presented. Elaborated version of the talks presented at the First Conference of the International Federation of Classification Societies, Aachen, 1987, at the International Conference on Social Science Methodology, Dubrovnik, 1988, and at the Second Conference of the International Federation of Classification Societies, Charlottesville, 1989. This work was supported in part by the Research Council of Slovenia.