SEARCH · PubMed Health

Results for “Biological databases”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,171 records · Page 65Linked to original sources

PubMed2006

Fold recognition and accurate sequence-structure alignment of sequences directing beta-sheet proteins.

The ability to predict structure from sequence is particularly important for toxins, virulence factors, allergens, cytokines, and other proteins of public health importance. Many such functions are represented in the parallel beta-helix and beta-trefoil families. A method using pairwise beta-strand interaction probabilities coupled with evolutionary information represented by sequence profiles is developed to tackle these problems for the beta-helix and beta-trefoil folds. The algorithm BetaWrapPro employs a "wrapping" component that may capture folding processes with an initiation stage followed by processive interaction of the sequence with the already-formed motifs. BetaWrapPro outperforms all previous motif recognition programs for these folds, recognizing the beta-helix with 100% sensitivity and 99.7% specificity and the beta-trefoil with 100% sensitivity and 92.5% specificity, in crossvalidation on a database of all nonredundant known positive and negative examples of these fold classes in the PDB. It additionally aligns 88% of residues for the beta-helices and 86% for the beta-trefoils accurately (within four residues of the exact position) to the structural template, which is then used with the side-chain packing program SCWRL to produce 3D structure predictions. One striking result has been the prediction of an unexpected parallel beta-helix structure for a pollen allergen, and its recent confirmation through solution of its structure. A Web server running BetaWrapPro is available and outputs putative PDB-style coordinates for sequences predicted to form the target folds.

Algorithms↗

PubMed2005

List of lists-annotated (LOLA): a database for annotation and comparison of published microarray gene lists.

Microarray profiling of RNA expression is a powerful tool that generates large lists of transcripts that are potentially relevant to a disease or treatment. However, because the lists of changed transcripts are embedded in figures and tables, they are typically inaccessible for search engines. Due to differences in gene nomenclatures, the lists are difficult to compare between studies. LOLA (Lists of Lists Annotated) is an internet-based database for comparing gene lists from microarray studies or other genomic-scale methods. It serves as a common platform to compare and reannotate heterogeneous gene lists from different microarray platforms or different genomic methodologies such as serial analysis of gene expression (SAGE) or proteomics. LOLA () provides researchers with a means to store, annotate, and compare gene lists produced from different studies or different analyses of the same study. It is especially useful in identifying potentially "high interest" genes which are reported as significant across multiple studies and species. Its application to the fields of stem cell, cancer, and aging research is demonstrated by comparing published papers.

Animals↗

PubMed2006

Analysis of expressed sequence tags from skeletal muscle-specific cDNA library of Chinese native Xiang pig.

A Longissimus Dorsi muscle cDNA library of Xiang Pig was constructed, and 131 randomly isolated clones were sequenced in this study. The results of bioinformatics analysis showed that 131 ESTs represented 109 unique clones sequences, of which 99 showed homology to previously identified genes in humans or other mammals, 3 matched other uncharacterized expressed sequence tags (ESTs), and 7 showed no significant matches to sequences already present in DNA databases. No protein matches were found for 10 ESTs. Functional analysis of the ESTs showed that a considerable proportion of them encoded proteins involved in gene/protein expression (45.46%). Other classes included genes involved in metabolism (10.10%), cell structure/motility (10.10%), cell/organism defense (5.05%), cell signaling/communication (2.02%), and cell division (0.0%). Unclassified genes constituted the remaining 27.27%. This study reported the results of the first gene expression profile analysis of Chinese native Xiang Pig skeletal muscle cells, thereby greatly facilitating the functional study of candidate genes involved in muscle growth as well as in the improvement of meat quality in domestic pigs.

Animals↗

PubMed2005

ArrayExpress--a public repository for microarray gene expression data at the EBI.

ArrayExpress is a public repository for microarray data that supports the MIAME (Minimum Information About a Microarray Experiment) requirements and stores well-annotated raw and normalized data. As of November 2004, ArrayExpress contains data from approximately 12,000 hybridizations covering 35 species. Data can be submitted online or directly from local databases or LIMS in a standard format, and password-protected access to prepublication data is provided for reviewers and authors. The data can be retrieved by accession number or queried by various parameters such as species, author and array platform. A facility to query experiments by gene and sample properties is provided for a growing subset of curated data that is loaded in to the ArrayExpress data warehouse. Data can be visualized and analysed using Expression Profiler, the integrated data analysis tool. ArrayExpress is available at http://www.ebi.ac.uk/arrayexpress.

Animals↗

PubMed2006

The Arabidopsis unannotated secreted peptide database, a resource for plant peptidomics.

In the era of genomics, if a gene is not annotated, it is not investigated. Due to their small size, genes encoding peptides are often missed in genome annotations. Secreted peptides are important regulators of plant growth, development, and physiology. Identification of additional peptide signals by sequence homology searches has had limited success due to sequence heterogeneity. A bioinformatics approach was taken to find unannotated Arabidopsis (Arabidopsis thaliana) peptides. Arabidopsis chromosome sequences were searched for all open reading frames (ORFs) encoding peptides and small proteins between 25 and 250 amino acids in length. The translated ORFs were then sequentially queried for the presence of an amino-terminal cleavable signal peptide, the absence of transmembrane domains, and the absence of endoplasmic reticulum lumenal retention sequences. Next, the ORFs were filtered against the The Arabidopsis Information Resource 6.0 annotated Arabidopsis genes to remove those ORFs overlapping known genes. The remaining 33,809 ORFs were placed in a relational database to which additional annotation data were deposited. Genome-wide tiling array data were compared with the coordinates of the ORFs, supporting the possibility that many of the ORFs may be expressed. In addition, clustering and sequence similarity analyses revealed that many of the putative peptides are in gene families and/or appear to be present in the rice (Oryza sativa) genome. A subset of the ORFs was evaluated by reverse transcription-PCR and, for one-fifth of those, expression was detected. These results support the idea that the number and diversity of plant peptides is broader than currently assumed. The peptides identified and their annotation data may be viewed or downloaded through a searchable Web interface at peptidome.missouri.edu.

Arabidopsis↗

PubMed2004

DEG: a database of essential genes.

Essential genes are genes that are indispensable to support cellular life. These genes constitute a minimal gene set required for a living cell. We have constructed a Database of Essential Genes (DEG), which contains all the essential genes that are currently available. The functions encoded by essential genes are considered a foundation of life and therefore are likely to be common to all cells. Users can BLAST the query sequences against DEG. If homologous genes are found, it is possible that the queried genes are also essential. Users can search for essential genes by their function or name. Users can also browse and extract all the records in DEG. Essential gene products comprise excellent targets for antibacterial drugs. Analysis of essential genes could help to answer the question of what are the basic functions necessary to support cellular life. DEG is freely accessible from the website http://tubic.tju.edu.cn/deg/.

Computational Biology↗

PubMed2006

NERVE: new enhanced reverse vaccinology environment.

BACKGROUND: Since a milestone work on Neisseria meningitidis B, Reverse Vaccinology has strongly enhanced the identification of vaccine candidates by replacing several experimental tasks using in silico prediction steps. These steps have allowed scientists to face the selection of antigens from the predicted proteome of pathogens, for which cell culture is difficult or impossible, saving time and money. However, this good example of bioinformatics-driven immunology can be further developed by improving in silico steps and implementing biologist-friendly tools. RESULTS: We introduce NERVE (New Enhanced Reverse Vaccinology Environment), an user-friendly software environment for the in silico identification of the best vaccine candidates from whole proteomes of bacterial pathogens. The software integrates multiple robust and well-known algorithms for protein analysis and comparison. Vaccine candidates are ranked and presented in a html table showing relevant information and links to corresponding primary data. Information concerning all proteins of the analyzed proteome is not deleted along selection steps but rather flows into an SQL database for further mining and analyses. CONCLUSION: After learning from recent years' works in this field and analysing a large dataset, NERVE has been implemented and tuned as the first available tool able to rank a restricted pool (approximately 8-9% of the whole proteome) of vaccine candidates and to show high recall (approximately 75-80%) of known protective antigens. These vaccine candidates are required to be "safe" (taking into account autoimmunity risk) and "easy" for further experimental, high-throughput screening (avoiding possibly not soluble antigens). NERVE is expected to help save time and money in vaccine design and is available as an additional file with this manuscript; updated versions will be available at http://www.bio.unipd.it/molbinfo.

Algorithms↗

PubMed2006

3' UTR seed matches, but not overall identity, are associated with RNAi off-targets.

Off-target gene silencing can present a notable challenge in the interpretation of data from large-scale RNA interference (RNAi) screens. We performed a detailed analysis of off-targeted genes identified by expression profiling of human cells transfected with small interfering RNA (siRNA). Contrary to common assumption, analysis of the subsequent off-target gene database showed that overall identity makes little or no contribution to determining whether the expression of a particular gene will be affected by a given siRNA, except for near-perfect matches. Instead, off-targeting is associated with the presence of one or more perfect 3' untranslated region (UTR) matches with the hexamer or heptamer seed region (positions 2-7 or 2-8) of the antisense strand of the siRNA. These findings have strong implications for future siRNA design and the application of RNAi in high-throughput screening and therapeutic development.

3' Untranslated Regions↗

PubMed2003

A table-driven, full-sensitivity similarity search algorithm.

Searching a database for a local alignment to a query under a typical scoring scheme, such as PAM120 or BLOSUM62 with affine gap costs, is a computation that has resisted algorithmic improvement due to its basis in dynamic programming and the weak nature of the signals being searched for. In a query preprocessing step, a set of tables can be built that permit one to (a) eliminate a large fraction of the dynamic programming matrix from consideration and (b) to compute several steps of the remainder with a single table lookup. While this result is not an asymptotic improvement over the original Smith-Waterman algorithm, its complexity is characterized in terms of some sparse features of the matrix and it yields the fastest software implementation to date for such searches.

Algorithms↗

PubMed2003

The PEDANT genome database.

The PEDANT genome database (http://pedant.gsf.de) provides exhaustive automatic analysis of genomic sequences by a large variety of established bioinformatics tools through a comprehensive Web-based user interface. One hundred and seventy seven completely sequenced and unfinished genomes have been processed so far, including large eukaryotic genomes (mouse, human) published recently. In this contribution, we describe the current status of the PEDANT database and novel analytical features added to the PEDANT server in 2002. Those include: (i) integration with the BioRS data retrieval system which allows fast text queries, (ii) pre-computed sequence clusters in each complete genome, (iii) a comprehensive set of tools for genome comparison, including genome comparison tables and protein function prediction based on genomic context, and (iv) computation and visualization of protein-protein interaction (PPI) networks based on experimental data. The availability of functional and structural predictions for 650 000 genomic proteins in well organized form makes PEDANT a useful resource for both functional and structural genomics.

Animals↗

PubMed2005

Satellog: a database for the identification and prioritization of satellite repeats in disease association studies.

BACKGROUND: To date, 35 human diseases, some of which also exhibit anticipation, have been associated with unstable repeats. Anticipation has been reported in a number of diseases in which repeat expansion may have a role in etiology. Despite the growing importance of unstable repeats in disease, currently no resource exists for the prioritization of repeats. Here we present Satellog, a database that catalogs all pure 1-16 repeat unit satellite repeats in the human genome along with supplementary data. Satellog analyzes each pure repeat in UniGene clusters for evidence of repeat polymorphism. RESULTS: A total of 5,546 such repeats were identified, providing the first indication of many novel polymorphic sites in the genome. Overall, polymorphic repeats were over-represented within 3'-UTR sequence relative to 5'-UTR and coding sequence. Interestingly, we observed that repeat polymorphism within coding sequence is restricted to trinucleotide repeats whereas UTR sequence tolerated a wider range of repeat period polymorphisms. For each pure repeat we also calculate its repeat length percentile rank, its location either within or adjacent to EnsEMBL genes, and its expression profile in normal tissues according to the GeneNote database. CONCLUSION: Satellog provides the ability to dynamically prioritize repeats based on any of their characteristics (i.e. repeat unit, class, period, length, repeat length percentile rank, genomic co-ordinates), polymorphism profile within UniGene, proximity to or presence within gene regions (i.e. cds, UTR, 15 kb upstream etc.), metadata of the genes they are detected within and gene expression profiles within normal human tissues. Unstable repeats associated with 31 diseases were analyzed in Satellog to evaluate their common repeat properties. The utility of Satellog was highlighted by prioritizing repeats for Huntington's disease and schizophrenia. Satellog is available online at http://satellog.bcgsc.ca.

3' Untranslated Regions↗

PubMed2002

Prediction of food protein allergenicity: a bioinformatic learning systems approach.

Food hypersensitivity is constantly increasing in Western societies with a prevalence of about 1-2% in Europe and in the USA. Among children, the incidence is even higher. Because of the introduction of foods derived from genetically modified crops on the marketplace, the scientific community, regulatory bodies and international associations have intensified discussions on risk assessment procedures to identify potential food allergenicity of the newly introduced proteins. In this work, we present a novel biocomputational methodology for the classification of amino acid sequences with regard to food allergenicity and non-allergenicity. This method relies on a computerised learning system trained using selected excerpts of amino acid sequences. One example of such a successful learning system is presented which consists of feature extraction from sequence alignments performed with the FASTA3 algorithm (employing the BLOSUM50 substitution matrix) combined with the k-Nearest-Neighbour (kNN) classification algorithm. Briefly, the two features extracted are the alignment score and the alignment length and the kNN algorithm assigns the pair of extracted features from an unknown sequence to the prevalent class among its k nearest neighbours in the training (prototype) set available. 91 food allergens from several specialised public repositories of food allergy and the SWALL database were identified, pre-processed, and stored, yielding one of the most extensively characterised repositories of allergenic sequences known today. All allergenic sequences were classified using a standard one-leave-out cross validation procedure yielding about 81% correctly classified allergens and the classification of 367 non-allergens in an independent test set resulted in about 98% correct classifications. The biocomputational approach presented should be regarded as a significant extension and refinement of earlier attempts suggested for in silico food safety assessment. Our results show that the framework described here is powerful enough to become useful as part of a multiple-procedure test scheme that also depicts other evaluation approaches such as solid phase immunoassay and tests for stability to digestions.

Algorithms↗

PubMed2005

Do we want our data raw? Including binary mass spectrometry data in public proteomics data repositories.

With the human Plasma Proteome Project (PPP) pilot phase completed, the largest and most ambitious proteomics experiment to date has reached its first milestone. The correspondingly impressive amount of data that came from this pilot project emphasized the need for a centralized dissemination mechanism and led to the development of a detailed, PPP specific data gathering infrastructure at the University of Michigan, Ann Arbor as well as the protein identifications database project at the European Bioinformatics Institute as a general proteomics data repository. One issue that crept up while discussing which data to store for the PPP concerns whether the raw, binary data coming from the mass spectrometers should be stored, or rather the more compact and already significantly processed peak lists. As this debate is not restricted to the PPP but relates to the proteomics community in general, we will attempt to detail the relative merits and caveats associated with centralized storage and dissemination of raw data and/or peak lists, building on the extensive experience gained during the PPP pilot phase. Finally, some suggestions are made for both immediate and future storage of MS data in public repositories.

Computational Biology↗

PubMed2004

The Catalytic Site Atlas: a resource of catalytic sites and residues identified in enzymes using structural data.

The Catalytic Site Atlas (CSA) provides catalytic residue annotation for enzymes in the Protein Data Bank. It is available online at http://www.ebi.ac.uk/thornton-srv/databases/CSA. The database consists of two types of annotated site: an original hand-annotated set containing information extracted from the primary literature, using defined criteria to assign catalytic residues, and an additional homologous set, containing annotations inferred by PSI-BLAST and sequence alignment to one of the original set. The CSA can be queried via Swiss-Prot identifier and EC number, as well as by PDB code. CSA Version 1.0 contains 177 original hand- annotated entries and 2608 homologous entries, and covers approximately 30% of all EC numbers found in PDB. The CSA will be updated on a monthly basis to include homologous sites found in new PDBs, and new hand-annotated enzymes as and when their annotation is completed.

Animals↗

PubMed2004

IntAct: an open source molecular interaction database.

IntAct provides an open source database and toolkit for the storage, presentation and analysis of protein interactions. The web interface provides both textual and graphical representations of protein interactions, and allows exploring interaction networks in the context of the GO annotations of the interacting proteins. A web service allows direct computational access to retrieve interaction networks in XML format. IntAct currently contains approximately 2200 binary and complex interactions imported from the literature and curated in collaboration with the Swiss-Prot team, making intensive use of controlled vocabularies to ensure data consistency. All IntAct software, data and controlled vocabularies are available at http://www.ebi.ac.uk/intact.

Animals↗

PubMed2006

Analysis of protein sequence and interaction data for candidate disease gene prediction.

Linkage analysis is a successful procedure to associate diseases with specific genomic regions. These regions are often large, containing hundreds of genes, which make experimental methods employed to identify the disease gene arduous and expensive. We present two methods to prioritize candidates for further experimental study: Common Pathway Scanning (CPS) and Common Module Profiling (CMP). CPS is based on the assumption that common phenotypes are associated with dysfunction in proteins that participate in the same complex or pathway. CPS applies network data derived from protein-protein interaction (PPI) and pathway databases to identify relationships between genes. CMP identifies likely candidates using a domain-dependent sequence similarity approach, based on the hypothesis that disruption of genes of similar function will lead to the same phenotype. Both algorithms use two forms of input data: known disease genes or multiple disease loci. When using known disease genes as input, our combined methods have a sensitivity of 0.52 and a specificity of 0.97 and reduce the candidate list by 13-fold. Using multiple loci, our methods successfully identify disease genes for all benchmark diseases with a sensitivity of 0.84 and a specificity of 0.63. Our combined approach prioritizes good candidates and will accelerate the disease gene discovery process.

Algorithms↗

PubMed2002

A novel use of equilibrium frequencies in models of sequence evolution.

Current mathematical models of amino acid sequence evolution are often applied in variants that match their expected amino acid frequencies to those observed in a data set under analysis. This has been achieved by setting the instantaneous rate of replacement of a residue i by another residue j proportional to the observed frequency of the resulting residue j. We describe a more general method that maintains the match between expected and observed frequencies but permits replacement rates to be proportional to the frequencies of both the replaced and resulting residues, raised to powers other than 1. Analysis of a database of amino acid alignments shows that the description of the evolutionary process in a majority (approximately 70% of 182 alignments) is significantly improved by use of the new method, and a variety of analyses indicate that parameter estimation with the new method is well-behaved. Improved evolutionary models increase our understanding of the process of molecular evolution and are often expected to lead to improved phylogenetic inferences, and so it seems justified to consider our new variants of existing standard models when performing evolutionary analyses of amino acid sequences. Similar methods can be used with nucleotide substitution models, but we have not found these to give corresponding significant improvements to our ability to describe the processes of nucleotide sequence evolution.

Amino Acid Sequence↗

PubMed2004

Accurate prediction of solvent accessibility using neural networks-based regression.

Accurate prediction of relative solvent accessibilities (RSAs) of amino acid residues in proteins may be used to facilitate protein structure prediction and functional annotation. Toward that goal we developed a novel method for improved prediction of RSAs. Contrary to other machine learning-based methods from the literature, we do not impose a classification problem with arbitrary boundaries between the classes. Instead, we seek a continuous approximation of the real-value RSA using nonlinear regression, with several feed forward and recurrent neural networks, which are then combined into a consensus predictor. A set of 860 protein structures derived from the PFAM database was used for training, whereas validation of the results was carefully performed on several nonredundant control sets comprising a total of 603 structures derived from new Protein Data Bank structures and had no homology to proteins included in the training. Two classes of alternative predictors were developed for comparison with the regression-based approach: one based on the standard classification approach and the other based on a semicontinuous approximation with the so-called thermometer encoding. Furthermore, a weighted approximation, with errors being scaled by the observed levels of variability in RSA for equivalent residues in families of homologous structures, was applied in order to improve the results. The effects of including evolutionary profiles and the growth of sequence databases were assessed. In accord with the observed levels of variability in RSA for different ranges of RSA values, the regression accuracy is higher for buried than for exposed residues, with overall 15.3-15.8% mean absolute errors and correlation coefficients between the predicted and experimental values of 0.64-0.67 on different control sets. The new method outperforms classification-based algorithms when the real value predictions are projected onto two-class classification problems with several commonly used thresholds to separate exposed and buried residues. For example, classification accuracy of about 77% is consistently achieved on all control sets with a threshold of 25% RSA. A web server that enables RSA prediction using the new method and provides customizable graphical representation of the results is available at http://sable.cchmc.org.

Artificial Intelligence↗