CAST: an iterative algorithm for the complexity analysis of sequence tracts. Complexity analysis of sequence tracts

MOTIVATION: Sensitive detection and masking of low-complexity regions in protein sequences. Filtered sequences can be used in sequence comparison without the risk of matching compositionally biased regions. The main advantage of the method over similar approaches is the selective masking of single residue types without affecting other, possibly important, regions. RESULTS: A novel algorithm for low-complexity region detection and selective masking. The algorithm is based on multiple-pass Smith-Waterman comparison of the query sequence against twenty homopolymers with infinite gap penalties. The output of the algorithm is both the masked query sequence for further analysis, e.g. database searches, as well as the regions of low complexity. The detection of low-complexity regions is highly specific for single residue types. It is shown that this approach is sufficient for masking database query sequences without generating false positives. The algorithm is benchmarked against widely available algorithms using the 210 genes of Plasmodium falciparum chromosome 2, a dataset known to contain a large number of low-complexity regions. AVAILABILITY: CAST (version 1.0) executable binaries are available to academic users free of charge under license. Web site entry point, server and additional material: http://www.ebi.ac.uk/research/cgg/services/cast/     

Glaucoma Pred: Glaucoma prediction based on Myocilin genotype and phenotype information

Glaucoma is the second leading cause of blindness after cataract and is heterogeneous in nature. Employing a genetic approach for the detection of the diseased condition provides an advantage that the gene responsible for the disease can be identified by genetic test. The availability of predictive tests based on the published literature would provide a mechanism for early detection and treatment. The genotype and phenotype information could be a valuable source for predicting the risk of the disease. To this end, a web server has been developed, based on the genotype and phenotype of myocilin mutation, which were identified by familial linkage analysis and case studies. The proposed web server provides clinical data and severity index for a given mutation. The server has several useful options to help clinicians and researchers to identify individuals at a risk of developing the disease. Glaucoma Pred server is available at http://bioserver1.physics.iisc.ac.in/myocilin.     

Fold recognition by combining sequence profiles derived from evolution and from depth-dependent structural alignment of fragments

Recognizing structural similarity without significant sequence identity has proved to be a challenging task. Sequence-based and structure-based methods as well as their combinations have been developed. Here, we propose a fold-recognition method that incorporates structural information without the need of sequence-to-structure threading. This is accomplished by generating sequence profiles from protein structural fragments. The structure-derived sequence profiles allow a simple integration with evolution-derived sequence profiles and secondary-structural information for an optimized alignment by efficient dynamic programming. The resulting method (called SP(3)) is found to make a statistically significant improvement in both sensitivity of fold recognition and accuracy of alignment over the method based on evolution-derived sequence profiles alone (SP) and the method based on evolution-derived sequence profile and secondary structure profile (SP(2)). SP(3) was tested in SALIGN benchmark for alignment accuracy and Lindahl, PROSPECTOR 3.0, and LiveBench 8.0 benchmarks for remote-homology detection and model accuracy. SP(3) is found to be the most sensitive and accurate single-method server in all benchmarks tested where other methods are available for comparison (although its results are statistically indistinguishable from the next best in some cases and the comparison is subjected to the limitation of time-dependent sequence and/or structural library used by different methods.). In LiveBench 8.0, its accuracy rivals some of the consensus methods such as ShotGun-INBGU, Pmodeller3, Pcons4, and ROBETTA. SP(3) fold-recognition server is available on http://theory.med.buffalo.edu.     

Comparison of proteins based on segments structural similarity

We present here a simple method for fast and accurate comparison of proteins using their structures. The algorithm is based on structural alignment of segments of Calpha chains (with size of 99 or 199 residues). The method is optimized in terms of speed and accuracy. We test it on 97 representative proteins with the similarity measure based on the SCOP classification. We compare our algorithm with the LGscore2 automatic method. Our method has the same accuracy as the LGscore2 algorithm with much faster processing of the whole test set, which is promising. A second test is done using the ToolShop structure prediction evaluation program and shows that our tool is on average slightly less sensitive than the DALI server. Both algorithms give a similar number of correct models, however, the final alignment quality is better in the case of DALI. Our method was implemented under the name 3D-Hit as a web server at http://3dhit.bioinfo.pl/ free for academic use, with a weekly updated database containing a set of 5000 structures from the Protein Data Bank with non-homologous sequences.     

Support vector machine approach for protein subcellular localization prediction

MOTIVATION: Subcellular localization is a key functional characteristic of proteins. A fully automatic and reliable prediction system for protein subcellular localization is needed, especially for the analysis of large-scale genome sequences. RESULTS: In this paper, Support Vector Machine has been introduced to predict the subcellular localization of proteins from their amino acid compositions. The total prediction accuracies reach 91.4% for three subcellular locations in prokaryotic organisms and 79.4% for four locations in eukaryotic organisms. Predictions by our approach are robust to errors in the protein N-terminal sequences. This new approach provides superior prediction performance compared with existing algorithms based on amino acid composition and can be a complementary method to other existing methods based on sorting signals. AVAILABILITY: A web server implementing the prediction method is available at http://www.bioinfo.tsinghua.edu.cn/SubLoc/. SUPPLEMENTARY INFORMATION: Supplementary material is available at http://www.bioinfo.tsinghua.edu.cn/SubLoc/.     

Vorolign--fast structural alignment using Voronoi contacts

Vorolign, a fast and flexible structural alignment method for two or more protein structures is introduced. The method aligns protein structures using double dynamic programming and measures the similarity of two residues based on the evolutionary conservation of their corresponding Voronoi-contacts in the protein structure. This similarity function allows aligning protein structures even in cases where structural flexibilities exist. Multiple structural alignments are generated from a set of pairwise alignments using a consistency-based, progressive multiple alignment strategy. RESULTS: The performance of Vorolign is evaluated for different applications of protein structure comparison, including automatic family detection as well as pairwise and multiple structure alignment. Vorolign accurately detects the correct family, superfamily or fold of a protein with respect to the SCOP classification on a set of difficult target structures. A scan against a database of >4000 proteins takes on average 1 min per target. The performance of Vorolign in calculating pairwise and multiple alignments is found to be comparable with other pairwise and multiple protein structure alignment methods. AVAILABILITY: Vorolign is freely available for academic users as a web server at http://www.bio.ifi.lmu.de/Vorolign     

‘Bite-and-Switch’ approach using computationally designed molecularly imprinted polymers for sensing of creatinine

A method for the selective detection of creatinine is reported, which is based on the reaction between polymerised hemithioacetal, formed by allyl mercaptan, o-phthalic aldehyde, and primary amine leading to the formation of fluorescent isoindole complex. This method has been demonstrated previously for the detection of creatine using creatine-imprinted molecularly imprinted polymers (MIPs) Since MIPs created using traditional methods were unable to differentiate between creatine and creatinine, a new approach to the rational design of a molecularly imprinted polymer (MIP) selective for creatinine was developed using computer simulation. A virtual library of functional monomers was assigned and screened against the target molecule, creatinine, using molecular modelling software. The monomers giving the highest binding score were further tested using simulated annealing in order to mimic the complexation of the functional monomers with template in the monomer mixture. The result of this simulation gave an optimised MIP composition. The computationally designed polymer demonstrated superior selectivity in comparison to the polymer prepared using traditional approach, a detection limit of 25 μM and good stability. The ‘Bite-and-Switch’ approach combined with molecular imprinting can be used for the design of assays and sensors, selective for amino containing substances.     

Rapid detection of bacteriophages in starter culture using water-in-oil-in-water emulsion microdroplets

Bacteriophage contamination of starter culture and raw material poses a major problem in the fermentation industry. In this study, a rapid detection of lytic phage contamination in starter culture using water-in-oil-in-water (W/O/W) emulsion microdroplets was described. A model bacteria with varying concentrations of lytic phages were encapsulated in W/O/W emulsion microdroplets using a simple needle-in-tube setup. The detection of lytic phage contamination was accomplished in 1 h using the propidium iodide labeling of the phage-infected bacteria inside the W/O/W emulsion microdroplets. Using this approach, a detection limit of 10² PFU/mL of phages was achieved quantitatively, while 10⁴ PFU/mL of phages could be detected qualitatively based on visual comparison of the fluorescence images. Given the simplicity and sensitivity of this approach, it is anticipated that this method can be adapted to any strains of bacteria and lytic phages that are commonly used for fermentation, and has potential for a rapid detection of lytic phage contamination in the fermentation industry.     

Toward rational protein crystallization: A Web server for the design of crystallizable protein variants

Growing well-diffracting crystals constitutes a serious bottleneck in structural biology. A recently proposed crystallization methodology for "stubborn crystallizers" is to engineer surface sequence variants designed to form intermolecular contacts that could support a crystal lattice. This approach relies on the concept of surface entropy reduction (SER), i.e., the replacement of clusters of flexible, solvent-exposed residues with residues with lower conformational entropy. This strategy minimizes the loss of conformational entropy upon crystallization and renders crystallization thermodynamically favorable. The method has been successfully used to crystallize more than 15 novel proteins, all stubborn crystallizers. But the choice of suitable sites for mutagenesis is not trivial. Herein, we announce a Web server, the surface entropy reduction prediction server (SERp server), designed to identify mutations that may facilitate crystallization. Suggested mutations are predicted based on an algorithm incorporating a conformational entropy profile, a secondary structure prediction, and sequence conservation. Minor considerations include the nature of flanking residues and gaps between mutation candidates. While designed to be used with default values, the server has many user-controlled parameters allowing for considerable flexibility. Within, we discuss (1) the methodology of the server, (2) how to interpret the results, and (3) factors that must be considered when selecting mutations. We also attempt to benchmark the server by comparing the server's predictions with successful SER structures. In most cases, the structure yielding mutations were easily identified by the SERp server. The server can be accessed at http://www.doe-mbi.ucla.edu/Services/SER.     

基于多小波的胃癌病理细胞图像边缘检测与分析

对胃癌细胞图像的多尺度小波变换边缘检测进行了研究,为医生运用现代信息理论的方法进行相关疾病诊断提供了一种新的思路和途径。提出了多尺度小波边缘检测的新方法,归纳了改善小波边缘检测效果的一些策略。实验结果表明,对于具有复杂纹理的医学病理细胞图像,采用传统的边缘检测方法会产生伪边缘和方向性误差,它影响了图像边缘检测的可信度;而运用小波变换的时频尺度特性和对奇异变化的优良检测性能,可得到无噪声污染的图像实际边缘。     

The FAF-Drugs2 server: a multistep engine to prepare electronic chemical compound collections

SUMMARY: The FAF-Drugs2 server is a web application that prepares chemical compound libraries prior to virtual screening or that assists hit selection/lead optimization before chemical synthesis or ordering. The FAF-Drugs2 web server is an enhanced version of the FAF-Drugs2 package that now includes Pan Assay Interference Compounds detection. This online toolkit has been designed through a user-centered approach with emphasis on user-friendliness. This is a unique online tool allowing to prepare large compound libraries with in house or user-defined filtering parameters. AVAILABILITY: The FAF-Drugs2 server is freely available at http://bioserv.rpbs.univ-paris-diderot.fr/FAF-Drugs/.     

COMPASS: a tool for comparison of multiple protein alignments with assessment of statistical significance

We present a novel method for the comparison of multiple protein alignments with assessment of statistical significance (COMPASS). The method derives numerical profiles from alignments, constructs optimal local profile-profile alignments and analytically estimates E-values for the detected similarities. The scoring system and E-value calculation are based on a generalization of the PSI-BLAST approach to profile-sequence comparison, which is adapted for the profile-profile case. Tested along with existing methods for profile-sequence (PSI-BLAST) and profile-profile (prof_sim) comparison, COMPASS shows increased abilities for sensitive and selective detection of remote sequence similarities, as well as improved quality of local alignments. The method allows prediction of relationships between protein families in the PFAM database beyond the range of conventional methods. Two predicted relations with high significance are similarities between various Rossmann-type folds and between various helix-turn-helix-containing families. The potential value of COMPASS for structure/function predictions is illustrated by the detection of an intricate homology between the DNA-binding domain of the CTF/NFI family and the MH1 domain of the Smad family.     

List mania: interpreting microarray results with the L2L server

A new server for interpreting microarray results, list to list(L2L), is described. This tool offers a unique approach to understandthe meaning of microarray results, based on comparing them topreviously identified lists of differentially expressed genes.The usefulness of the server is demonstrated by studying differentialexpression in primary tumours versus metastases in colon cancer.     

A rapid and high‐throughput method for the determination of serum uric acid based on microarray technology and nanomaterial

Serum uric acid (SUA) is a new therapeutic target for non‐alcoholic fatty liver disease (NAFLD). In this study, we introduced a chemiluminescence (CL) method combined with microarray technology and a simple fabrication procedure to obtain a highly sensitive SUA probe based on a mesoporous metal oxide nanomaterial. The high‐throughput method was based on the generation of H₂O₂ from SUA by immobilized uricase and its measurement by a CL reaction catalyzed by mesoporous metal oxide nanomaterials. The CL probe was designed for SUA The linear range of the uric acid concentration was 0.6–9 μM and the detection limit was 0.1 μM. In comparison with the other SUA detection techniques, this method has the advantages of a low detection limit, high sensitivity and simplicity. A new sensitive high‐throughput approach was obtained for the determination of SUA.     

LIMPIC: a computational method for the separation of protein MALDI-TOF-MS signals from noise

Background  

Mass spectrometry protein profiling is a promising tool for biomarker discovery in clinical proteomics. However, the development of a reliable approach for the separation of protein signals from noise is required. In this paper, LIMPIC, a computational method for the detection of protein peaks from linear-mode MALDI-TOF data is proposed. LIMPIC is based on novel techniques for background noise reduction and baseline removal. Peak detection is performed considering the presence of a non-homogeneous noise level in the mass spectrum. A comparison of the peaks collected from multiple spectra is used to classify them on the basis of a detection rate parameter, and hence to separate the protein signals from other disturbances.     

Detecting Protein Candidate Fragments Using a Structural Alphabet Profile Comparison Approach

Predicting accurate fragments from sequence has recently become a critical step for protein structure modeling, as protein fragment assembly techniques are presently among the most efficient approaches for de novo prediction. A key step in these approaches is, given the sequence of a protein to model, the identification of relevant fragments - candidate fragments - from a collection of the available 3D structures. These fragments can then be assembled to produce a model of the complete structure of the protein of interest. The search for candidate fragments is classically achieved by considering local sequence similarity using profile comparison, or threading approaches. In the present study, we introduce a new profile comparison approach that, instead of using amino acid profiles, is based on the use of predicted structural alphabet profiles, where structural alphabet profiles contain information related to the 3D local shapes associated with the sequences. We show that structural alphabet profile-profile comparison can be used efficiently to retrieve accurate structural fragments, and we introduce a fully new protocol for the detection of candidate fragments. It identifies fragments specific of each position of the sequence and of size varying between 6 and 27 amino-acids. We find it outperforms present state of the art approaches in terms (i) of the accuracy of the fragments identified, (ii) the rate of true positives identified, while having a high coverage score. We illustrate the relevance of the approach on complete target sets of the two previous Critical Assessment of Techniques for Protein Structure Prediction (CASP) rounds 9 and 10. A web server for the approach is freely available at http://bioserv.rpbs.univ-paris-diderot.fr/SAFrag.     

Genotyping of Mumps viruses based on SH gene: Development of a server using alignment-free and alignment-based methods

Mumps is an acute infectious childhood disease caused by mumps virus (MuV), a member of genus Rubu-lavirus, family Paramyxoviridae. Based on the genetic variability in small hydrophobic (SH) genes, currently MuVs have been divided into twelve confirmed genotypes designated as A-L and one proposed genotype, M. Despite successful vaccination program, a few genotypes are observed to co-circulate amongst vaccinated population. Furthermore, lack of cross protection between different genotypes is reported and hence, as a part of epidemiological surveillance, WHO has recommended genotyping of MuV. Currently genotyping is carried out using molecular phylogeny analysis (MPA) of SH genes and no genotyping server is available for MuV. The present study reports development of a genotyping server for the same, which employs three independent methods. The server uses two conventional methods viz., BLAST, MPA and a novel method based on Return Time Distribution (RTD), which is developed in-house. A server for genotyping of mumps virus is developed and made available at http://bioinfo.net.in/muv/homepage.html. RTD-based alignment-free method was initially developed for MPA and is applied for genotyping of MuV for the first time. It is found to have 98.95% of accuracy when measured using leave-one-out cross validation method on reference and test datasets. In addition to RTD, the server also imple-ments BLAST and MPA for genotyping of MuV. All the three methods were found to be highly reliable as evident from consensus predictions. A server for genotyping of MuV, which implements sequence-based bioinformatics approaches is developed and validated using SH gene sequences of known genotypes. This server will be useful for epidemiological surveillance and to monitor the circulation of MuV genotypes within and across geographic areas. This will also facilitate phylodynamics studies of mumps viruses.     

CVTree3 Web Server for Whole-genome-based and Alignment-free Prokaryotic Phylogeny and Taxonomy

A faithful phylogeny and an objective taxonomy for prokaryotes should agree with each other and ultimately follow the genome data. With the number of sequenced genomes reaching tens of thousands, both tree inference and detailed comparison with taxonomy are great challenges. We now provide one solution in the latest Release 3.0 of the alignment-free and whole-genome-based web server CVTree3. The server resides in a cluster of 64 cores and is equipped with an interactive,collapsible, and expandable tree display. It is capable of comparing the tree branching order with prokaryotic classification at all taxonomic ranks from domains down to species and strains.CVTree3 allows for inquiry by taxon names and trial on lineage modifications. In addition, it reports a summary of monophyletic and non-monophyletic taxa at all ranks as well as produces print-quality subtree figures. After giving an overview of retrospective verification of the CVTree approach, the power of the new server is described for the mega-classification of prokaryotes and determination of taxonomic placement of some newly-sequenced genomes. A few discrepancies between CVTree and 16 S r RNA analyses are also summarized with regard to possible taxonomic revisions. CVTree3 is freely accessible to all users at http://tlife.fudan.edu.cn/cvtree3/ without login requirements.     

An initial strategy for comparing proteins at the domain architecture level

MOTIVATION: Ideally, only proteins that exhibit highly similar domain architectures should be compared with one another as homologues or be classified into a single family. By combining three different indices, the Jaccard index, the Goodman-Kruskal gamma function and the domain duplicate index, into a single similarity measure, we propose a method for comparing proteins based on their domain architectures. RESULTS: Evaluation of the method using the eukaryotic orthologous groups of proteins (KOGs) database indicated that it allows the automatic and efficient comparison of multiple-domain proteins, which are usually refractory to classic approaches based on sequence similarity measures. As a case study, the PDZ and LRR_1 domains are used to demonstrate how proteins containing promiscuous domains can be clearly compared using our method. For the convenience of users, a web server was set up where three different query interfaces were implemented to compare different domain architectures or proteins with domain(s), and to identify the relationships among domain architectures within a given KOG from the Clusters of Orthologous Groups of Proteins database. Conclusion: The approach we propose is suitable for estimating the similarity of domain architectures of proteins, especially those of multidomain proteins. AVAILABILITY: http://cmb.bnu.edu.cn/pdart/.