HyPaLib: a database of RNAs and RNA structural elements defined by hybrid patterns

The database, called HyPaLib (for Hybrid Pattern Library), contains annotated structural elements characteristic for certain classes of structural and/or functional RNAs. These elements are described in a language specifically designed for this purpose. The language allows convenient specification of hybrid patterns, i.e. motifs consisting of sequence features and structural elements together with sequence similarity and thermodynamic constraints. We are currently developing software tools that allow a user to search sequence databases for any pattern in HyPaLib, thus providing functionality which is similar to PROSITE, but dedicated to the more complex patterns in RNA sequences. HyPaLib is available at http://bibiserv. techfak.uni-bielefeld.de/HyPa/.     

Two interactive Bioinformatics courses at the Bielefeld University Bioinformatics Server

Conferences in computational biology continue to provide tutorials on classical and new methods in the field. This can be taken as an indicator that education is still a bottleneck in our field's process of becoming an established scientific discipline. Bielefeld University has been one of the early providers of bioinformatics education, both locally and via the internet. The Bielefeld Bioinformatics Server (BiBiServ) offers a variety of older and new materials. Here, we report on two online courses made available recently, one introductory and one on the advanced level: (i) SADR: Sequence Analysis with Distributed Resources (http://bibiserv.techfak.uni-bielefeld.de/sadr/) and (ii) ADP: Algebraic Dynamic Programming in Bioinformatics (http://bibiserv.techfak.uni-bielefeld.de/dpcourse/).     

A space-efficient algorithm for aligning large genomic sequences

SUMMARY: In the segment-by-segment approach to sequence alignment, pairwise and multiple alignments are generated by comparing gap-free segments of the sequences under study. This method is particularly efficient in detecting local homologies, and it has been used to identify functional regions in large genomic sequences. Herein, an algorithm is outlined that calculates optimal pairwise segment-by-segment alignments in essentially linear space. AVAILABILTIY: The program is available at the Bielefeld Bioinformatics Server (BiBiServ) at http://bibiserv.techfak. uni-bielefeld.de/dialign/     

AltAVisT: comparing alternative multiple sequence alignments

We introduce a WWW-based tool that is able to compare two alternative multiple alignments of a given sequence set. Regions where both alignments coincide are color-coded to visualize the local agreement between the two alignments and to identify those regions that can be considered to be reliably aligned. AVAILABILITY: http://bibiserv.techfak.uni-bielefeld.de/altavist/.     

REPuter: fast computation of maximal repeats in complete genomes.

SUMMARY: A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently. AVAILABILITY: Via the Bielefeld Bioinformatics Server (http://bibiserv.techfak.uni-bielefeld.de/rep uter/).     

Evaluating the predictability of conformational switching in RNA

MOTIVATION: There are various cases where the biological function of an RNA molecule involves a reversible change of conformation. paRNAss is a software approach to the prediction of such structural switching in RNA. It is based on three hypotheses about the secondary structure space of a switching RNA molecule that can be evaluated by RNA folding and structure comparison. In the positive case, the predicted structural switching must be verified experimentally. RESULTS: After reviewing the strategy used in paRNAss, we present recent improvements on the algorithmic level of the approach, and the results of an evaluation procedure, comprising 1500 RNA sequences. It could be shown that the paRNAss approach performs well on known examples for conformational switching in RNA. The overall number of positive predictions was small, whereas for human 3' UTRs, representing regulatory important regions, it was substantially higher than for arbitrary natural and random sequences. AVAILABILITY: paRNAss is available as a Web service at http://bibiserv.techfak.uni-bielefeld.de/parnass SUPPLEMENTARY INFORMATION: Detailed information on the analyses summarized in Table 1 can be found at http://bibiserv.techfak.uni-bielefeld.de/parnass/examples.html     

RNA-related tools on the Bielefeld Bioinformatics Server

We present four tools for the analysis of RNA secondary structure. They provide animated visualization of multiple structures, prediction of potential conformational switching, structure comparison (including local structure alignment) and prediction of structures potentially containing a certain kind of pseudoknots. All are available via the Bielefeld University Bioinformatics Server (http://bibiserv.techfak.uni-bielefeld.de).     

GUUGle: a utility for fast exact matching under RNA complementary rules including G-U base pairing

MOTIVATION: RNA secondary structure analysis often requires searching for potential helices in large sequence data. RESULTS: We present a utility program GUUGle that efficiently locates potential helical regions under RNA base pairing rules, which include Watson-Crick as well as G-U pairs. It accepts a positive and a negative set of sequences, and determines all exact matches under RNA rules between positive and negative sequences that exceed a specified length. The GUUGle algorithm can also be adapted to use a precomputed suffix array of the positive sequence set. We show how this program can be effectively used as a filter preceding a more computationally expensive task such as miRNA target prediction. AVAILABILITY: GUUGle is available via the Bielefeld Bioinformatics Server at http://bibiserv.techfak.uni-bielefeld.de/guugle     

Novel and unexpected bacterial diversity in an arsenic-rich ecosystem revealed by culture-dependent approaches

Background

BLAST is a commonly-used software package for comparing a query sequence to a database of known sequences; in this study, we focus on protein sequences. Position-specific-iterated BLAST (PSI-BLAST) iteratively searches a protein sequence database, using the matches in round i to construct a position-specific score matrix (PSSM) for searching the database in round i?+?1. Biegert and S?ding developed Context-sensitive BLAST (CS-BLAST), which combines information from searching the sequence database with information derived from a library of short protein profiles to achieve better homology detection than PSI-BLAST, which builds its PSSMs from scratch.

Results

We describe a new method, called domain enhanced lookup time accelerated BLAST (DELTA-BLAST), which searches a database of pre-constructed PSSMs before searching a protein-sequence database, to yield better homology detection. For its PSSMs, DELTA-BLAST employs a subset of NCBI??s Conserved Domain Database (CDD). On a test set derived from ASTRAL, with one round of searching, DELTA-BLAST achieves a ROC₅₀₀₀ of 0.270 vs. 0.116 for CS-BLAST. The performance advantage diminishes in iterated searches, but DELTA-BLAST continues to achieve better ROC scores than CS-BLAST.

Conclusions

DELTA-BLAST is a useful program for the detection of remote protein homologs. It is available under the ??Protein BLAST?? link at http://blast.ncbi.nlm.nih.gov.

Reviewers

This article was reviewed by Arcady Mushegian, Nick V. Grishin, and Frank Eisenhaber.     

Database driven test case generation for protein-protein docking

SUMMARY: We present a method for automatic test case generation for protein-protein docking. A consensus-type approach is proposed processing the whole PDB and classifying protein structures into complexes and unbound proteins by combining information from three different approaches (current PDB-at-a-glance classification, search of complexes by sequence identical unbound structures and chain naming). Out of this classification test cases are generated automatically. All calculations were run on the database. The information stored is available via a web interface. The user can choose several criteria for generating his own subset out of our test cases, e.g. for testing docking algorithms. AVAILABILITY: http://bibiserv.techfak.uni-bielefeld.de/agt-sdp/ CONTACT: fzoellne@techfak.uni-bielefeld.de.     

MulSatDB: a first online database for mulberry microsatellites

Key message

Simple sequence repeat motifs were mined from the genome and EST sequences of Morus notabilis and archived in MulSatDB. Bioinformatics tools were integrated with the database for the analysis of genomic datasets.

Abstract

Mulberry is a crop of economic importance in sericulture, which shapes the lives of millions of rural people among different Eurasian and Latin American countries. Limited availability of genomic resources has constrained the molecular breeding efforts in mulberry, a poorly studied crop. Microsatellite or simple sequence repeat (SSR) has revolutionized the plant breeding and is used in linkage mapping, association studies, diversity, and parentage analysis, etc. Recent availability of mulberry whole genome assembly provided an opportunity for the development of mulberry-specific DNA markers. In this study, we mined a total of 217,312 microsatellites from whole genome and 961 microsatellites from EST sequences of Morus notabilis. Mono-repeats were predominant among both whole genome and EST sequences. The SSR containing EST sequences were functionally annotated, and SSRs mined from whole genome were mapped on chromosomes of the phylogenetically related genus—Fragaria vesca, to aid the selection of markers based on the function and location. All the mined markers were archived in the mulberry microsatellite database (MulSatDB), and the markers can be retrieved based on different criteria like marker location, repeat kind, motif type and size. Primer3plus and CMap tools are integrated with the database to design primers for PCR amplification and to visualize markers on F. vesca chromosomes, respectively. A blast tool is also integrated to collate new markers with the database. MulSatDB is the first and complete destination for mulberry researchers to browse SSR markers, design primers, and locate markers on strawberry chromosomes. MulSatDB is freely accessible at http://btismysore.in/mulsatdb.     

An algorithm for linear metabolic pathway alignment

Metabolic pathway alignment represents one of the most powerful tools for comparative analysis of metabolism. It involves recognition of metabolites common to a set of functionally-related metabolic pathways, interpretation of biological evolution processes and determination of alternative metabolic pathways. Moreover, it is of assistance in function prediction and metabolism modeling. Although research on genomic sequence alignment is extensive, the problem of aligning metabolic pathways has received less attention. We are motivated to develop an algorithm of metabolic pathway alignment to reveal the similarities between metabolic pathways. A new definition of the metabolic pathway is introduced. The algorithm has been implemented into the PathAligner system; its web-based interface is available at http://bibiserv.techfak.uni-bielefeld.de/pathaligner/.     

HotSwap for bioinformatics: A STRAP tutorial

Background

Bioinformatics applications are now routinely used to analyze large amounts of data. Application development often requires many cycles of optimization, compiling, and testing. Repeatedly loading large datasets can significantly slow down the development process. We have incorporated HotSwap functionality into the protein workbench STRAP, allowing developers to create plugins using the Java HotSwap technique.

Results

Users can load multiple protein sequences or structures into the main STRAP user interface, and simultaneously develop plugins using an editor of their choice such as Emacs. Saving changes to the Java file causes STRAP to recompile the plugin and automatically update its user interface without requiring recompilation of STRAP or reloading of protein data. This article presents a tutorial on how to develop HotSwap plugins. STRAP is available at http://strapjava.de and http://www.charite.de/bioinf/strap.

Conclusion

HotSwap is a useful and time-saving technique for bioinformatics developers. HotSwap can be used to efficiently develop bioinformatics applications that require loading large amounts of data into memory.     

In silico characterization of immunogenic epitopes presented by HLA-Cw*0401

Background

Arenaviruses are a family of rodent-borne viruses that cause several hemorrhagic fevers. These diseases can be devastating and are often lethal. Herein, to aid in the design and development of diagnostics, treatments and vaccines for arenavirus infections, we have developed a database containing protein sequences from the seven pathogenic arenaviruses (Junin, Guanarito, Sabia, Machupo, Whitewater Arroyo, Lassa and LCMV).

Results

The database currently contains a non-redundant set of 333 protein sequences which were manually annotated. All entries were linked to NCBI and cited PubMed references. The database has a convenient query interface including BLAST search. Sequence variability analyses were also performed and the results are hosted in the database.

Conclusion

The database is available at http://epitope.liai.org:8080/projects/arena and can be used to aid in studies that require proteomic information from pathogenic arenaviruses.     

Multiple independent analyses reveal only transcription factors as an enriched functional class associated with microRNAs

Background

The process of drug discovery and development is time-consuming and costly, and the probability of success is low. Therefore, there is rising interest in repositioning existing drugs for new medical indications. When successful, this process reduces the risk of failure and costs associated with de novo drug development. However, in many cases, new indications of existing drugs have been found serendipitously. Thus there is a clear need for establishment of rational methods for drug repositioning.

Results

In this study, we have established a database we call “PharmDB” which integrates data associated with disease indications, drug development, and associated proteins, and known interactions extracted from various established databases. To explore linkages of known drugs to diseases of interest from within PharmDB, we designed the Shared Neighborhood Scoring (SNS) algorithm. And to facilitate exploration of tripartite (Drug-Protein-Disease) network, we developed a graphical data visualization software program called phExplorer, which allows us to browse PharmDB data in an interactive and dynamic manner. We validated this knowledge-based tool kit, by identifying a potential application of a hypertension drug, benzthiazide (TBZT), to induce lung cancer cell death.

Conclusions

By combining PharmDB, an integrated tripartite database, with Shared Neighborhood Scoring (SNS) algorithm, we developed a knowledge platform to rationally identify new indications for known FDA approved drugs, which can be customized to specific projects using manual curation. The data in PharmDB is open access and can be easily explored with phExplorer and accessed via BioMart web service (http://www.i-pharm.org/, http://biomart.i-pharm.org/).