Explore the vast range of titles available.

Dynamic communities in proteins comprise the cohesive structural units that individually exhibit rigid body motions. These can correspond to structural domains, but are usually smaller parts that move with respect to one another in a protein's internal motions, key to its functional dynamics. Previous studies emphasized their importance to understand the nature of ligand-induced allosteric regulation. These studies reported that mutations to key community residues can hinder transmission of allosteric signals among the communities. Usually molecular dynamic (MD) simulations (~ 100 ns or longer) have been used to identify the communities-a demanding task for larger proteins. In the present study, we propose that dynamic communities obtained from MD simulations can also be obtained alternatively with simpler models-the elastic network models (ENMs). To verify this premise, we compare the specific communities obtained from MD and ENMs for 44 proteins. We evaluate the correspondence in communities from the two methods and compute the extent of agreement in the dynamic cross-correlation data used for community detection. Our study reveals a strong correspondence between the communities from MD and ENM and also good agreement for the residue cross-correlations. Importantly, we observe that the dynamic communities from MD can be closely reproduced with ENMs. With ENMs, we also compare the community structures of stable and unstable mutant forms of T4 Lysozyme with its wild-type. We find that communities for unstable mutants show substantially poorer agreement with the wild-type communities than do stable mutants, suggesting such ENM-based community structures can serve as a means to rapidly identify deleterious mutants.

Colorado potato beetle (CPB, Leptinotarsa decemlineata ) is a major pest of potato and other solanaceous vegetables in the Northern Hemisphere. The insect feeds on leaves and can completely defoliate crops. Because of the repeated use of single insecticide classes without rotating active ingredients, many chemicals are no longer effective in controlling CPB. Ledprona is a sprayable double-stranded RNA biopesticide with a new mode of action that triggers the RNA interference pathway. Laboratory assays with second instar larvae fed Ledprona showed a dose–response where 25×10 −6 g/L of dsPSMB5 caused 90% mortality after 6days of initial exposure. We also showed that exposure to Ledprona for 6h caused larval mortality and decreased target messenger RNA (mRNA) expression. Decrease in PSMB5 protein levels was observed after 48h of larval exposure to Ledprona. Both PSMB5 mRNA and protein levels did not recover over time. Ledprona efficacy was demonstrated in a whole plant greenhouse trial and performed similarly to spinosad. Ledprona, currently pending registration at EPA, represents a new biopesticide class integrated pest management and insecticide resistance management programs directed against CPB.

Multiple mRNA isoforms of the same gene are produced via alternative splicing, a biological mechanism that regulates protein diversity while maintaining genome size. Alternatively spliced mRNA isoforms of the same gene may sometimes have very similar sequence, but they can have significantly diverse effects on cellular function and regulation. The products of alternative splicing have important and diverse functional roles, such as response to environmental stress, regulation of gene expression, human heritable, and plant diseases. The mRNA isoforms of the same gene can have dramatically different functions. Despite the functional importance of mRNA isoforms, very little has been done to annotate their functions. The recent years have however seen the development of several computational methods aimed at predicting mRNA isoform level biological functions. These methods use a wide array of proteo-genomic data to develop machine learning-based mRNA isoform function prediction tools. In this review, we discuss the computational methods developed for predicting the biological function at the individual mRNA isoform level.

This book focuses on making the environment sustainable by employing engineering aspects and green computing through concepts of modern education and solutions. It visualizes the potential of artificial intelligence in manufacturing and green technology, enhanced by business activities and strategies for rapid implementation. This book covers utilization of renewable resources and implementation of the latest energy-generation technologies. It discusses how to save resources from getting depleted in nature, and illustrates the facilitation of green technology in industry with the usage of advanced materials. The book also covers environmental sustainability and the current trends in manufacturing. The book provides basic concepts of green technology along with the technology aspects for researchers, faculty, and students.

Invasive cervical cancers (ICC), caused by HPV infections, have a heterogeneous molecular landscape. We investigate the detection, timing, and HPV type specificity of somatic mutations in 3929 HPV-positive exfoliated cervical cell samples from individuals undergoing cervical screening in the U.S. using deep targeted sequencing in ICC cases, precancers, and HPV-positive controls. We discover a subset of hotspot mutations rare in controls (2.6%) but significantly more prevalent in precancers, particularly glandular precancer lesions (10.2%), and cancers (25.7%), supporting their involvement in ICC carcinogenesis. Hotspot mutations differ by HPV type, and HPV18/45-positive ICC are more likely to have multiple hotspot mutations compared to HPV16-positive ICC. The proportion of cells containing hotspot mutations is higher (i.e., higher variant allele fraction) in ICC and mutations are detectable up to 6 years prior to cancer diagnosis. Our findings demonstrate the feasibility of using exfoliated cervical cells for detection of somatic mutations as potential diagnostic biomarkers. Invasive cervical cancer is caused by HPV infection, but the disease itself is highly variable. Here, the authors use deep targeted sequencing to identify hotspot mutations in routine screening samples prior to diagnosis, which differed depending on HPV type.

Abstract High-coverage sequencing allows the study of variants occurring at low frequencies within samples, but is susceptible to false-positives caused by sequencing error. Ion Torrent has a very low single nucleotide variant (SNV) error rate and has been employed for the majority of human papillomavirus (HPV) whole genome sequences. However, benchmarking of intrahost SNVs (iSNVs) has been challenging, partly due to limitations imposed by the HPV life cycle. We address this problem by deep sequencing three replicates for each of 31 samples of HPV type 18 (HPV18). Errors, defined as iSNVs observed in only one of three replicates, are dominated by C→T (G→A) changes, independently of trinucleotide context. True iSNVs, defined as those observed in all three replicates, instead show a more diverse SNV type distribution, with particularly elevated C→T rates in CCG context (CCG→CTG; CGG→CAG) and C→A rates in ACG context (ACG→AAG; CGT→CTT). Characterization of true iSNVs allowed us to develop two methods for detecting true variants: (1) VCFgenie, a dynamic binomial filtering tool which uses each variant's allele count and coverage instead of fixed frequency cut-offs; and (2) a machine learning binary classifier which trains eXtreme Gradient Boosting models on variant features such as quality and trinucleotide context. Each approach outperforms fixed-cut-off filtering of iSNVs, and performance is enhanced when both are used together. Our results provide improved methods for identifying true iSNVs in within-host applications across sequencing platforms, specifically using HPV18 as a case study.

Worldwide, oral cancer is the sixth most common type of cancer. India is in 2nd position, with the highest number of oral cancer patients. To the population of oral cancer patients, India contributes to almost one-third of the total count. Among several types of oral cancer, the most common and dominant one is oral squamous cell carcinoma (OSCC). The major reason for oral cancer is tobacco consumption, excessive alcohol consumption, unhygienic mouth condition, betel quid eating, viral infection (namely human papillomavirus), etc. The early detection of oral cancer type OSCC, in its preliminary stage, gives more chances for better treatment and proper therapy. In this paper, author proposes a convolutional neural network model, for the automatic and early detection of OSCC, and for experimental purposes, histopathological oral cancer images are considered. The proposed model is compared and analyzed with state-of-the-art deep learning models like VGG16, VGG19, Alexnet, ResNet50, ResNet101, Mobile Net and Inception Net. The proposed model achieved a cross-validation accuracy of 97.82%, which indicates the suitability of the proposed approach for the automatic classification of oral cancer data.

Understanding the effects of missense mutations on protein stability is a widely acknowledged significant biological problem. Genomic missense mutations may alter one or more amino acids, leading to increased or decreased stability of the encoded proteins. In this study, we describe a novel approach—Protein Stability Prediction with a Gaussian Network Model (PSP-GNM)—to measure the unfolding Gibbs free energy change (ΔΔG) and evaluate the effects of single amino acid substitutions on protein stability. Specifically, PSP-GNM employs a coarse-grained Gaussian Network Model (GNM) that has interactions between amino acids weighted by the Miyazawa–Jernigan statistical potential. We used PSP-GNM to simulate partial unfolding of the wildtype and mutant protein structures, and then used the difference in the energies and entropies of the unfolded wildtype and mutant proteins to calculate ΔΔG. The extent of the agreement between the ΔΔG calculated by PSP-GNM and the experimental ΔΔG was evaluated on three benchmark datasets: 350 forward mutations (S350 dataset), 669 forward and reverse mutations (S669 dataset) and 611 forward and reverse mutations (S611 dataset). We observed a Pearson correlation coefficient as high as 0.61, which is comparable to many of the existing state-of-the-art methods. The agreement with experimental ΔΔG further increased when we considered only those measurements made close to 25 °C and neutral pH, suggesting dependence on experimental conditions. We also assessed for the antisymmetry (ΔΔGreverse = −ΔΔGforward) between the forward and reverse mutations on the Ssym+ dataset, which has 352 forward and reverse mutations. While most available methods do not display significant antisymmetry, PSP-GNM demonstrated near-perfect antisymmetry, with a Pearson correlation of −0.97. PSP-GNM is written in Python and can be downloaded as a stand-alone code.

In high-dimensional data analysis, Feature Selection (FS) is one of the most fundamental issues in machine learning and requires the attention of researchers. These datasets are characterized by huge space due to a high number of features, out of which only a few are significant for analysis. Thus, significant feature extraction is crucial. There are various techniques available for feature selection; among them, the filter techniques are significant in this community, as they can be used with any type of learning algorithm and drastically lower the running time of optimization algorithms and improve the performance of the model. Furthermore, the application of a filter approach depends on the characteristics of the dataset as well as on the machine learning model. Thus, to avoid these issues in this research, a combination of feature reduction (CFR) is considered designing a pipeline of filter approaches for high-dimensional microarray data classification. Considering four filter approaches, sixteen combinations of pipelines are generated. The feature subset is reduced in different levels, and ultimately, the significant feature set is evaluated. The pipelined filter techniques are Correlation-Based Feature Selection (CBFS), Chi-Square Test (CST), Information Gain (InG), and Relief Feature Selection (RFS), and the classification techniques are Decision Tree (DT), Logistic Regression (LR), Random Forest (RF), and k-Nearest Neighbor (k-NN). The performance of CFR depends highly on the datasets as well as on the classifiers. Thereafter, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method is used for ranking all reduction combinations and evaluating the superior filter combination among all.

This paper proposes a novel algorithm, called Fog-Aware-Detection, for detecting moving objects in dense fog environments. The algorithm leverages the characteristics of fog to enhance detection performance by extracting foreground objects from the foggy background. The algorithm involves two main stages: a pre-processing stage for enhancing the foggy image and a detection stage for extracting moving objects from the pre-processed image. The pre-processing stage employs a fog removal technique and a contrast enhancement method to reduce the effect of fog and improve the visibility of objects. The detection stage uses a background subtraction technique to detect moving objects in the pre-processed image. The proposed algorithm is evaluated on a publicly available foggy dataset and achieves promising results in terms of detection accuracy and robustness to various fog densities. The proposed algorithm can be useful for applications such as autonomous driving, surveillance, and navigation systems in foggy environments.