The new technology of single-cell RNA sequencing (scRNA-seq) can yield valuable insights into gene expression and give critical information about the cellular compositions of complex tissues. In recent years, vast numbers of scRNA-seq datasets have been generated and made publicly available, and this has enabled researchers to train supervised machine learning models for predicting or classifying various cell-level phenotypes. This has led to the development of many new methods for analyzing scRNA-seq data. Despite the popularity of such applications, there has as yet been no systematic investigation of the performance of these supervised algorithms using predictors from various sizes of scRNA-seq datasets. In this study, 13 popular supervised machine learning algorithms for cell phenotype classification were evaluated using published real and simulated datasets with diverse cell sizes. This benchmark comprises two parts. In the first, real datasets were used to assess the computing speed and cell phenotype classification performance of popular supervised algorithms. The classification performances were evaluated using the area under the receiver operating characteristic curve, F1-score, Precision, Recall, and false-positive rate. In the second part, we evaluated gene-selection performance using published simulated datasets with a known list of real genes. The results showed that ElasticNet with interactions performed the best for small and medium-sized datasets. The NaiveBayes classifier was found to be another appropriate method for medium-sized datasets. With large datasets, the performance of the XGBoost algorithm was found to be excellent. Ensemble algorithms were not found to be significantly superior to individual machine learning methods. Including interactions in the ElasticNet algorithm caused a significant performance improvement for small datasets. The linear discriminant analysis algorithm was found to be the best choice when speed is critical; it is the fastest method, it can scale to handle large sample sizes, and its performance is not much worse than the top performers.
MYH3 is a major contractile protein which converts chemical energy into mechanical energy through the ATP hydrolysis. MYH3 is mainly expressed in the skeletal muscle in different stages especially embryonic period, and it has a role in the development of skeletal muscle and heart. In this study, polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) was applied to analyze the genetic variations of the MYH3 gene and verify the effect on growth and carcass traits in a total of 365 Qinchuan cattles. The PCR product was digested with some restriction enzyme and demonstrated the polymorphism in the population, the single nucleotide polymorphisms (SNPs) at nucleotides g. +1215T>C, g. +3377C>T, and g. +28625C>T were in linkage disequilibrium with each other. The result of haplotype analysis showed that nineteen different haplotypes were identified among the five SNPs. The statistical analyses indicated that the five SNPs were significant association with growth and carcass traits (P < 0.05, N = 365); whereas the five SNPs were no significant association between 18 combined genotypes of MYH3 gene and growth and carcass traits. Taken together, our results provide the evidence that polymorphisms in MYH3 are associated with growth and carcass traits in Qinchuan cattle, and may be used as a possible candidate for marker-assisted selection and management in beef cattle breeding program.
Performance evaluation of cloud computing systems studies the relationships among system configuration, system load, and performance indicators. However, such evaluation is not feasible by dint of measurement methods or simulation methods, due to the properties of cloud computing, such as large scale, diversity, and dynamics. To overcome those challenges, we present a novel Dynamic Scalable Stochastic Petri Net (DSSPN) to model and analyze the performance of cloud computing systems. DSSPN can not only clearly depict system dynamic behaviors in an intuitive and efficient way but also easily discover performance deficiencies and bottlenecks of systems. In this study, we further elaborate some properties of DSSPN. In addition, we improve fair scheduling taking into consideration job diversity and resource heterogeneity. To validate the improved algorithm and the applicability of DSSPN, we conduct extensive experiments through Stochastic Petri Net Package (SPNP). The performance results show that the improved algorithm is better than fair scheduling in some key performance indicators, such as average throughput, response time, and average completion time.