SUMMARY: With the rapid development of long-read sequencing technologies, the era of individual complete genomes is approaching. We have developed wgatools, a cross-platform, ultrafast toolkit that supports a range of whole-genome alignment formats, offering practical tools for conversion, processing, evaluation, and visualization of alignments, thereby facilitating population-level genome analysis and advancing functional and evolutionary genomics. AVAILABILITY AND IMPLEMENTATION: wgatools supports diverse formats and can process, filter, and statistically evaluate alignments, perform alignment-based variant calling, and visualize alignments both locally and genome-wide. Built with Rust for efficiency and safe memory usage, it ensures fast performance and can handle large datasets consisting of hundreds of genomes. wgatools is published as free software under the MIT open-source license, and its source code is freely available at https://github.com/wjwei-handsome/wgatools and https://zenodo.org/records/14882797.

The employment of doubled-haploid (DH) technology in maize has vastly accelerated the efficiency of developing inbred lines. The selection of superior lines has to rely on genotypes with genomic selection (GS) model, rather than phenotypes due to the high expense of field phenotyping. In this work, we implemented 'genome optimization via virtual simulation (GOVS)' using the genotype and phenotype data of 1404 maize lines and their F1 progeny. GOVS simulates a virtual genome encompassing the most abundant 'optimal genotypes' or 'advantageous alleles' in a genetic pool. Such a virtually optimized genome, although can never be developed in reality, may help plot the optimal route to direct breeding decisions. GOVS assists in the selection of superior lines based on the genomic fragments that a line contributes to the simulated genome. The assumption is that the more fragments of optimal genotypes a line contributes to the assembly, the higher the likelihood of the line favored in the F1 phenotype, e.g. grain yield. Compared to traditional GS method, GOVS-assisted selection may avoid using an arbitrary threshold for the predicted F1 yield to assist selection. Additionally, the selected lines contributed complementary sets of advantageous alleles to the virtual genome. This feature facilitates plotting the optimal route for DH production, whereby the fewest lines and F1 combinations are needed to pyramid a maximum number of advantageous alleles in the new DH lines. In summary, incorporation of DH production, GS and genome optimization will ultimately improve genomically designed breeding in maize. Short abstract: Doubled-haploid (DH) technology has been widely applied in maize breeding industry, as it greatly shortens the period of developing homozygous inbred lines via bypassing several rounds of self-crossing. The current challenge is how to efficiently screen the large volume of inbred lines based on genotypes. We present the toolbox of genome optimization via virtual simulation (GOVS), which complements the traditional genomic selection model. GOVS simulates a virtual genome encompassing the most abundant 'optimal genotypes' in a breeding population, and then assists in selection of superior lines based on the genomic fragments that a line contributes to the simulated genome. Availability of GOVS (https://govs-pack.github.io/) to the public may ultimately facilitate genomically designed breeding in maize.

BACKGROUND: Generating chromosome-scale haplotype resolved assembly is important for functional studies. However, current de novo assemblers are either haploid assemblers that discard allelic information, or diploid assemblers that can only tackle genomes of low complexity. RESULTS: Here, Using robust programs, we build a diploid genome assembly pipeline called gcaPDA (gamete cells assisted Phased Diploid Assembler), which exploits haploid gamete cells to assist in resolving haplotypes. We demonstrate the effectiveness of gcaPDA based on simulated HiFi reads of maize genome which is highly heterozygous and repetitive, and real data from rice. CONCLUSIONS: With applicability of coping with complex genomes and fewer restrictions on application than most of diploid assemblers, gcaPDA is likely to find broad applications in studies of eukaryotic genomes.

How to mine the gene regulatory relationship and construct gene regulatory network (GRN) is of utmost interest within the whole biological community, however, which has been consistently a challenging problem since the tremendous complexity in cellular systems. In present work, we construct gene regulatory network using an improved three-phase dependency analysis algorithm (TPDA) Bayesian network learning method, which includes the steps of Drafting, Thickening, and Thinning. In order to solve the problem of learning result is not reliable due to the high order conditional independence test, we use the entropy estimation approach of Gaussian kernel probability density estimator to calculate the (conditional) mutual information between genes. The experiment on the public benchmark data sets show the improved method outperforms the other nine kinds of Bayesian network learning methods when to process the data with large sample size, with small number of discrete values, and the frequency of different discrete values is about same. In addition, the improved TPDA method was further applied on a real large gene expression data set on RNA-seq from a global collection with 368 elite maize inbred lines. Experiment results show it performs better than the original TPDA method and the other nine kinds of Bayesian network learning algorithms significantly.

SUMMARY: CRISPR-Local is a high-throughput local tool for designing single-guide RNAs (sgRNAs) in plants and other organisms that factors in genetic variation and is optimized to generate genome-wide sgRNAs. CRISPR-Local outperforms other sgRNA design tools in the following respects: (i) designing sgRNAs suitable for non-reference varieties; (ii) screening for sgRNAs that are capable of simultaneously targeting multiple genes; (iii) saving computational resources by avoiding repeated calculations from multiple submissions and (iv) running offline, with both command-line and graphical user interface modes and the ability to export multiple formats for further batch analysis or visualization. We have applied CRISPR-Local to 71 public plant genomes, using both CRISPR/Cas9 and CRISPR/cpf1 systems. AVAILABILITY AND IMPLEMENTATION: CRISPR-Local can be freely downloaded from http://crispr.hzau.edu.cn/CRISPR-Local/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.