A Novel Edge Effect Detection Method for Real-Time Cellular Analyzer Using Functional Principal Component Analysis

Efficient, automatic, and optimized portable Raman-spectrum-based pesticide detection system

Raman spectroscopy can be used for accurately detecting pesticides and determining the chemical composition of a pesticide. To facilitate field detection, the present study used a portable Raman spectrometer for analysis. However, this spectrometer was found to be susceptible to noise interference and signal offsets, which increased the difficulty of pesticide identification. The most commonly used algorithm for Raman spectrum identification is principal component analysis (PCA). However, accurate classification often cannot be achieved with PCA because of the offset and noise in the Raman spectrum data. Therefore, in this study, after the collected Raman spectrum data were processed using the small-step, center-weighted moving-average method, these data were employed to train a convolutional neural network (CNN) model for prediction. To optimize the CNN model, the hyperparameters of the CNN were adjusted using various optimization algorithms, and the optimal solution was obtained after multiple iterations. Data preprocessing and architecture training models were then constructed in a self-optimized manner to improve the ability of the algorithm model to handle diverse types of data. Finally, a CNN model optimized using the cat swarm optimization algorithm was developed. This model was trained on 3000 samples containing three pesticides, and its accuracy for pesticide composition identification was discovered to be 89.33%.

Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2

The de Bruijn graph is a key data structure in modern computational genomics, and construction of its compacted variant resides upstream of many genomic analyses. As the quantity of genomic data grows rapidly, this often forms a computational bottleneck. We present Cuttlefish 2, significantly advancing the state-of-the-art for this problem. On a commodity server, it reduces the graph construction time for 661K bacterial genomes, of size 2.58Tbp, from 4.5 days to 17-23 h; and it constructs the graph for 1.52Tbp white spruce reads in approximately 10 h, while the closest competitor requires 54-58 h, using considerably more memory.