Constructing the boundary between potent and ineffective siRNAs by MG-algorithm with C-features.

Background: In siRNA based antiviral therapeutics, selection of potent siRNAs is an indispensable step, but these commonly used features are unable to construct the boundary between potent and ineffective siRNAs.

Results: Here, we select potent siRNAs by removing ineffective ones, where these conditions for removals are constructed by C-features of siRNAs, C-features are generated by MG-algorithm, Icc-cluster and the different combinations of some commonly used features, MG-algorithm and Icc-cluster are two different algorithms to search the nearest siRNA neighbors. For the ineffective siRNAs in test data, they are removed from test data by I-iteration, where I-iteration continually updates training data by adding these successively removed siRNAs.

Design of Sports Training Simulation System for Children Based on Improved Deep Neural Network.

With the development of AI technology, human-computer interaction technology is no longer the traditional mouse and keyboard interaction. AI and VR have been widely used in early childhood education. In the process of the slow development and application of voice interaction, visual interaction, action interaction, and other technologies, multimodal interaction technology system has become a research hotspot.

Analyzing the similarity of samples and genes by MG-PCC algorithm, t-SNE-SS and t-SNE-SG maps.

Background: For analyzing these gene expression data sets under different samples, clustering and visualizing samples and genes are important methods. However, it is difficult to integrate clustering and visualizing techniques when the similarities of samples and genes are defined by PCC(Person correlation coefficient) measure.

Results: Here, for rare samples of gene expression data sets, we use MG-PCC (mini-groups that are defined by PCC) algorithm to divide them into mini-groups, and use t-SNE-SSP maps to display these mini-groups, where the idea of MG-PCC algorithm is that the nearest neighbors should be in the same mini-groups, t-SNE-SSP map is selected from a series of t-SNE(t-statistic Stochastic Neighbor Embedding) maps of standardized samples, and these t-SNE maps have different perplexity parameter.

Multiple-cumulative probabilities used to cluster and visualize transcriptomes.

Analysis of gene expression data by clustering and visualizing played a central role in obtaining biological knowledge. Here, we used Pearson's correlation coefficient of multiple-cumulative probabilities (PCC-MCP) of genes to define the similarity of gene expression behaviors. To answer the challenge of the high-dimensional MCPs, we used icc-cluster, a clustering algorithm that obtained solutions by iterating clustering centers, with PCC-MCP to group genes.

The biological knowledge discovery by PCCF measure and PCA-F projection.

In the process of biological knowledge discovery, PCA is commonly used to complement the clustering analysis, but PCA typically gives the poor visualizations for most gene expression data sets. Here, we propose a PCCF measure, and use PCA-F to display clusters of PCCF, where PCCF and PCA-F are modeled from the modified cumulative probabilities of genes. From the analysis of simulated and experimental data sets, we demonstrate that PCCF is more appropriate and reliable for analyzing gene expression data compared to other commonly used distances or similarity measures, and PCA-F is a good visualization technique for identifying clusters of PCCF, where we aim at such data sets that the expression values of genes are collected at different time points.

Mini-clusters with mean probabilities for identifying effective siRNAs.

Background: The distinction between the effective siRNAs and the ineffective ones is in high demand for gene knockout technology. To design effective siRNAs, many approaches have been proposed. Those approaches attempt to classify the siRNAs into effective and ineffective classes but they are difficult to decide the boundary between these two classes.