Journal of Bioinformatics and Computational Biology

Visualizing large-scale data produced by the high throughput experiments as a biological graph leads to better understanding and analysis. This study describes a customized force-directed layout algorithm, EClerize, for biological graphs that represent pathways in which the nodes are associated with Enzyme Commission (EC) attributes. The nodes with the same EC class numbers are treated as members of the same cluster. Positions of nodes are then determined based on both the biological similarity and the connection structure. EClerize minimizes the intra-cluster distance, that is the distance between the nodes of the same EC cluster and maximizes the inter-cluster distance, that is the distance between two distinct EC clusters. EClerize is tested on a number of biological pathways and the improvement brought in is presented with respect to the original algorithm. EClerize is available as a plug-in to Cytoscape (http://apps.cytoscape.org/apps/eclerize).

In genetic association studies, regularization methods are often used due to their computational efficiency for analysis of high-dimensional genomic data. DNA methylation data generated from Infinium HumanMethylation450 BeadChip Kit have a group structure where an individual gene consists of multiple Cytosine–phosphate–Guanine (CpG) sites. Consequently, group-based regularization can precisely detect outcome-related CpG sites. Representative examples are sparse group lasso (SGL) and network-based regularization. The former is powerful when most of the CpG sites within the same gene are associated with a phenotype outcome. In contrast, the latter is preferred when only a few of the CpG sites within the same gene are related to the outcome. In this paper, we propose new variable selection strategy based on a selection probability that measures selection frequency of individual variables selected by both SGL and network-based regularization. In extensive simulation study, we demonstrated that the proposed strategy can show relatively outstanding selection performance under any situation, compared with both SGL and network-based regularization. Also, we applied the proposed strategy to identify differentially methylated CpG sites and their corresponding genes from ovarian cancer data.

The incidence and prevalence of nonalcoholic fatty liver disease (NAFLD) have been increasing to epidemic proportions around the world. NAFLD, a chronic liver disease that affects the nondrinkers, is mainly associated with steatohepatitis and cirrhosis. The progression of NAFLD associated with obesity increases the risk of liver cancer, a disease with poor outcomes and limited therapeutic options. In order to investigate the underlying cellular dynamics leading to NAFLD progression towards cancer on the onset of obesity, we have integrated human hepatocyte pathway with hypoxia-inducible factor1-$\alpha$ (HIF1-$\alpha$) signaling pathway using state space model based on classical control theory. Modified Michaelis–Menten equation and mass action law have been used to define flux vectors of the proposed model. We have incorporated feedback inhibition/activation and allosteric effects into the simulink-based model. The values of kinetic constants have been taken from the literature. It is found that on the onset of obesity, HIF1-$\alpha$-induced proteins stabilize approximately 62 times that in the case of a normal cell. Consequently, the HIF1-$\alpha$-induced proteins enhance the enzymatic activities of hexokinase (HK), phosphofructo kinase (PFK), lactate dehydrogenase (LDH), and pyruvate dehydrogenase (PDH), which induce Warburg effect promoting an environment suitable for cancer cells.

Protein-protein binding interaction is the most prevalent biological activity that mediates a great variety of biological processes. The increasing availability of experimental data of protein–protein interaction allows a systematic construction of protein–protein interaction networks, significantly contributing to a better understanding of protein functions and their roles in cellular pathways and human diseases. Compared to well-established classification for protein–protein interactions (PPIs), limited work has been conducted for estimating protein–protein binding free energy, which can provide informative real-value regression models for characterizing the protein–protein binding affinity. In this study, we propose a novel ensemble computational framework, termed ProBAPred (Protein–protein Binding Affinity Predictor), for quantitative estimation of protein–protein binding affinity. A large number of sequence and structural features, including physical–chemical properties, binding energy and conformation annotations, were collected and calculated from currently available protein binding complex datasets and the literature. Feature selection based on the WEKA package was performed to identify and characterize the most informative and contributing feature subsets. Experiments on the independent test showed that our ensemble method achieved the lowest Mean Absolute Error (MAE; 1.657kcal/mol) and the second highest correlation coefficient ($R\text{-value}=0.467$), compared with the existing methods. The datasets and source codes of ProBAPred, and the supplementary materials in this study can be downloaded at http://lightning.med.monash.edu/probapred/ for academic use. We anticipate that the developed ProBAPred regression models can facilitate computational characterization and experimental studies of protein–protein binding affinity.

Based on previous studies, empirical distribution of the bacterial burst size varies even in a population of isogenic bacteria. Since bacteriophage progenies increase linearly with time, it is the lysis time variation that results in the bacterial burst size variations.

Here, the burst size variation is computationally modeled by considering the lysis time decisions as a game. Each player in the game is a bacteriophage that has initially infected and lysed its host bacterium. Also, the payoff of each burst size strategy is the average number of bacteria that are solely infected by the bacteriophage progenies after lysis. For calculating the payoffs, a new version of ball and bin model with time dependent occupation probabilities (TDOP) is proposed.

We show that Nash equilibrium occurs for a range of mixed burst size strategies that are chosen and played by bacteriophages, stochastically. Moreover, it is concluded that the burst size variations arise from choosing mixed lysis strategies by each player. By choosing the lysis time and also the burst size stochastically, the released bacteriophage progenies infect a portion of host bacteria in environment and avoid extinction. The probability distribution of the mixed burst size strategies is also identified.

miRNAs are involved in many critical cellular activities through binding to their mRNA targets, e.g. in cell proliferation, differentiation, death, growth control, and developmental timing. Accurate prediction of miRNA targets can assist efficient experimental investigations on the functional roles of miRNAs. Their prediction, however, remains a challengeable task due to the lack of experimental data about the tertiary structure of miRNA-target binding duplexes. In particular, correlations of nucleotides in the binding duplexes may not be limited to the canonical Watson Crick base pairs (BPs) as they have been perceived; methods based on secondary structure prediction (typically minimum free energy (MFE)) have only had mix success. In this work, we characterized miRNA binding duplexes with a graph model to capture the correlations between pairs of nucleotides of an miRNA and its target sequences. We developed machine learning algorithms to train the graph model to predict the target sites of miRNAs. In particular, because imbalance between positive and negative samples can significantly deteriorate the performance of machine learning methods, we designed a novel method to re-sample available dataset to produce more informative data learning process.

We evaluated our model and miRNA target prediction method on human miRNAs and target data obtained from mirTarBase, a database of experimentally verified miRNA-target interactions. The performance of our method in target prediction achieved a sensitivity of 86% with a false positive rate below 13%. In comparison with the state-of-the-art methods miRanda and RNAhybrid on the test data, our method outperforms both of them by a significant margin.

The source codes, test sets and model files all are available at http://rna-informatics.uga.edu/?f=software&p=GraB-miTarget.

Detection of protein–protein interactions (PPIs) plays a vital role in molecular biology. Particularly, pathogenic infections are caused by interactions of host and pathogen proteins. It is important to identify host–pathogen interactions (HPIs) to discover new drugs to counter infectious diseases. Conventional wet lab PPI detection techniques have limitations in terms of cost and large-scale application. Hence, computational approaches are developed to predict PPIs. This study aims to develop machine learning models to predict inter-species PPIs with a special interest in HPIs. Specifically, we focus on seeking answers to three questions that arise while developing an HPI predictor: (1) How should negative training examples be selected? (2) Does assigning sample weights to individual negative examples based on their similarity to positive examples improve generalization performance? and, (3) What should be the size of negative samples as compared to the positive samples during training and evaluation? We compare two available methods for negative sampling: random versus DeNovo sampling and our experiments show that DeNovo sampling offers better accuracy. However, our experiments also show that generalization performance can be improved further by using a soft DeNovo approach that assigns sample weights to negative examples inversely proportional to their similarity to known positive examples during training. Based on our findings, we have also developed an HPI predictor called HOPITOR (Host-Pathogen Interaction Predictor) that can predict interactions between human and viral proteins. The HOPITOR web server can be accessed at the URL: http://faculty.pieas.edu.pk/fayyaz/software.html#HoPItor.

In this work, a novel hybrid model called PSOSA for solving multiple sequence alignment (MSA) problem is proposed. The developed approach is a combination between particle swarm optimization (PSO) algorithm and simulated annealing (SA) technique. In our PSOSA approach, PSO is exploited in global search, but it is easily trapped into local optimum and may lead to premature convergence. SA is incorporated as local improvement approach to overcome local optimum problem and intensify the search in local regions to improve solution quality. Numerical results on BAliBASE benchmark have shown the effectiveness of the proposed method and its ability to achieve good quality solutions when compared with those given by other existing methods.

With the increase in immunocompromised patients in the recent years, fungal infections have emerged as new and serious threat in hospitals. This, and the insufficiency of current antifungal therapies alongside their toxic effects on patients, has led to the increased interest in seeking new antifungal peptides. In the present study, we have developed a prediction method for screening of antifungal peptides. For this, we have chosen Chou’s pseudo amino acid composition (PseAAC) to translate peptide sequences into numeric values. Thus, the SVM classifier was performed for binomial classification of antifungal peptides. The performance of the classifier was evaluated via ten-fold cross-validation and an independent dataset. For further validation of the model developed, 22 P24-derived peptides were predicted using the classifier and in vitro assays were performed on the three peptides with the highest prediction score. The results showed that the PseAAC $+$ SVM method is able to predict AFPs with ACC of 94.76%. In vitro results also validate the SEN and SPC of the classifier. The results suggest that the computational approach used in this study is highly efficient for prediction of antifungal peptides, which can save time and money in AFP screening and synthesis of novel peptides.