MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction.

MOTIVATION: Constructing a phylogenetic tree requires calculating the evolutionary distance between samples or species via large-scale resequencing data, a process that is both time-consuming and computationally demanding. Striking the right balance between accuracy and efficiency is a significant challenge. RESULTS: To address this, we introduce a new algorithm, MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303 Zea, 141 Ficus, 67 Oryza, and 43 Saccharum spontaneum samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction. AVAILABILITY AND IMPLEMENTATION: MIKE is publicly available on Github at https://github.com/Argonum-Clever2/mike.git.

Stochastic Analysis of Predator-Prey Models under Combined Gaussian and Poisson White Noise via Stochastic Averaging Method.

In the present paper, the statistical responses of two-special prey-predator type ecosystem models excited by combined Gaussian and Poisson white noise are investigated by generalizing the stochastic averaging method. First, we unify the deterministic models for the two cases where preys are abundant and the predator population is large, respectively. Then, under some natural assumptions of small perturbations and system parameters, the stochastic models are introduced. The stochastic averaging method is generalized to compute the statistical responses described by stationary probability density functions (PDFs) and moments for population densities in the ecosystems using a perturbation technique. Based on these statistical responses, the effects of ecosystem parameters and the noise parameters on the stationary PDFs and moments are discussed. Additionally, we also calculate the Gaussian approximate solution to illustrate the effectiveness of the perturbation results. The results show that the larger the mean arrival rate, the smaller the difference between the perturbation solution and Gaussian approximation solution. In addition, direct Monte Carlo simulation is performed to validate the above results.

Stochastic Dynamics of a Time-Delayed Ecosystem Driven by Poisson White Noise Excitation.

We investigate the stochastic dynamics of a prey-predator type ecosystem with time delay and the discrete random environmental fluctuations. In this model, the delay effect is represented by a time delay parameter and the effect of the environmental randomness is modeled as Poisson white noise. The stochastic averaging method and the perturbation method are applied to calculate the approximate stationary probability density functions for both predator and prey populations. The influences of system parameters and the Poisson white noises are investigated in detail based on the approximate stationary probability density functions. It is found that, increasing time delay parameter as well as the mean arrival rate and the variance of the amplitude of the Poisson white noise will enhance the fluctuations of the prey and predator population. While the larger value of self-competition parameter will reduce the fluctuation of the system. Furthermore, the results from Monte Carlo simulation are also obtained to show the effectiveness of the results from averaging method.

Haplotype-resolved assembly of auto-polyploid genomes via combining Hi-C and gametic data.

Haplotype-resolved genome assembly plays a crucial role in understanding allele-specific functions. However, obtaining haplotype-resolved assembly for auto-polyploid genomes remains challenging. Existing methods can be classified into reference-based phasing, assembly-based phasing, and gamete binning. Nevertheless, there is a lack of cost-effective and efficient methods for haplotyping auto-polyploid genomes. In this study, we propose a novel phasing algorithm called PolyGH, which combines Hi-C and gametic data. We conducted experiments on tetraploid potato cultivars and divided the method into three steps. Firstly, gametic data was utilized to bin non-collapsed contigs, followed by merging adjacent fragments of the same type within the same contig. Secondly, accurate Hi-C signals related to differential genomic regions were acquired using unique k-mers. Finally, collapsed fragments were assigned to haplotigs based on combined Hi-C and gametic signals. Comparing PolyGH with Hi-C-based and gametic data-based methods, we found that PolyGH exhibited superior performance in haplotyping auto-polyploid genomes when integrating both data types. This approach has the potential to enhance haplotype-resolved assembly for auto-polyploid genomes.

Melon ripeness detection by an improved object detection algorithm for resource constrained environments.

BACKGROUND: Ripeness is a phenotype that significantly impacts the quality of fruits, constituting a crucial factor in the cultivation and harvesting processes. Manual detection methods and experimental analysis, however, are inefficient and costly. RESULTS: In this study, we propose a lightweight and efficient melon ripeness detection method, MRD-YOLO, based on an improved object detection algorithm. The method combines a lightweight backbone network, MobileNetV3, a design paradigm Slim-neck, and a Coordinate Attention mechanism. Additionally, we have created a large-scale melon dataset sourced from a greenhouse based on ripeness. This dataset contains common complexities encountered in the field environment, such as occlusions, overlapping, and varying light intensities. MRD-YOLO achieves a mean Average Precision of 97.4% on this dataset, achieving accurate and reliable melon ripeness detection. Moreover, the method demands only 4.8 G FLOPs and 2.06 M parameters, representing 58.5% and 68.4% of the baseline YOLOv8n model, respectively. It comprehensively outperforms existing methods in terms of balanced accuracy and computational efficiency. Furthermore, it maintains real-time inference capability in GPU environments and demonstrates exceptional inference speed in CPU environments. The lightweight design of MRD-YOLO is anticipated to be deployed in various resource constrained mobile and edge devices, such as picking robots. Particularly noteworthy is its performance when tested on two melon datasets obtained from the Roboflow platform, achieving a mean Average Precision of 85.9%. This underscores its excellent generalization ability on untrained data. CONCLUSIONS: This study presents an efficient method for melon ripeness detection, and the dataset utilized in this study, alongside the detection method, will provide a valuable reference for ripeness detection across various types of fruits.

Transcriptome Profiling Reveals the Gene Network Responding to Low Nitrogen Stress in Wheat.

As one of the essential nutrients for plants, nitrogen (N) has a major impact on the yield and quality of wheat worldwide. Due to chemical fertilizer pollution, it has become increasingly important to improve crop yield by increasing N use efficiency (NUE). Therefore, understanding the response mechanisms to low N (LN) stress is essential for the regulation of NUE in wheat. In this study, LN stress significantly accelerated wheat root growth, but inhibited shoot growth. Further transcriptome analysis showed that 8468 differentially expressed genes (DEGs) responded to LN stress. The roots and shoots displayed opposite response patterns, of which the majority of DEGs in roots were up-regulated (66.15%; 2955/4467), but the majority of DEGs in shoots were down-regulated (71.62%; 3274/4565). GO and KEGG analyses showed that nitrate reductase activity, nitrate assimilation, and N metabolism were significantly enriched in both the roots and shoots. Transcription factor (TF) and protein kinase analysis showed that genes such as MYB-related (38/38 genes) may function in a tissue-specific manner to respond to LN stress. Moreover, 20 out of 107 N signaling homologous genes were differentially expressed in wheat. A total of 47 transcriptome datasets were used for weighted gene co-expression network analysis (17,840 genes), and five TFs were identified as the potential hub regulatory genes involved in the response to LN stress in wheat. Our findings provide insight into the functional mechanisms in response to LN stress and five candidate regulatory genes in wheat. These results will provide a basis for further research on promoting NUE in wheat.

CRIA: An Interactive Gene Selection Algorithm for Cancers Prediction Based on Copy Number Variations.

Genomic copy number variations (CNVs) are among the most important structural variations of genes found to be related to the risk of individual cancer and therefore they can be utilized to provide a clue to the research on the formation and progression of cancer. In this paper, an improved computational gene selection algorithm called CRIA (correlation-redundancy and interaction analysis based on gene selection algorithm) is introduced to screen genes that are closely related to cancer from the whole genome based on the value of gene CNVs. The CRIA algorithm mainly consists of two parts. Firstly, the main effect feature is selected out from the original feature set that has the largest correlation with the class label. Secondly, after the analysis involving correlation, redundancy and interaction for each feature in the candidate feature set, we choose the feature that maximizes the value of the custom selection criterion and add it into the selected feature set and then remove it from the candidate feature set in each selection round. Based on the real datasets, CRIA selects the top 200 genes to predict the type of cancer. The experiments' results of our research show that, compared with the state-of-the-art related methods, the CRIA algorithm can extract the key features of CNVs and a better classification performance can be achieved based on them. In addition, the interpretable genes highly related to cancer can be known, which may provide new clues at the genetic level for the treatment of the cancer.