Visualization of unfavorable interactions in protein folds

Summary: Three dimensional structures of proteins contain errorswhich often originate from limitations of the experimental techniquesemployed. Such errors frequently result in unfavorable atomicinteractions. Here we present a new web service, called InteractionViewer, for the visualization and correction of such errors.We show how the Interaction Viewer is used in combination withthe NQ-Flipper service to spot strained asparagine and glutaminerotamers and we emphasize the convenience of this service incorrecting such errors. Availability: The web service is integrated with the NQ-Flipperservice and accessible at http://flipper.services.came.sbg.ac.at Contact: sippl{at}came.sbg.ac.at Associate Editor: Anna Tramontano     

Model-based analysis of non-specific binding for background correction of high-density oligonucleotide microarrays

Motivation: High-density DNA microarrays provide us with usefultools for analyzing DNA and RNA comprehensively. However, thebackground signal caused by the non-specific binding (NSB) betweenprobe and target makes it difficult to obtain accurate measurements.To remove the background signal, there is a set of backgroundprobes on Affymetrix Exon arrays to represent the amount ofnon-specific signals, and an accurate estimation of non-specificsignals using these background probes is desirable for improvementof microarray analyses. Results: We developed a thermodynamic model of NSB on shortnucleotide microarrays in which the NSBs are modeled by duplexformation of probes and multiple hypothetical targets. We fittedthe observed signal intensities of the background probes withthose expected by the model to obtain the model parameters.As a result, we found that the presented model can improve theaccuracy of prediction of non-specific signals in comparisonwith previously proposed methods. This result will provide auseful method to correct for the background signal in oligonucleotidemicroarray analysis. Availability: The software is implemented in the R languageand can be downloaded from our website (http://www-shimizu.ist.osaka-u.ac.jp/shimizu_lab/MSNS/). Contact: furusawa{at}ist.osaka-u.ac.jp Supplementary information: Supplementary data are availableat Bioinformatics online. The authors wish it to be known that, in their opinion, thefirst two authors should be regarded as joint First Authors. Associate Editor: Trey Ideker     

ISD: a software package for Bayesian NMR structure calculation

Summary: The conventional approach to calculating biomolecularstructures from nuclear magnetic resonance (NMR) data is oftenviewed as subjective due to its dependence on rules of thumbfor deriving geometric constraints and suitable values for theoryparameters from noisy experimental data. As a result, it canbe difficult to judge the precision of an NMR structure in anobjective manner. The inferential Structure determination (ISD)framework, which has been introduced recently, addresses thisproblem by using Bayesian inference to derive a probabilitydistribution that represents both the unknown structure andits uncertainty. It also determines additional unknowns, suchas theory parameters, that normally need to be chosen empirically.Here we give an overview of the ISD software package, whichimplements this methodology. Availability: http://www.bioc.cam.ac.uk/isd Contact: wolfgang.rieping{at}bioc.cam.ac.uk, michael.habeck{at}tuebingen.mpg.de Associate Editor: Alfonso Valencia     

GENESIS: genome evolution scenarios

Summary: We implemented a software tool called GENESIS for threedifferent genome rearrangement problems: Sorting a unichromosomalgenome by weighted reversals and transpositions (SwRT), sortinga multichromosomal genome by reversals, translocations, fusionsand fissions (SRTl), and sorting a multichromosomal genome byweighted reversals, translocations, fusions, fissions and transpositions(SwRTTl). Availability: Source code can be obtained by the authors, oruse the web interface http://www.uni-ulm.de/in/theo/research/genesis.html Contact: simon.gog{at}uni-ulm.de Associate Editor: Chris Stoeckert     

CRONOS: the cross-reference navigation server

Summary: Cross-mapping of gene and protein identifiers betweendifferent databases is a tedious and time-consuming task. Toovercome this, we developed CRONOS, a cross-reference serverthat contains entries from five mammalian organisms presentedby major gene and protein information resources. Sequence similarityanalysis of the mapped entries shows that the cross-referencesare highly accurate. In total, up to 18 different identifiertypes can be used for identification of cross-references. Thequality of the mapping could be improved substantially by exclusionof ambiguous gene and protein names which were manually validated.Organism-specific lists of ambiguous terms, which are valuablefor a variety of bioinformatics applications like text miningare available for download. Availability: CRONOS is freely available to non-commercial usersat http://mips.gsf.de/genre/proj/cronos/index.html, web servicesare available at http://mips.gsf.de/CronosWSService/CronosWS?wsdl. Contact: brigitte.waegele{at}helmholtz-muenchen.de Supplementary information: Supplementary data are availableat Bioinformatics online. The online Supplementary Materialcontains all figures and tables referenced by this article. Associate Editor: Martin Bishop     

EMBL sequence submission system--an object-oriented approach to developing interactive data collection systems through the WWW

Motivation: To enable a new way of submitting sequence informationto the EMBL nucleotide database through the WWW. This processof data submission is long and complex, and calls for efficientand user-friendly mechanisms for collection and validation ofinformation. Results: Described here is a generic, object-oriented data-submissionsystem that is being used for the EMBL database, but can easilybe tailored to serve several data-submission schemes with arelatively short development and implementation time. The programprovides the user with a friendly interface that breaks thecomplex task into smaller, more manageable tasks and, on theother hand, acts as a pre-filter, scanning errors online. Availability: The program is accessible through the EMBL-EBlWWW server at the URL: http: //www.ebi.ac.uk/subs/ emblsubs.html Contact: E-mail: bshomer{at}ebi.ac.uk     

ConFunc--functional annotation in the twilight zone

Motivation: The success of genome sequencing has resulted inmany protein sequences without functional annotation. We presentConFunc, an automated Gene Ontology (GO)-based protein functionprediction approach, which uses conserved residues to generatesequence profiles to infer function. ConFunc split sets of sequencesidentified by PSI-BLAST into sub-alignments according to theirGO annotations. Conserved residues are identified for each GOterm sub-alignment for which a position specific scoring matrixis generated. This combination of steps produces a set of feature(GO annotation) derived profiles from which protein functionis predicted. Results: We assess the ability of ConFunc, BLAST and PSI-BLASTto predict protein function in the twilight zone of sequencesimilarity. ConFunc significantly outperforms BLAST & PSI-BLASTobtaining levels of recall and precision that are not obtainedby either method and maximum precision 24% greater than BLAST.Further for a large test set of sequences with homologues oflow sequence identity, at high levels of presicision, ConFuncobtains recall six times greater than BLAST. These results demonstratethe potential for ConFunc to form part of an automated genomicsannotation pipeline. Availability: http://www.sbg.bio.ic.ac.uk/confunc Contact: m.sternberg{at}imperial.ac.uk Supplementary information: Supplementary data are availableat Bioinformatics online. Associate Editor: Dmitrij Frishman     

Integrating ARC grid middleware with Taverna workflows

Summary: This work presents two independent approaches for aseamless integration of computational grids with the bioinformaticsworkflow suite Taverna. These are supported by a unique relationaldatabase to link applications with grid resources and presentsthose as workflow elements. A web portal facilitates its collaborativemaintenance. The first approach implements a gateway serviceto handle authentication certificates and all communicationwith the grid. It reads the database to spawn web services forworkflow elements which are in turn used by Taverna. The secondapproach lets Taverna communicate with the grid on its own,by means of a newly developed plug-in. It reads the databaseand executes the needed tasks directly on the grid. While thegateway service is non-intrusive, the plug-in has technicaladvantages, e.g. by allowing data to remain on the grid whilebeing passed between workflow elements. Availability: http://grid.inb.uni-luebeck.de/ Contact: bayer{at}inb.uni-luebeck.de Associate Editor: Alfonso Valencia     

RANKPROP: a web server for protein remote homology detection

Summary: We present a large-scale implementation of the RANKPROPprotein homology ranking algorithm in the form of an openlyaccessible web server. We use the NRDB40 PSI-BLAST all-versus-allprotein similarity network of 1.1 million proteins to constructthe graph for the RANKPROP algorithm, whereas previously, resultswere only reported for a database of 108 000 proteins. We alsodescribe two algorithmic improvements to the original algorithm,including propagation from multiple homologs of the query andbetter normalization of ranking scores, that lead to higheraccuracy and to scores with a probabilistic interpretation. Availability: The RANKPROP web server and source code are availableat http://rankprop.gs.washington.edu Contact: iain{at}nec-labs.com; noble{at}gs.washington.edu Associate Editor: Burkhard Rost     

ROBIN: a tool for genome rearrangement of block-interchanges

Summary: ROBIN is a web server for analyzing genome rearrangementof block-interchanges between two chromosomal genomes. It takestwo or more linear/circular chromosomes as its input, and computesthe number of minimum block-interchange rearrangements betweenany two input chromosomes for transforming one chromosome intoanother and also determines an optimal scenario taking thisnumber of rearrangements. The input can be either bacterial-sizesequence data or landmark-order data. If the input is sequencedata, ROBIN will automatically search for the identical landmarksthat are the homologous/conserved regions shared by all theinput sequences. Availability: ROBIN is freely accessed at http://genome.life.nctu.edu.tw/ROBIN Contact: cllu{at}mail.nctu.edu.tw     

ParCrys: a Parzen window density estimation approach to protein crystallization propensity prediction

The ability to rank proteins by their likely success in crystallizationis useful in current Structural Biology efforts and in particularin high-throughput Structural Genomics initiatives. We presentParCrys, a Parzen Window approach to estimate a protein's propensityto produce diffraction-quality crystals. The Protein Data Bank(PDB) provided training data whilst the databases TargetDB andPepcDB were used to define feature selection data as well astest data independent of feature selection and training. ParCrysoutperforms the OB-Score, SECRET and CRYSTALP on the data examined,with accuracy and Matthews correlation coefficient values of79.1% and 0.582, respectively (74.0% and 0.227, respectively,on data with a ‘real-world’ ratio of positive:negativeexamples). ParCrys predictions and associated data are availablefrom www.compbio.dundee.ac.uk/parcrys. Contact: geoff{at}compbio.dundee.ac.uk Supplementary information: Supplementary data are availableat Bioinformatics online. Associate Editor: John Quackenbush     

Disease association tests by inferring ancestral haplotypes using a hidden markov model

Motivation: Most genome-wide association studies rely on singlenucleotide polymorphism (SNP) analyses to identify causal loci.The increased stringency required for genome-wide analyses (withper-SNP significance threshold typically 10^–7) meansthat many real signals will be missed. Thus it is still highlyrelevant to develop methods with improved power at low typeI error. Haplotype-based methods provide a promising approach;however, they suffer from statistical problems such as abundanceof rare haplotypes and ambiguity in defining haplotype blockboundaries. Results: We have developed an ancestral haplotype clustering(AncesHC) association method which addresses many of these problems.It can be applied to biallelic or multiallelic markers typedin haploid, diploid or multiploid organisms, and also handlesmissing genotypes. Our model is free from the assumption ofa rigid block structure but recognizes a block-like structureif it exists in the data. We employ a Hidden Markov Model (HMM)to cluster the haplotypes into groups of predicted common ancestralorigin. We then test each cluster for association with diseaseby comparing the numbers of cases and controls with 0, 1 and2 chromosomes in the cluster. We demonstrate the power of thisapproach by simulation of case-control status under a rangeof disease models for 1500 outcrossed mice originating fromeight inbred lines. Our results suggest that AncesHC has substantiallymore power than single-SNP analyses to detect disease association,and is also more powerful than the cladistic haplotype clusteringmethod CLADHC. Availability: The software can be downloaded from http://www.imperial.ac.uk/medicine/people/l.coin Contact: I.coin{at}imperial.ac.uk Supplementary Information: Supplementary data are availableat Bioinformatics online. Associate Editor: Martin Bishop     

3D-Garden: a system for modelling protein-protein complexes based on conformational refinement of ensembles generated with the marching cubes algorithm

Motivation: Reliable structural modelling of protein–proteincomplexes has widespread application, from drug design to advancingour knowledge of protein interactions and function. This workaddresses three important issues in protein–protein docking:implementing backbone flexibility, incorporating prior indicationsfrom experiment and bioinformatics, and providing public accessvia a server. 3D-Garden (Global And Restrained Docking ExplorationNexus), our benchmarked and server-ready flexible docking system,allows sophisticated programming of surface patches by the uservia a facet representation of the interactors’ molecularsurfaces (generated with the marching cubes algorithm). Flexibilityis implemented as a weighted exhaustive conformer search foreach clashing pair of molecular branches in a set of 5000 modelsfiltered from around 340 000 initially. Results: In a non-global assessment, carried out strictly accordingto the protocols for number of models considered and model qualityof the Critical Assessment of Protein Interactions (CAPRI) experiment,over the widely-used Benchmark 2.0 of 84 complexes, 3D-Gardenidentifies a set of ten models containing an acceptable or bettermodel in 29/45 test cases, including one with large conformationalchange. In 19/45 cases an acceptable or better model is rankedfirst or second out of 340 000 candidates. Availability: http://www.sbg.bio.ic.ac.uk/3dgarden (server) Contact: v.lesk{at}ic.ac.uk Supplementary information: Supplementary data are availableat Bioinformatics online. Associate Editor: Burkhard Rost     

TOPALi v2: a rich graphical interface for evolutionary analyses of multiple alignments on HPC clusters and multi-core desktops

Summary: TOPALi v2 simplifies and automates the use of severalmethods for the evolutionary analysis of multiple sequence alignments.Jobs are submitted from a Java graphical user interface as TOPALiweb services to either run remotely on high-performance computingclusters or locally (with multiple cores supported). Methodsavailable include model selection and phylogenetic tree estimationusing the Bayesian inference and maximum likelihood (ML) approaches,in addition to recombination detection methods. The optimalsubstitution model can be selected for protein or nucleic acid(standard, or protein-coding using a codon position model) datausing accurate statistical criteria derived from ML co-estimationof the tree and the substitution model. Phylogenetic softwareavailable includes PhyML, RAxML and MrBayes. Availability: Freely downloadable from http://www.topali.orgfor Windows, Mac OS X, Linux and Solaris. Contact: iain.milne{at}scri.ac.uk Associate Editor: Martin Bishop     

MMG: a probabilistic tool to identify submodules of metabolic pathways

Motivation: A fundamental task in systems biology is the identificationof groups of genes that are involved in the cellular responseto particular signals. At its simplest level, this often reducesto identifying biological quantities (mRNA abundance, enzymeconcentrations, etc.) which are differentially expressed intwo different conditions. Popular approaches involve using t-teststatistics, based on modelling the data as arising from a mixturedistribution. A common assumption of these approaches is thatthe data are independent and identically distributed; however,biological quantities are usually related through a complex(weighted) network of interactions, and often the more pertinentquestion is which subnetworks are differentially expressed,rather than which genes. Furthermore, in many interesting cases(such as high-throughput proteomics and metabolomics), onlyvery partial observations are available, resulting in the needfor efficient imputation techniques. Results: We introduce Mixture Model on Graphs (MMG), a novelprobabilistic model to identify differentially expressed submodulesof biological networks and pathways. The method can easily incorporateinformation about weights in the network, is robust againstmissing data and can be easily generalized to directed networks.We propose an efficient sampling strategy to infer posteriorprobabilities of differential expression, as well as posteriorprobabilities over the model parameters. We assess our methodon artificial data demonstrating significant improvements overstandard mixture model clustering. Analysis of our model resultson quantitative high-throughput proteomic data leads to theidentification of biologically significant subnetworks, as wellas the prediction of the expression level of a number of enzymes,some of which are then verified experimentally. Availability: MATLAB code is available from http://www.dcs.shef.ac.uk/~guido/software.html Contact: guido{at}dcs.shef.ac.uk Supplementary information: Supplementary data are availableat Bioinformatics online. Associate Editor: Jonathan Wren     

Artemis: sequence visualization and annotation

SUMMARY: Artemis is a DNA sequence visualization and annotation tool that allows the results of any analysis or sets of analyses to be viewed in the context of the sequence and its six-frame translation. Artemis is especially useful in analysing the compact genomes of bacteria, archaea and lower eukaryotes, and will cope with sequences of any size from small genes to whole genomes. It is implemented in Java, and can be run on any suitable platform. Sequences and annotation can be read and written directly in EMBL, GenBank and GFF format. AVAILABITLTY: Artemis is available under the GNU General Public License from http://www.sanger.ac.uk/Software/Artemis     

Comment on 'A congruence index for testing topological similarity between trees'

Contact: anne.kupczok{at}univie.ac.at Associate Editor: Martin Bishop