Gene2EST: a BLAST2 server for searching expressed sequence tag (EST) databases with eukaryotic gene-sized queries

Expressed sequence tags (ESTs) are randomly sequenced cDNA clones. Currently, nearly 3 million human and 2 million mouse ESTs provide valuable resources that enable researchers to investigate the products of gene expression. The EST databases have proven to be useful tools for detecting homologous genes, for exon mapping, revealing differential splicing, etc. With the increasing availability of large amounts of poorly characterised eukaryotic (notably human) genomic sequence, ESTs have now become a vital tool for gene identification, sometimes yielding the only unambiguous evidence for the existence of a gene expression product. However, BLAST-based Web servers available to the general user have not kept pace with these developments and do not provide appropriate tools for querying EST databases with large highly spliced genes, often spanning 50 000–100 000 bases or more. Here we describe Gene2EST (http://woody.embl-heidelberg.de/gene2est/), a server that brings together a set of tools enabling efficient retrieval of ESTs matching large DNA queries and their subsequent analysis. RepeatMasker is used to mask dispersed repetitive sequences (such as Alu elements) in the query, BLAST2 for searching EST databases and Artemis for graphical display of the findings. Gene2EST combines these components into a Web resource targeted at the researcher who wishes to study one or a few genes to a high level of detail.

Web-based access to mouse models of human cancers: the Mouse Tumor Biology (MTB) Database

The Mouse Tumor Biology (MTB) Database serves as a curated, integrated resource for information about tumor genetics and pathology in genetically defined strains of mice (i.e., inbred, transgenic and targeted mutation strains). Sources of information for the database include the published scientific literature and direct data submissions by the scientific community. Researchers access MTB using Web-based query forms and can use the database to answer such questions as ‘What tumors have been reported in transgenic mice created on a C57BL/6J background?’, ‘What tumors in mice are associated with mutations in the Trp53 gene?’ and ‘What pathology images are available for tumors of the mammary gland regardless of genetic background?’. MTB has been available on the Web since 1998 from the Mouse Genome Informatics web site (http://www.informatics.jax.org). We have recently implemented a number of enhancements to MTB including new query options, redesigned query forms and results pages for pathology and genetic data, and the addition of an electronic data submission and annotation tool for pathology data.

CKAAPs DB: a conserved key amino acid positions database

The Conserved Key Amino Acid Positions DataBase (CKAAPs DB) provides access to an analysis of structurally similar proteins with dissimilar sequences where key residues within a common fold are identified. The derivation and significance of CKAAPs starting from pairwise structure alignments is described fully in Reddy et al. [Reddy,B.V.B., Li,W.W., Shindyalov,I.N. and Bourne,P.E. (2000) Proteins, in press]. The CKAAPs identified from this theoretical analysis are provided to experimentalists and theoreticians for potential use in protein engineering and modeling. It has been suggested that CKAAPs may be crucial features for protein folding, structural stability and function. Over 170 substructures, as defined by the Combinatorial Extension (CE) database, which are found in approximately 3000 representative polypeptide chains have been analyzed and are available in the CKAAPs DB. CKAAPs DB also provides CKAAPs of the representative set of proteins derived from the CE and FSSP databases. Thus the database contains over 5000 representative poly­peptide chains, covering all known structures in the PDB. A web interface to a relational database permits fast retrieval of structure-sequence alignments, CKAAPs and associated statistics. Users may query by PDB ID, protein name, function and Enzyme Classification number. Users may also submit protein alignments of their own to obtain CKAAPs. An interface to display CKAAPs on each structure from a web browser is also being implemented. CKAAPs DB is maintained by the San Diego Supercomputer Center and accessible at the URL http://ckaaps.sdsc.edu.

PALI—a database of Phylogeny and ALIgnment of homologous protein structures

PALI (release 1.2) contains three-dimensional (3-D) structure-dependent sequence alignments as well as structure-based phylogenetic trees of homologous protein domains in various families. The data set of homologous protein structures has been derived by consulting the SCOP database (release 1.50) and the data set comprises 604 families of homologous proteins involving 2739 protein domain structures with each family made up of at least two members. Each member in a family has been structurally aligned with every other member in the same family (pairwise alignment) and all the members in the family are also aligned using simultaneous super­position (multiple alignment). The structural alignments are performed largely automatically, with manual interventions especially in the cases of distantly related proteins, using the program STAMP (version 4.2). Every family is also associated with two dendrograms, calculated using PHYLIP (version 3.5), one based on a structural dissimilarity metric defined for every pairwise alignment and the other based on similarity of topologically equivalent residues. These dendrograms enable easy comparison of sequence and structure-based relationships among the members in a family. Structure-based alignments with the details of structural and sequence similarities, superposed coordinate sets and dendrograms can be accessed conveniently using a web interface. The database can be queried for protein pairs with sequence or structural similarities falling within a specified range. Thus PALI forms a useful resource to help in analysing the relationship between sequence and structure variation at a given level of sequence similarity. PALI also contains over 653 ‘orphans’ (single member families). Using the web interface involving PSI_BLAST and PHYLIP it is possible to associate the sequence of a new protein with one of the families in PALI and generate a phylogenetic tree combining the query sequence and proteins of known 3-D structure. The database with the web interfaced search and dendrogram generation tools can be accessed at http://pa uling.mbu.iisc.ernet.in/~pali.

GlycoSuiteDB: a new curated relational database of glycoprotein glycan structures and their biological sources

GlycoSuiteDB is a relational database that curates information from the scientific literature on glyco­protein derived glycan structures, their biological sources, the references in which the glycan was described and the methods used to determine the glycan structure. To date, the database includes most published O-linked oligosaccharides from the last 50 years and most N-linked oligosaccharides that were published in the 1990s. For each structure, information is available concerning the glycan type, linkage and anomeric configuration, mass and composition. Detailed information is also provided on native and recombinant sources, including tissue and/or cell type, cell line, strain and disease state. Where known, the proteins to which the glycan structures are attached are reported, and cross-references to the SWISS-PROT/TrEMBL protein sequence databases are given if applicable. The GlycoSuiteDB annotations include literature references which are linked to PubMed, and detailed information on the methods used to determine each glycan structure are noted to help the user assess the quality of the structural assignment. GlycoSuiteDB has a user-friendly web interface which allows the researcher to query the database using mono­isotopic or average mass, monosaccharide composition, glycosylation linkages (e.g. N- or O-linked), reducing terminal sugar, attached protein, taxonomy, tissue or cell type and GlycoSuiteDB accession number. Advanced queries using combinations of these parameters are also possible. GlycoSuiteDB can be accessed on the web at http://www.glycosuite.com.

MethDB—a public database for DNA methylation data

Methylation of cytosine in the 5 position of the pyrimidine ring is a major modification of the DNA in most organisms. In eukaryotes, the distribution and number of 5-methylcytosines (5mC) along the DNA is heritable but can also change with the developmental state of the cell and as a response to modifications of the environment. While DNA methylation probably has a number of functions, scientific interest has recently focused on the gene silencing effect methylation can have in eukaryotic cells. In particular, the discovery of changes in the methylation level during cancer development has increased the interest in this field. In the past, a vast amount of data has been generated with different levels of resolution ranging from 5mC content of total DNA to the methylation status of single nucleotides. We present here a database for DNA methylation data that attempts to unify these results in a common resource. The database is accessible via WWW (http://www.methdb.de). It stores information about the origin of the investigated sample and the experimental procedure, and contains the DNA methylation data. Query masks allow for searching for 5mC content, species, tissue, gene, sex, phenotype, sequence ID and DNA type. The output lists all available information including the relative gene expression level. DNA methylation patterns and methylation profiles are shown both as a graphical representation and as G/A/T/C/5mC-sequences or tables with sequence positions and methylation levels, respectively.

The life sciences Global Image Database (GID)

Although a vast amount of life sciences data is generated in the form of images, most scientists still store images on extremely diverse and often incompatible storage media, without any type of metadata structure, and thus with no standard facility with which to conduct searches or analyses. Here we present a solution to unlock the value of scientific images. The Global Image Database (GID) is a web-based (http://www.g wer.ch/qv/gid/gid.htm) structured central repository for scientific annotated images. The GID was designed to manage images from a wide spectrum of imaging domains ranging from microscopy to automated screening. The annotations in the GID define the source experiment of the images by describing who the authors of the experiment are, when the images were created, the biological origin of the experimental sample and how the sample was processed for visualization. A collection of experimental imaging protocols provides details of the sample preparation, and labeling, or visualization procedures. In addition, the entries in the GID reference these imaging protocols with the probe sequences or antibody names used in labeling experiments. The GID annotations are searchable by field or globally. The query results are first shown as image thumbnail previews, enabling quick browsing prior to original-sized annotated image retrieval. The development of the GID continues, aiming at facilitating the management and exchange of image data in the scientific community, and at creating new query tools for mining image data.

The Homeodomain Resource: sequences, structures, DNA binding sites and genomic information

The Homeodomain Resource is an annotated collection of non-redundant protein sequences, three-dimensional structures and genomic information for the homeodomain protein family. Release 3.0 contains 795 full-length homeodomain-containing sequences, 32 experimentally-derived structures and 143 homeo­box loci implicated in human genetic disorders. Entries are fully hyperlinked to facilitate easy retrieval of the original records from source databases. A simple search engine with a graphical user interface is provided to query the component databases and assemble customized data sets. A new feature for this release is the addition of DNA recognition sites for all human homeodomain proteins described in the literature. The Homeodomain Resource is freely available through the World Wide Web at http://genome.nhgri.nih.gov/homeodomain.

Human gamma-glutamyl hydrolase: cloning and characterization of the enzyme expressed in vitro.

A cDNA encoding human gamma-glutamyl hydrolase has been identified by searching an expressed sequence tag data base and using rat gamma-glutamyl hydrolase cDNA as the query sequence. The cDNA encodes a 318-amino acid protein of Mr 35,960. The deduced amino acid sequence of human gamma-glutamyl hydrolase shows 67% identity to that of rat gamma-glutamyl hydrolase. In both rat and human the 24 amino acids preceding the N terminus constitute a structural motif that is analogous to a leader or signal sequence. There are four consensus asparagine glycosylation sites in the human sequence, with three of them conserved in the rat enzyme. Expression of both the human and rat cDNA in Escherichia coli produced antigenically related proteins with enzyme activities characteristic of the native human and rat enzymes, respectively, when methotrexate di- or pentaglutamate were used as substrates. With the latter substrate the rat enzyme cleaved the innermost gamma-glutamyl linkage resulting in the sole production of methotrexate as the pteroyl containing product. The human enzyme differed in that it produced methotrexate tetraglutamate initially, followed by the triglutamate, and then the diglutamate and methotrexate. Hence the rat enzyme is an endopeptidase with methotrexate pentaglutamate as substrate, whereas the human enzyme exhibits exopeptidase activity. Another difference is that the expressed rat enzyme is equally active on methotrexate di- and pentaglutamate whereas the human enzyme has severalfold greater activity on methotrexate pentaglutamate compared with the diglutamate. These properties are consistent with the enzymes derived from human and rat sources.

Desenvolvimento de video educativo para a aprendizagem do autocateterismo vesical intermitente

A bexiga neurogênica é uma disfunção vesical decorrente principalmente da lesão medular. O cateterismo vesical intermitente é o tratamento mais indicado na atualidade, deve ser realizado de 4 a 6 vezes ao dia, durante toda a vida, visando a proteção do trato urinário superior e a aquisição da continência urinária. Na reabilitação desses indivíduos, a autocateterização vesical é um desafio enfrentado na busca pela autonomia, privacidade, inserção social e participação. Os vídeos educativos são utilizados para o aprendizado do autocateterismo em vários países, por serem de fácil utilização e acesso via internet. Apesar disso, não existem vídeos realizados para o contexto brasileiro, levando em consideração os cateteres urinários e a técnica utilizada no Brasil. Este estudo teve como objetivo desenvolver e validar um vídeo educativo para a realização do autocateterismo vesical intermitente limpo. Trata-se de um estudo quantitativo, desenvolvido em duas fases: 1ª fase com a avaliação de vídeos educativos públicos direcionados para a aprendizagem do autocateterismo vesical intermitente com a técnica limpa; e 2ª Fase, com o desenvolvimento e validação de um vídeo educativo voltado para aprendizagem do autocateterismo. O levantamento dos vídeos utilizou um site de compartilhamento de vídeos utilizando o descritor \"autocateterismo\". Os vídeos foram avaliados por três juízes da área de saúde. O processo de desenvolvimento e validação do roteiro do vídeo educativo utilizou questionários previamente ratificados. Participaram dessas etapas, respectivamente, 18 e 17 juízes experts em reabilitação e/ou no ensino em saúde. O levantamento mostrou que apenas 3,5% (172) do total de vídeos disponíveis no site pesquisado eram voltados para o aprendizado do autocateterismo no contexto brasileiro. Seis vídeos eram específicos para o autocateterismo, dos quais quatro tinham informações desatualizadas ou incorretas, apenas dois atingiram a pontuação aceitável. Na validação do roteiro observou-se um predomínio de participantes do sexo feminino (94,44%), com idade de 30 a 60 anos, dos quais 72,22% possuíam mestrado e 50% atuavam há mais de cinco anos na área de reabilitação. O roteiro foi considerado validado com 96,29% das respostas dos juízes \"concordo\" ou \"concordo totalmente\" nas questões referentes ao quesito objetivo, 91,09% para quesito conteúdo, 98,12% em relação ao quesito relevância, 75% quanto ao quesito ambiente, 71,11% no quesito linguagem verbal e 92,70% referente à inclusão de tópicos. A produção do vídeo contou com uso de tecnologia 3D e apoio de uma equipe técnica especializada. No que se refere à validação do conteúdo do vídeo educativo, o conteúdo do vídeo foi considerado validado com 100% dos juízes que responderam \"concordo\" ou \"concordo totalmente\" nas questões referentes à funcionalidade, 86,27% referentes à usabilidade, 97,06% no quesito eficiência, 100% para técnica audiovisual, 94,11% quanto ao ambiente e 97,05% procedimento. O vídeo educativo foi avaliado positivamente tanto pela qualidade das informações quanto pela didática do ensino, mostrando a relevância da validação de materiais educativos. A expectativa é disseminar o vídeo educativo em diferentes centros de reabilitação e Universidades, visando propagar e tornar o conhecimento sobre a temática mais acessível à sociedade e aos profissionais de saúde, em especial os de reabilitação. Além de incentivar e embasar metodologicamente o desenvolvimento de outros vídeos educativos na área da saúde

COMPENDIUM: una herramienta de generación de resúmenes modular

En este artículo presentamos COMPENDIUM, una herramienta de generación de resúmenes de textos modular. Esta herramienta se compone de un módulo central con cinco etapas bien diferenciadas: i) análisis lingüístico; ii) detección de redundancia; iii) identificación del tópico; iv) detección de relevancia; y v) generación del resumen, y una serie de módulos adicionales que permiten incrementar las funcionalidades de la herramienta permitiendo la generación de distintos tipos de resúmenes, como por ejemplo orientados a un tema concreto. Realizamos una evaluación exhaustiva en dos dominios distintos (noticias de prensa y documentos sobre lugares turísticos) y analizamos diferentes tipos de resúmenes generados con COMPENDIUM (mono-documento, multi-documento, genéricos y orientados a un tema). Además, comparamos nuestro sistema con otros sistemas de generación de resúmenes actuales. Los resultados que se obtienen demuestran que la herramienta COMPENDIUM es capaz de generar resúmenes competitivos para los distintos tipos de resúmenes propuestos.

A general proposal to multilingual information access based on syntactic-semantic patterns

In the last few years, there has been a wide development in the research on textual information systems. The goal is to improve these systems in order to allow an easy localization, treatment and access to the information stored in digital format (Digital Databases, Documental Databases, and so on). There are lots of applications focused on information access (for example, Web-search systems like Google or Altavista). However, these applications have problems when they must access to cross-language information, or when they need to show information in a language different from the one of the query. This paper explores the use of syntactic-sematic patterns as a method to access to multilingual information, and revise, in the case of Information Retrieval, where it is possible and useful to employ patterns when it comes to the multilingual and interactive aspects. On the one hand, the multilingual aspects that are going to be studied are the ones related to the access to documents in different languages from the one of the query, as well as the automatic translation of the document, i.e. a machine translation system based on patterns. On the other hand, this paper is going to go deep into the interactive aspects related to the reformulation of a query based on the syntactic-semantic pattern of the request.

Using WordNet relations and semantic classes in information retrieval tasks

In this paper we explore the use of semantic classes in an existing information retrieval system in order to improve its results. Thus, we use two different ontologies of semantic classes (WordNet domain and Basic Level Concepts) in order to re-rank the retrieved documents and obtain better recall and precision. Finally, we implement a new method for weighting the expanded terms taking into account the weights of the original query terms and their relations in WordNet with respect to the new ones (which have demonstrated to improve the results). The evaluation of these approaches was carried out in the CLEF Robust-WSD Task, obtaining an improvement of 1.8% in GMAP for the semantic classes approach and 10% in MAP employing the WordNet term weighting approach.

TEXT-MESS: Intelligent, Interactive and Multilingual Text Mining based on Human Language Technologies, TIN2006-15265-C06

The goal of the project is to analyze, experiment, and develop intelligent, interactive and multilingual Text Mining technologies, as a key element of the next generation of search engines, systems with the capacity to find "the need behind the query". This new generation will provide specialized services and interfaces according to the search domain and type of information needed. Moreover, it will integrate textual search (websites) and multimedia search (images, audio, video), it will be able to find and organize information, rather than generating ranked lists of websites.

Contextual visual localization: cascaded submap classification, optimized saliency detection, and fast view matching

In this paper, we present a novel coarse-to-fine visual localization approach: contextual visual localization. This approach relies on three elements: (i) a minimal-complexity classifier for performing fast coarse localization (submap classification); (ii) an optimized saliency detector which exploits the visual statistics of the submap; and (iii) a fast view-matching algorithm which filters initial matchings with a structural criterion. The latter algorithm yields fine localization. Our experiments show that these elements have been successfully integrated for solving the global localization problem. Context, that is, the awareness of being in a particular submap, is defined by a supervised classifier tuned for a minimal set of features. Visual context is exploited both for tuning (optimizing) the saliency detection process, and to select potential matching views in the visual database, close enough to the query view.