Motivation: Protein-DNA interactions are essential for regulating many cellular processes, such as transcription, replication, recombination and translation. Amino acid mutations occurring in DNA-binding proteins have profound effects on protein-DNA binding and are linked with many diseases. Hence, accurate and fast predictions of the effects of mutations on protein-DNA binding affinity are essential for understanding disease-causing mechanisms and guiding plausible treatments. Results: Here we report a new method Single Amino acid Mutation binding free energy change of Protein-DNA Interaction (SAMPDI). The method utilizes modified Molecular Mechanics Poisson-Boltzmann Surface Area (MM/PBSA) approach along with an additional set of knowledge-based terms delivered from investigations of the physicochemical properties of protein-DNA complexes. The method is benchmarked against experimentally determined binding free energy changes caused by 105 mutations in 13 proteins (compiled ProNIT database and data from recent references), and results in correlation coefficient of 0.72. Availability and implementation: http://compbio.clemson.edu/SAMPDI. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.

SUMMARY: Electrostatic force is an essential component of the total force acting between atoms and macromolecules. Therefore, accurate calculations of electrostatic forces are crucial for revealing the mechanisms of many biological processes. We developed a DelPhiForce web server to calculate and visualize the electrostatic forces at molecular level. DelPhiForce web server enables modeling of electrostatic forces on individual atoms, residues, domains and molecules, and generates an output that can be visualized by VMD software. Here we demonstrate the usage of the server for various biological problems including protein-cofactor, domain-domain, protein-protein, protein-DNA and protein-RNA interactions. AVAILABILITY AND IMPLEMENTATION: The DelPhiForce web server is available at: http://compbio.clemson.edu/delphi-force. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Tyrosine sulfation is a type of post-translational modification (PTM) catalyzed by tyrosylprotein sulfotransferases (TPST). The modification plays a crucial role in mediating protein-protein interactions in many biologically important processes. There is no well-defined sequence motif for TPST sulfation, and the underlying determinants of TPST sulfation specificity remains elusive. Here, we perform molecular modeling to uncover the structural and energetic determinants of TPST sulfation specificity. RESULTS: We estimate the binding affinities between TPST and peptides around tyrosines of both sulfated and non-sulfated proteins to differentiate them. We find that better differentiation is achieved after including energy costs associated with local unfolding of the tyrosine-containing peptide in a host protein, which depends on both the peptide's secondary structures and solvent accessibility. Local unfolding renders buried peptide-with ordered structures-thermodynamically available for TPST binding. Our results suggest that both thermodynamic availability of the peptide and its binding affinity to the enzyme are important for TPST sulfation specificity, and their interplay results into great variations in sequences and structures of sulfated peptides. We expect our method to be useful in predicting potential sulfation sites and transferable to other TPST variants. Our study may also shed light on other PTM systems without well-defined sequence and structural specificities. AVAILABILITY AND IMPLEMENTATION: All the data and scripts used in the work are available at http://dlab.clemson.edu/research/Sulfation.

BACKGROUND: Currently, most people use NCBI's PubMed to search the MEDLINE database, an important bibliographical information source for life science and biomedical information. However, PubMed has some drawbacks that make it difficult to find relevant publications pertaining to users' individual intentions, especially for non-expert users. To ameliorate the disadvantages of PubMed, we developed G-Bean, a graph based biomedical search engine, to search biomedical articles in MEDLINE database more efficiently. METHODS: G-Bean addresses PubMed's limitations with three innovations: (1) Parallel document index creation: a multithreaded index creation strategy is employed to generate the document index for G-Bean in parallel; (2) Ontology-graph based query expansion: an ontology graph is constructed by merging four major UMLS (Version 2013AA) vocabularies, MeSH, SNOMEDCT, CSP and AOD, to cover all concepts in National Library of Medicine (NLM) database; a Personalized PageRank algorithm is used to compute concept relevance in this ontology graph and the Term Frequency - Inverse Document Frequency (TF-IDF) weighting scheme is used to re-rank the concepts. The top 500 ranked concepts are selected for expanding the initial query to retrieve more accurate and relevant information; (3) Retrieval and re-ranking of documents based on user's search intention: after the user selects any article from the existing search results, G-Bean analyzes user's selections to determine his/her true search intention and then uses more relevant and more specific terms to retrieve additional related articles. The new articles are presented to the user in the order of their relevance to the already selected articles. RESULTS: Performance evaluation with 106 OHSUMED benchmark queries shows that G-Bean returns more relevant results than PubMed does when using these queries to search the MEDLINE database. PubMed could not even return any search result for some OHSUMED queries because it failed to form the appropriate Boolean query statement automatically from the natural language query strings. G-Bean is available at http://bioinformatics.clemson.edu/G-Bean/index.php. CONCLUSIONS: G-Bean addresses PubMed's limitations with ontology-graph based query expansion, automatic document indexing, and user search intention discovery. It shows significant advantages in finding relevant articles from the MEDLINE database to meet the information need of the user.

The rapid development of gene ontology (GO) and huge amount of biomedical data annotated by GO terms necessitate computation of semantic similarity of GO terms and, in turn, measurement of functional similarity of genes based on their annotations. In this paper we propose a novel and efficient method to measure the semantic similarity of GO terms. The proposed method addresses the limitations in existing GO term similarity measurement techniques; it computes the semantic content of a GO term by considering the information content of all of its ancestor terms in the graph. The aggregate information content (AIC) of all ancestor terms of a GO term implicitly reflects the GO term's location in the GO graph and also represents how human beings use this GO term and all its ancestor terms to annotate genes. We show that semantic similarity of GO terms obtained by our method closely matches the human perception. Extensive experimental studies show that this novel method also outperforms all existing methods in terms of the correlation with gene expression data. We have developed web services for measuring semantic similarity of GO terms and functional similarity of genes using the proposed AIC method and other popular methods. These web services are available at http://bioinformatics.clemson.edu/G-SESAME.

To address the need for an efficient and effective biomedical information retrieval system, this paper presents an ontology-graph based web tool, G-Bean (graph based biomedical search engine), for searching biomedical documents from the MEDLINE database. This search engine uses an ontology-graph based query expansion technique to expand the initial query with additional query terms and/or more specific query concepts, resulting in the retrieval of more accurate and relevant information from the database. A multithreading parallel process is used to automatically generate the document index to address the inefficiency of the PubMed's manual indexing process. This search engine can also discover user's true search intention and retrieve additional relevant articles based on articles that he/she has already shown interest in.

Early detection of melanoma, the deadliest type of skin cancer, has the potential to reduce morbidity and mortality. This paper presents an automated system for early identification of melanoma, which makes objective judgments based on quantitative measures. The system involves image processing, feature extraction, and support vector machine (SVM) classification. Images of 19 malignant melanoma and 168 benign subjects were collected by a spectroscopic device to reflect morphologies in diseased layers of skin. Features were extracted based on statistical parameters of pixel intensities and were fed into an SVM classifier. The system achieved 92% classification accuracy, 100% sensitivity and 92% specificity.

UNLABELLED: A new edition of the DelPhi web server, DelPhi web server v2, is released to include atomic presentation of geometrical figures. These geometrical objects can be used to model nano-size objects together with real biological macromolecules. The position and size of the object can be manipulated by the user in real time until desired results are achieved. The server fixes structural defects, adds hydrogen atoms and calculates electrostatic energies and the corresponding electrostatic potential and ionic distributions. AVAILABILITY AND IMPLEMENTATION: The web server follows a client-server architecture built on PHP and HTML and utilizes DelPhi software. The computation is carried out on supercomputer cluster and results are given back to the user via http protocol, including the ability to visualize the structure and corresponding electrostatic potential via Jmol implementation. The DelPhi web server is available from http://compbio.clemson.edu/delphi_webserver.

In this study, we present a systematic method for early detection of mild cognitive impairment (MCI) from magnetic resonance images (MRI) using image differences and clinical features. Early detection of MCI has pivotal importance to delay or prevent the onset of Alzheimer's disease (AD). Subjects were selected from the Open Access Series of Imaging Studies (OASIS)database and included 89 MCI subjects and 80 controls. T1 weighted MRI scans were analyzed to identify their voxel-by-voxel differences in gray matter (GM) intensity between MCI group and control group. Based on the differences, a threshold-based unseeded region growing algorithm was designed to determine multiple regions which atrophy is characteristic of MCI. A feature ranking method was then adopted to select a small number of regions that presented relatively more pronounced atrophy. Next, support vector machine (SVM) based classification was applied by using the clinical features of subjects and the features of selected regions. Our method was tested by leave-one-out cross-validation and it demonstrated high classification accuracy (90%).

We study traffic dynamics and propose a new routing strategy based on the local topological information in scale-free network. According to the new routing strategy with a single tunable parameter, a packet is delivered to next node with probabilities that depend not only on the degrees of the next node but also the estimated waiting time at the new node. The routing algorithm is implemented in BA scale-free networks in the case of nodes' delivering ability proportional to its degree. Simulations show that the maximal network capacity corresponds to an optimal controlled parameter.