ASDCD: Antifungal Synergistic Drug Combination Database

Finding effective drugs to treat fungal infections has important clinical significance based on high mortality rates, especially in an immunodeficient population. Traditional antifungal drugs with single targets have been reported to cause serious side effects and drug resistance. Nowadays, however, drug combinations, particularly with respect to synergistic interaction, have attracted the attention of researchers. In fact, synergistic drug combinations could simultaneously affect multiple subpopulations, targets, and diseases. Therefore, a strategy that employs synergistic antifungal drug combinations could eliminate the limitations noted above and offer the opportunity to explore this emerging bioactive chemical space. However, it is first necessary to build a powerful database in order to facilitate the analysis of drug combinations. To address this gap in our knowledge, we have built the first Antifungal Synergistic Drug Combination Database (ASDCD), including previously published synergistic antifungal drug combinations, chemical structures, targets, target-related signaling pathways, indications, and other pertinent data. Its current version includes 210 antifungal synergistic drug combinations and 1225 drug-target interactions, involving 105 individual drugs from more than 12,000 references. ASDCD is freely available at http://ASDCD.amss.ac.cn.     

IDDI: integrated domain-domain interaction and protein interaction analysis system

Background

Deciphering protein-protein interaction (PPI) in domain level enriches valuable information about binding mechanism and functional role of interacting proteins. The 3D structures of complex proteins are reliable source of domain-domain interaction (DDI) but the number of proven structures is very limited. Several resources for the computationally predicted DDI have been generated but they are scattered in various places and their prediction show erratic performances. A well-organized PPI and DDI analysis system integrating these data with fair scoring system is necessary.

Method

We integrated three structure-based DDI datasets and twenty computationally predicted DDI datasets and constructed an interaction analysis system, named IDDI, which enables to browse protein and domain interactions with their relationships. To integrate heterogeneous DDI information, a novel scoring scheme is introduced to determine the reliability of DDI by considering the prediction scores of each DDI and the confidence levels of each prediction method in the datasets, and independencies between predicted datasets. In addition, we connected this DDI information to the comprehensive PPI information and developed a unified interface for the interaction analysis exploring interaction networks at both protein and domain level.

Result

IDDI provides 204,705 DDIs among total 7,351 Pfam domains in the current version. The result presents that total number of DDIs is increased eight times more than that of previous studies. Due to the increment of data, 50.4% of PPIs could be correlated with DDIs which is more than twice of previous resources. Newly designed scoring scheme outperformed the previous system in its accuracy too. User interface of IDDI system provides interactive investigation of proteins and domains in interactions with interconnected way. A specific example is presented to show the efficiency of the systems to acquire the comprehensive information of target protein with PPI and DDI relationships. IDDI is freely available at http://pcode.kaist.ac.kr/iddi/.

     

An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity

Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The algorithm is implemented and available at http://cps.kaist.ac.kr/∼ckhong/tools/download/PAD.tar.gz.     

A protein interaction network associated with asthma

Identifying candidate genes related to complex diseases or traits and mapping their relationships require a system-level analysis at a cellular scale. The objective of the present study is to systematically analyze the complex effects of interrelated genes and provide a framework for revealing their relationships in association with a specific disease (asthma in this case). We observed that protein-protein interaction (PPI) networks associated with asthma have a power-law connectivity distribution as many other biological networks have. The hub nodes and skeleton substructure of the result network are consistent with the prior knowledge about asthma pathways, and also suggest unknown candidate target genes associated with asthma, including GNB2L1, BRCA1, CBL, and VAV1. In particular, GNB2L1 appears to play a very important role in the asthma network through frequent interactions with key proteins in cellular signaling. This network-based approach represents an alternative method for analyzing the complex effects of candidate genes associated with complex diseases and suggesting a list of gene drug targets. The full list of genes and the analysis details are available in the following online supplementary materials: http://biosoft.kaist.ac.kr:8080/resources/asthma_ppi.     

Genomic Target Database (GTD): A database of potential targets in human pathogenic bacteria

A Genomic Target Database (GTD) has been developed having putative genomic drug targets for human bacterial pathogens. The selected pathogens are either drug resistant or vaccines are yet to be developed against them. The drug targets have been identified using subtractive genomics approaches and these are subsequently classified into

1. Drug targets in pathogen specific unique metabolic pathways,
2. Drug targets in host-pathogen common metabolic pathways, and
3. Membrane localized drug targets.

HTML code is used to link each target to its various properties and other available public resources. Essential resources and tools for subtractive genomic analysis, sub-cellular localization, vaccine and drug designing are also mentioned. To the best of authors knowledge, no such database (DB) is presently available that has listed metabolic pathways and membrane specific genomic drug targets based on subtractive genomics. Listed targets in GTD are readily available resource in developing drug and vaccine against the respective pathogen, its subtypes, and other family members. Currently GTD contains 58 drug targets for four pathogens. Shortly, drug targets for six more pathogens will be listed.

Availability

GTD is available at IIOAB website http://www.iioab.webs.com/GTD.htm. It can also be accessed at http://www.iioabdgd.webs.com.GTD is free for academic research and non-commercial use only. Commercial use is strictly prohibited without prior permission from IIOAB.     

Distinctive Behaviors of Druggable Proteins in Cellular Networks

The interaction environment of a protein in a cellular network is important in defining the role that the protein plays in the system as a whole, and thus its potential suitability as a drug target. Despite the importance of the network environment, it is neglected during target selection for drug discovery. Here, we present the first systematic, comprehensive computational analysis of topological, community and graphical network parameters of the human interactome and identify discriminatory network patterns that strongly distinguish drug targets from the interactome as a whole. Importantly, we identify striking differences in the network behavior of targets of cancer drugs versus targets from other therapeutic areas and explore how they may relate to successful drug combinations to overcome acquired resistance to cancer drugs. We develop, computationally validate and provide the first public domain predictive algorithm for identifying druggable neighborhoods based on network parameters. We also make available full predictions for 13,345 proteins to aid target selection for drug discovery. All target predictions are available through canSAR.icr.ac.uk. Underlying data and tools are available at https://cansar.icr.ac.uk/cansar/publications/druggable_network_neighbourhoods/.     

NABIC SNP: an integrated database for SNP markers

AvailabilityThe database is available online for free at http://nabic.rda.go.kr/SNP     

Prediction of drugs having opposite effects on disease genes in a directed network

Background

Developing novel uses of approved drugs, called drug repositioning, can reduce costs and times in traditional drug development. Network-based approaches have presented promising results in this field. However, even though various types of interactions such as activation or inhibition exist in drug-target interactions and molecular pathways, most of previous network-based studies disregarded this information.

Methods

We developed a novel computational method, Prediction of Drugs having Opposite effects on Disease genes (PDOD), for identifying drugs having opposite effects on altered states of disease genes. PDOD utilized drug-drug target interactions with ‘effect type’, an integrated directed molecular network with ‘effect type’ and ‘effect direction’, and disease genes with regulated states in disease patients. With this information, we proposed a scoring function to discover drugs likely to restore altered states of disease genes using the path from a drug to a disease through the drug-drug target interactions, shortest paths from drug targets to disease genes in molecular pathways, and disease gene-disease associations.

Results

We collected drug-drug target interactions, molecular pathways, and disease genes with their regulated states in the diseases. PDOD is applied to 898 drugs with known drug-drug target interactions and nine diseases. We compared performance of PDOD for predicting known therapeutic drug-disease associations with the previous methods. PDOD outperformed other previous approaches which do not exploit directional information in molecular network. In addition, we provide a simple web service that researchers can submit genes of interest with their altered states and will obtain drugs seeming to have opposite effects on altered states of input genes at http://gto.kaist.ac.kr/pdod/index.php/main.

Conclusions

Our results showed that ‘effect type’ and ‘effect direction’ information in the network based approaches can be utilized to identify drugs having opposite effects on diseases. Our study can offer a novel insight into the field of network-based drug repositioning.

     

Starvation Driven Diffusion as a Survival Strategy of Biological Organisms

The purpose of this article is to introduce a diffusion model for biological organisms that increase their motility when food or other resource is insufficient. It is shown in this paper that Fick’s diffusion law does not explain such a starvation driven diffusion correctly. The diffusion model for nonuniform Brownian motion in Kim (Einstein’s random walk and thermal diffusion, preprint http://amath.kaist.ac.kr/papers/Kim/31.pdf, 2013) is employed in this paper and a Fokker–Planck type diffusion law is obtained. Lotka–Volterra type competition systems with spatial heterogeneity are tested, where one species follows the starvation driven diffusion and the other follows the linear diffusion. In heterogeneous environments, the starvation driven diffusion turns out to be a better survival strategy than the linear one. Various issues such as the global asymptotic stability, convergence to an ideal free distribution, the extinction and coexistence of competing species are discussed.     

MLViS: A Web Tool for Machine Learning-Based Virtual Screening in Early-Phase of Drug Discovery and Development

Virtual screening is an important step in early-phase of drug discovery process. Since there are thousands of compounds, this step should be both fast and effective in order to distinguish drug-like and nondrug-like molecules. Statistical machine learning methods are widely used in drug discovery studies for classification purpose. Here, we aim to develop a new tool, which can classify molecules as drug-like and nondrug-like based on various machine learning methods, including discriminant, tree-based, kernel-based, ensemble and other algorithms. To construct this tool, first, performances of twenty-three different machine learning algorithms are compared by ten different measures, then, ten best performing algorithms have been selected based on principal component and hierarchical cluster analysis results. Besides classification, this application has also ability to create heat map and dendrogram for visual inspection of the molecules through hierarchical cluster analysis. Moreover, users can connect the PubChem database to download molecular information and to create two-dimensional structures of compounds. This application is freely available through www.biosoft.hacettepe.edu.tr/MLViS/.     

NNvPDB: Neural Network based Protein Secondary Structure Prediction with PDB Validation

Availabilityhttp://bit.srmuniv.ac.in/cgi-bin/bit/cfpdb/nnsecstruct.pl     

Genetic Networks Inducing Invasive Growth in Saccharomyces cerevisiae Identified Through Systematic Genome-Wide Overexpression

The budding yeast Saccharomyces cerevisiae can respond to nutritional and environmental stress by implementing a morphogenetic program wherein cells elongate and interconnect, forming pseudohyphal filaments. This growth transition has been studied extensively as a model signaling system with similarity to processes of hyphal development that are linked with virulence in related fungal pathogens. Classic studies have identified core pseudohyphal growth signaling modules in yeast; however, the scope of regulatory networks that control yeast filamentation is broad and incompletely defined. Here, we address the genetic basis of yeast pseudohyphal growth by implementing a systematic analysis of 4909 genes for overexpression phenotypes in a filamentous strain of S. cerevisiae. Our results identify 551 genes conferring exaggerated invasive growth upon overexpression under normal vegetative growth conditions. This cohort includes 79 genes lacking previous phenotypic characterization. Pathway enrichment analysis of the gene set identifies networks mediating mitogen-activated protein kinase (MAPK) signaling and cell cycle progression. In particular, overexpression screening suggests that nuclear export of the osmoresponsive MAPK Hog1p may enhance pseudohyphal growth. The function of nuclear Hog1p is unclear from previous studies, but our analysis using a nuclear-depleted form of Hog1p is consistent with a role for nuclear Hog1p in repressing pseudohyphal growth. Through epistasis and deletion studies, we also identified genetic relationships with the G2 cyclin Clb2p and phenotypes in filamentation induced by S-phase arrest. In sum, this work presents a unique and informative resource toward understanding the breadth of genes and pathways that collectively constitute the molecular basis of filamentation.     

16S Classifier: A Tool for Fast and Accurate Taxonomic Classification of 16S rRNA Hypervariable Regions in Metagenomic Datasets

The diversity of microbial species in a metagenomic study is commonly assessed using 16S rRNA gene sequencing. With the rapid developments in genome sequencing technologies, the focus has shifted towards the sequencing of hypervariable regions of 16S rRNA gene instead of full length gene sequencing. Therefore, 16S Classifier is developed using a machine learning method, Random Forest, for faster and accurate taxonomic classification of short hypervariable regions of 16S rRNA sequence. It displayed precision values of up to 0.91 on training datasets and the precision values of up to 0.98 on the test dataset. On real metagenomic datasets, it showed up to 99.7% accuracy at the phylum level and up to 99.0% accuracy at the genus level. 16S Classifier is available freely at http://metagenomics.iiserb.ac.in/16Sclassifier and http://metabiosys.iiserb.ac.in/16Sclassifier.     

BioJazz: in silico evolution of cellular networks with unbounded complexity using rule-based modeling

Systems biologists aim to decipher the structure and dynamics of signaling and regulatory networks underpinning cellular responses; synthetic biologists can use this insight to alter existing networks or engineer de novo ones. Both tasks will benefit from an understanding of which structural and dynamic features of networks can emerge from evolutionary processes, through which intermediary steps these arise, and whether they embody general design principles. As natural evolution at the level of network dynamics is difficult to study, in silico evolution of network models can provide important insights. However, current tools used for in silico evolution of network dynamics are limited to ad hoc computer simulations and models. Here we introduce BioJazz, an extendable, user-friendly tool for simulating the evolution of dynamic biochemical networks. Unlike previous tools for in silico evolution, BioJazz allows for the evolution of cellular networks with unbounded complexity by combining rule-based modeling with an encoding of networks that is akin to a genome. We show that BioJazz can be used to implement biologically realistic selective pressures and allows exploration of the space of network architectures and dynamics that implement prescribed physiological functions. BioJazz is provided as an open-source tool to facilitate its further development and use. Source code and user manuals are available at: http://oss-lab.github.io/biojazz and http://osslab.lifesci.warwick.ac.uk/BioJazz.aspx.     

Integrative Gene Network Construction to Analyze Cancer Recurrence Using Semi-Supervised Learning

Background

The prognosis of cancer recurrence is an important research area in bioinformatics and is challenging due to the small sample sizes compared to the vast number of genes. There have been several attempts to predict cancer recurrence. Most studies employed a supervised approach, which uses only a few labeled samples. Semi-supervised learning can be a great alternative to solve this problem. There have been few attempts based on manifold assumptions to reveal the detailed roles of identified cancer genes in recurrence.

Results

In order to predict cancer recurrence, we proposed a novel semi-supervised learning algorithm based on a graph regularization approach. We transformed the gene expression data into a graph structure for semi-supervised learning and integrated protein interaction data with the gene expression data to select functionally-related gene pairs. Then, we predicted the recurrence of cancer by applying a regularization approach to the constructed graph containing both labeled and unlabeled nodes.

Conclusions

The average improvement rate of accuracy for three different cancer datasets was 24.9% compared to existing supervised and semi-supervised methods. We performed functional enrichment on the gene networks used for learning. We identified that those gene networks are significantly associated with cancer-recurrence-related biological functions. Our algorithm was developed with standard C++ and is available in Linux and MS Windows formats in the STL library. The executable program is freely available at: http://embio.yonsei.ac.kr/~Park/ssl.php.