DaliLite workbench for protein structure comparison

SUMMARY: DaliLite is a program for pairwise structure comparison and for structure database searching. It is a standalone version of the search engine of the popular Dali server. A web interface is provided to view the results, multiple alignments and 3D superimpositions of structures.     

SeqMaT: A sequence manipulation tool for phylogenetic analysis

Most bioinformatics tools require specialized input formats for sequence comparison and analysis. This is particularly true for molecular phylogeny programs, which accept only certain formats. In addition, it is often necessary to eliminate highly similar sequences among the input, especially when the dataset is large. Moreover, most programs have restrictions upon the sequence name. Here we introduce SeqMaT, a Sequence Manipulation Tool. It has the following functions: data format conversion,sequence name coding and decoding,redundant and highly similar sequence removal, anddata mining utilities. SeqMaT was developed using Java with two versions, web-based and standalone. A standalone program is convenient to manipulate a large number of sequences, while the web version will guarantee wide availability of the tool for researchers and practitioners throughout the Internet. AVAILABILITY: The database is available for free at http://glee.ist.unomaha.edu/seqmat.     

Flexible docking of peptides to proteins using CABS‐dock

Molecular docking of peptides to proteins can be a useful tool in the exploration of the possible peptide binding sites and poses. CABS‐dock is a method for protein–peptide docking that features significant conformational flexibility of both the peptide and the protein molecules during the peptide search for a binding site. The CABS‐dock has been made available as a web server and a standalone package. The web server is an easy to use tool with a simple web interface. The standalone package is a command‐line program dedicated to professional users. It offers a number of advanced features, analysis tools and support for large‐sized systems. In this article, we outline the current status of the CABS‐dock method, its recent developments, applications, and challenges ahead.     

Generation of molecular surfaces for graphic display

A procedure is described for the generation of a variety of molecular surfaces using a ‘bit’ lattice, and avoiding the computational load imposed by geometric techniques. The procedure is well suited to minicomputers used to host calligraphic displays, and is flexible in terms of resolution and size of surface, and permits several styles of display. The procedure may be used as a standalone program, or as part of a real-time molecular manipulation system.     

Virtual nitrogen tank to monitor frozen cell stocks

We developed a program to facilitate the monitoring of biological samples (cell lines, sera, etc.) that are stored in liquid nitrogen containers. The program consists of a "virtual" container in which scientists can store their samples and a program that records the location of each sample, cell characteristics, storage dates, names of the manipulators and much more. Additional comments and a photograph can be associated with each vial, allowing for reliable tracking of samples. Vials can then be identified according to any parameter of interest to the scientist, including associated comments. Once identified, the program visually presents the location of these vials, which simplifies retrieving them from the real container. The program records the thawing of vials, along with the date and the name of the operator. Any academic laboratory requesting this standalone program will be granted a free license for its use.     

An automated approach to network features of protein structure ensembles

Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone‐efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user‐friendly, standalone program package named PSN‐Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X‐ray structures. The novelty in network construction lies in the explicit consideration of side‐chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long‐range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross‐correlation/interaction energy in PSN‐Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN‐Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin‐conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN‐Ensemble for single‐static structures of active/inactive states of β2‐adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN‐Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN‐Ensemble/psn_index.html .     

RVP-net: online prediction of real valued accessible surface area of proteins from single sequences

SUMMARY: RVP-net is an online program for the prediction of real valued solvent accessibility. All previous methods of accessible surface area (ASA) predictions classify amino acid residues into exposure states and named them buried or exposed based on different thresholds. Real values in some cases were generated by taking the mid points of these state thresholds. This is the first method, which provides a direct prediction of ASA without making exposure categories and achieves results better than 19% mean absolute error. To facilitate batch processing of several sequences, a standalone version of this tool is also provided. AVAILABILITY: Online predictions are available at http://www.netasa.org/rvp-net/. Standalone version of the program can be obtained from the corresponding author by E-mail request.     

GMAP: a genomic mapping and alignment program for mRNA and EST sequences

MOTIVATION: We introduce GMAP, a standalone program for mapping and aligning cDNA sequences to a genome. The program maps and aligns a single sequence with minimal startup time and memory requirements, and provides fast batch processing of large sequence sets. The program generates accurate gene structures, even in the presence of substantial polymorphisms and sequence errors, without using probabilistic splice site models. Methodology underlying the program includes a minimal sampling strategy for genomic mapping, oligomer chaining for approximate alignment, sandwich DP for splice site detection, and microexon identification with statistical significance testing. RESULTS: On a set of human messenger RNAs with random mutations at a 1 and 3% rate, GMAP identified all splice sites accurately in over 99.3% of the sequences, which was one-tenth the error rate of existing programs. On a large set of human expressed sequence tags, GMAP provided higher-quality alignments more often than blat did. On a set of Arabidopsis cDNAs, GMAP performed comparably with GeneSeqer. In these experiments, GMAP demonstrated a several-fold increase in speed over existing programs. AVAILABILITY: Source code for gmap and associated programs is available at http://www.gene.com/share/gmap SUPPLEMENTARY INFORMATION: http://www.gene.com/share/gmap.     

CPhos: A program to calculate and visualize evolutionarily conserved functional phosphorylation sites

Profiling using high‐throughput MS has discovered an overwhelming number of novel protein phosphorylation sites (“phosphosites”). However, the functional relevance of these sites is not always clear. In light of recent studies on the evolutionary mechanism of phosphorylation, we have developed CPhos, a Java program that can assess the conservation of phosphosites among species using an information theory‐based approach. The degree of conservation established using CPhos can be used to assess the functional significance of phosphosites. CPhos has a user friendly graphical user interface and is available both as a web service and as a standalone Java application to assist phosphoproteomic researchers in analyzing and prioritizing lists of phosphosites for further experimental validation. CPhos can be accessed or downloaded at http://helixweb.nih.gov/CPhos/ .     

CX,an algorithm that identifies protruding atoms in proteins

MOTIVATION: A simple and fast algorithm is described that calculates a measure of protrusion (cx) for atoms in protein structures, directly useable with the common molecular graphics programs. RESULTS: A sphere of predetermined radius is centered around each non-hydrogen atom, and the volume occupied by the protein and the free volume within the sphere (internal and external volumes, respectively) are calculated. Atoms in protruding regions have a high ratio (cx) between the external and the internal volume. The program reads a PDB file, and writes the output in the same format, with cx values in the B factor field. Output structure files can be directly displayed with standard molecular graphics programs like RASMOL, MOLMOL, Swiss-PDB Viewer and colored according to cx values. We show the potential use of this program in the analysis of two protein-protein complexes and in the prediction of limited proteolysis sites in native proteins. AVAILABILITY: The algorithm is implemented in a standalone program written in C and its source is freely available at ftp.icgeb.trieste.it/pub/CX or on request from the authors.     

GeneMerge--post-genomic analysis,data mining,and hypothesis testing

SUMMARY: GeneMerge is a web-based and standalone program written in PERL that returns a range of functional and genomic data for a given set of study genes and provides statistical rank scores for over-representation of particular functions or categories in the data set. Functional or categorical data of all kinds can be analyzed with GeneMerge, facilitating regulatory and metabolic pathway analysis, tests of population genetic hypotheses, cross-experiment comparisons, and tests of chromosomal clustering, among others. GeneMerge can perform analyses on a wide variety of genomic data quickly and easily and facilitates both data mining and hypothesis testing. AVAILABILITY: GeneMerge is available free of charge for academic use over the web and for download from: http://www.oeb.harvard.edu/hartl/lab/publications/GeneMerge.html.     

PHIRE, a deterministic approach to reveal regulatory elements in bacteriophage genomes

MOTIVATION: In silico genome analysis of bacteriophage genomes focuses mainly on gene discovery and functional assignment. The search for regulatory elements contained within these genome sequences is often based on prior knowledge of other genomic elements or on learning algorithms of experimentally determined data, potentially leading to a biased prediction output. The PHage In silico Regulatory Elements (PHIRE) program is a standalone program in Visual Basic. It performs an algorithmic string-based search on bacteriophage genome sequences to uncover and extract subsequence alignments hinting at regulatory elements contained within these genomes, in a deterministic manner without any prior experimental or predictive knowledge. RESULTS: The PHIRE program was tested on known phage genomes with experimentally verified regulatory elements. PHIRE was able to extract phage regulatory sequences correctly for bacteriophages T7, T3, YeO3-12 and lambda, based solely on the genome sequence. For 11 bacteriophages, new predictions of conserved phage-specific putative regulatory elements were made, further corroborating this approach. AVAILABILITY: http://www.agr.kuleuven.ac.be/logt/PHIRE.htm. Freely available for academic use. Commercial users should contact the corresponding author.     

Pcons5: combining consensus, structural evaluation and fold recognition scores

MOTIVATION: The success of the consensus approach to the protein structure prediction problem has led to development of several different consensus methods. Most of them only rely on a structural comparison of a number of different models. However, there are other types of information that might be useful such as the score from the server and structural evaluation. RESULTS: Pcons5 is a new and improved version of the consensus predictor Pcons. Pcons5 integrates information from three different sources: the consensus analysis, structural evaluation and the score from the fold recognition servers. We show that Pcons5 is better than the previous version of Pcons and that it performs better than using only the consensus analysis. In addition, we also present a version of Pmodeller based on Pcons5, which performs significantly better than Pcons5. AVAILABILITY: Pcons5 is the first Pcons version available as a standalone program from http://www.sbc.su.se/~bjorn/Pcons5. It should be easy to implement in local meta-servers.     

Data reduction of isotope-resolved LC-MS spectra

MOTIVATION: Data reduction of liquid chromatography-mass spectrometry (LC-MS) spectra can be a challenge due to the inherent complexity of biological samples, noise and non-flat baseline. We present a new algorithm, LCMS-2D, for reliable data reduction of LC-MS proteomics data. RESULTS: LCMS-2D can reliably reduce LC-MS spectra with multiple scans to a list of elution peaks, and subsequently to a list of peptide masses. It is capable of noise removal, and deconvoluting peaks that overlap in m/z, in retention time, or both, by using a novel iterative peak-picking step, a 'rescue' step, and a modified variable selection method. LCMS-2D performs well with three sets of annotated LC-MS spectra, yielding results that are better than those from PepList, msInspect and the vendor software BioAnalyst. AVAILABILITY: The software LCMS-2D is available under the GNU general public license from http://www.bioc.aecom.yu.edu/labs/angellab/as a standalone C program running on LINUX.     

Cgaln: fast and space-efficient whole-genome alignment

Background  

Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investigation. As available genomic sequence data accumulate rapidly, there is great demand for tools that can compare whole-genome sequences within practical amounts of time and space. However, most existing genomic alignment tools can treat sequences that are only a few Mb long at once, and no state-of-the-art alignment program can align large sequences such as mammalian genomes directly on a conventional standalone computer.     

ProtBuD: a database of biological unit structures of protein families and superfamilies

MOTIVATION: Modeling of protein interactions is often possible from known structures of related complexes. It is often time-consuming to find the most appropriate template. Hypothesized biological units (BUs) often differ from the asymmetric units and it is usually preferable to model from the BUs. RESULTS: ProtBuD is a database of BUs for all structures in the Protein Data Bank (PDB). We use both the PDBs BUs and those from the Protein Quaternary Server. ProtBuD is searchable by PDB entry, the Structural Classification of Proteins (SCOP) designation or pairs of SCOP designations. The database provides the asymmetric and BU contents of related proteins in the PDB as identified in SCOP and Position-Specific Iterated BLAST (PSI-BLAST). The asymmetric unit is different from PDB and/or Protein Quaternary Server (PQS) BUs for 52% of X-ray structures, and the PDB and PQS BUs disagree on 18% of entries. AVAILABILITY: The database is provided as a standalone program and a web server from http://dunbrack.fccc.edu/ProtBuD.php.     

Circular genome visualization and exploration using CGView

SUMMARY: CGView (Circular Genome Viewer) is a Java application and library for generating high-quality, zoomable maps of circular genomes. It converts XML or tab-delimited input into a graphical map (PNG, JPG or Scalable Vector Graphics format), complete with sequence features, labels, legends and footnotes. In addition to the default full view map, the program can generate a series of hyperlinked maps showing expanded views. The linked maps can be explored using any Web browser, allowing rapid genome browsing and facilitating data sharing. AVAILABILITY: CGView (the standalone application, library or applet), sample input, sample maps and documentation can be obtained from http://wishart.biology.ualberta.ca/cgview/ CONTACT: david.wishart@ualberta.ca.