Heparin-binding protein (HBP) is a cationic antibacterial protein derived from multinuclear neutrophils and an important biomarker of infectious diseases. The correct identification of HBP is of great significance to the study of infectious diseases. This work provides the first HBP recognition framework based on machine learning to accurately identify HBP. By using four sequence descriptors, HBP and non-HBP samples were represented by discrete numbers. By inputting these features into a support vector machine (SVM) and random forest (RF) algorithm and comparing the prediction performances of these methods on training data and independent test data, it is found that the SVM-based classifier has the greatest potential to identify HBP. The model could produce an auROC of 0.981 ± 0.028 on training data using 10-fold cross-validation and an overall accuracy of 95.0% on independent test data. As the first model for HBP recognition, it will provide some help for infectious diseases and stimulate further research in related fields.
Molecular computing and bioinformatics are two important interdisciplinary sciences that study molecules and computers. Molecular computing is a branch of computing that uses DNA, biochemistry, and molecular biology hardware, instead of traditional silicon-based computer technologies. Research and development in this area concerns theory, experiments, and applications of molecular computing. The core advantage of molecular computing is its potential to pack vastly more circuitry onto a microchip than silicon will ever be capable of—and to do it cheaply. Molecules are only a few nanometers in size, making it possible to manufacture chips that contain billions—even trillions—of switches and components. To develop molecular computers, computer scientists must draw on expertise in subjects not usually associated with their field, including organic chemistry, molecular biology, bioengineering, and smart materials. Bioinformatics works on the contrary; bioinformatics researchers develop novel algorithms or software tools for computing or predicting the molecular structure or function. Molecular computing and bioinformatics pay attention to the same object, and have close relationships, but work toward different orientations.
Identifying disease-related microRNAs (miRNAs) is crucial to understanding the etiology and pathogenesis of many diseases. However, existing computational methods are facing a few dilemmas such as lacking “negative samples” (i.e. confirmed unrelated miRNA-disease pairs). In this study, we proposed LRMCMDA, a low-rank matrix completion-based method to predict miRNA-disease associations. LRMCMDA firstly constructs a bipartite miRNA-disease graph from known associations and defines its Rprojected miRNA graph, in which two miRNAs are connected if they are adjacent to the same disease in the bipartite graph. Similarly, we can define its D-projected disease graph. It then infers negative samples by assuming that connecting an unrelated miRNA-disease pair in the bipartite graph will change its Rprojected miRNA graph and D-projected disease graph. Providing with both known miRNA-disease associations and negative samples, LRMCMDA infers associations between all miRNAs and diseases using a low-rank matrix completion model, in which miRNA similarity and disease similarity are incorporated into regularization terms. The assumption is that similar miRNAs will associate with similar diseases and vice versa. We compared LRMCMDA with a few state-of-the-art algorithms on several established miRNA-disease databases. LRMCMDA achieves an AUC of 0.8882 on the 5-fold cross-validation, significantly outperforming canonical methods when predicting miRNA-disease associations, and associating miRNAs with isolated diseases. The experimental results demonstrate that LRMCMDA effectively infers novel miRNA-disease associations. In addition, the case studies on cancers have further proven that LRMCMDA is useful in identifying potential cancer-associated miRNAs for experimental validation.
One novel representation of DNA sequence combining the global and local position information of the original sequence has been proposed to distinguish the different species. First, for the sufficient exploitation of global information, one graphical representation of DNA sequence has been formulated according to the curve of Fermat spiral. Then, for the consideration of local characteristics of DNA sequence, attaching each point in the curve of Fermat spiral with the related mass has been applied based on the relationships of neighboring four nucleotides. In this paper, the normalized moments of inertia of the curve of Fermat spiral which composed by the points with mass has been calculated as the numerical description of the corresponding DNA sequence on the first exons of beta-global genes. Choosing the Euclidean distance as the measurement of the numerical descriptions, the similarity between species has shown the performance of proposed method.
Lung cancer is a kind of cancer with high morbidity and mortality which is associated with various gene mutations. Individualized targeted-drug therapy has become the optimized treatment of lung cancer, especially benefit for patients who are not qualified for lung lobectomy. It is crucial to accurately identify mutant genes within tumor region from stained pathological slice. Therefore, we mainly focus on identifying mutant gene of lung cancer by analyzing the pathological images. In this study, we have proposed a method by identifying gene mutations in lung cancer with histopathological stained image and deep learning to predict target-drug therapy, referred to as DeepIMLH. The DeepIMLH algorithm first downloaded 180 hematoxylin-eosin staining (H&E) images of lung cancer from the Cancer Gene Atlas (TCGA). Then deep convolution Gaussian mixture model (DCGMM) was used to perform color normalization. Convolutional neural network (CNN) and residual network (Res-Net) were used to identifying mutated gene from H&E stained imaging and achieved good accuracy. It demonstrated that our method can be used to choose targeted-drug therapy which might be applied to clinical practice. More studies should be conducted though.
12 January 2006 in Journal of Mathematical Chemistry