bioRxiv Science⌕ Search

bioRxiv · 10.1101/341784

A fast mrMLM algorithm for multi-locus genome-wide association studies

Abstract

BackgroundRecent developments in technology result in the generation of big data. In genome-wide association studies (GWAS), we can get tens of million SNPs that need to be tested for association with a trait of interest. Indeed, this poses a great computational challenge. There is a need for developing fast algorithms in GWAS methodologies. These algorithms must ensure high power in QTN detection, high accuracy in QTN estimation and low false positive rate.\n\nResultsHere, we accelerated mrMLM algorithm by using GEMMA idea, matrix transformations and identities. The target functions and derivatives in vector/matrix forms for each marker scanning are transformed into some simple forms that are easy and efficient to evaluate during each optimization step. All potentially associated QTNs with P-values [≤] 0.01 are evaluated in a multi-locus model by LARS algorithm and/or EM-Empirical Bayes. We call the algorithm FASTmrMLM. Numerical simulation studies and real data analysis validated the FASTmrMLM. FASTmrMLM reduces the running time in mrMLM by more than 50%. FASTmrMLM also shows high statistical power in QTN detection, high accuracy in QTN estimation and low false positive rate as compared to GEMMA, FarmCPU and mrMLM. Real data analysis shows that FASTmrMLM was able to detect more previously reported genes than all the other methods: GEMMA/EMMA, FarmCPU and mrMLM.\n\nConclusionsFASTmrMLM is a fast and reliable algorithm in multi-locus GWAS and ensures high statistical power, high accuracy of estimates and low false positive rate.\n\nAuthor SummaryThe current developments in technology result in the generation of a vast amount of data. In genome-wide association studies, we can get tens of million markers that need to be tested for association with a trait of interest. Due to the computational challenge faced, we developed a fast algorithm for genome-wide association studies. Our approach is a two stage method. In the first step, we used matrix transformations and identities to quicken the testing of each random marker effect. The target functions and derivatives which are in vector/matrix forms for each marker scanning are transformed into some simple forms that are easy and efficient to evaluate during each optimization step. In the second step, we selected all potentially associated SNPs and evaluated them in a multi-locus model. From simulation studies, our algorithm significantly reduces the computing time. The new method also shows high statistical power in detecting significant markers, high accuracy in marker effect estimation and low false positive rate. We also used the new method to identify relevant genes in real data analysis. We recommend our approach as a fast and reliable method for carrying out a multi-locus genome-wide association study.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhang, Y.-M., Tamba, C. L.. 2018-06-07. A fast mrMLM algorithm for multi-locus genome-wide association studies. https://doi.org/10.1101/341784

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

VIGAT: VLM-guided gene activity quantification from single-cell ATAC-seq

Summary: Gene activity quantification from single-cell ATAC-seq is challenging because genomic regions informative of cell identity can vary across genes and tissues, while broadly accessible regions may provide limited cell-type-discriminative information. We developed VIGAT, a vision-language model (VLM)-guided tool that automates visual interpretation of ATAC coverage plots for adaptive gene activity quantification. VIGAT jointly examines accessibility patterns across multiple marker genes, integrating genomic annotations and biological context to select gene-specific regions enriched for cluster-discriminative signals. Selected regions are used to generate a gene-by-cell activity matrix. Across 196 paired single-cell RNA-seq and ATAC-seq datasets, VIGAT outperformed five existing methods in recovering marker-associated accessibility enriched in the corresponding cell populations, demonstrating the utility of VLM-guided visual reasoning for scalable gene activity quantification. Availability and implementation: VIGAT is implemented as an open-source R package and is freely available at https://github.com/beijie02/VIGAT.

bioinformatics↗

Improving real-time search through deep learning-enhanced fragment ion indexing

The fragment ion indexed database searching approach enables highly efficient tandem mass spectrometry database searches, including real-time search workflows. However, the index can require tens of gigabytes of memory, often exceeding the free memory available on instrument acquisition computers running the search. This restricts the size of the searchable database, the variable modification space, and the number of searches that can run concurrently. To address this problem, we developed an index-pruning pipeline within the Comet database search tool using Carafe, a deep learning tool that predicts fragment ion intensities based on peptide sequences. In our approach, only fragment ion positions that are predicted to be observable are written in the index, eliminating entries that are unlikely to contribute to spectrum detection. We evaluated this approach on two search spaces in three index configurations to demonstrate that masking significantly reduced the number of fragment ion index entries and, consequently, peak search memory use. Masked searches were also faster than unmasked searches and identified a comparable number of peptide-spectrum matches. Because all prediction and masking steps are performed before searching, their cost is amortized across repeated, future searches of the same database and modification configuration, introducing no per-spectrum search overhead. The complete implementation is open source with an Apache license.

bioinformatics↗

FastaGuard: FASTA preflight QC for modern bioinformatics pipelines

Summary: FastaGuard is a streaming, explainable FASTA preflight QC tool that validates assembly FASTA files, detects structural and composition red flags, and emits a versioned multi-format report with an explicit pipeline gate before expensive downstream analysis. We evaluated v1.1.0 in four analyses whose design was fixed before data collection. On 700 public NCBI assemblies the pipeline gate stopped 19.7% (1.9% weighted to the population), always on its high-N rule and mostly in scaffold-level genomes; the NCBI submission gate stopped 2.0%, and an independent recount confirmed every stop. Among 1,040 faults injected into real assemblies, the NCBI gate flagged 520 of 520 in 13 error classes (table2asn: 280 at error level) and blocked none of 120 benign changes. Across seven downstream tools, 46 of 182 defect cells failed and 12 altered the records without a warning, all in classes the pipeline gate blocks. Stopping a mismatched reference at the gate avoided about 54-62 s of mapping and sorting at a cost of 0.05-0.06 s. Availability and Implementation: Source code and documentation are freely available under the MIT license at https://github.com/ehsanestaji/FastaGuard (release tag v1.1.0: https://github.com/ehsanestaji/FastaGuard/releases/tag/v1.1.0; archived at doi:10.5281/zenodo.23728753). Install via Bioconda (mamba install -c conda-forge -c bioconda fastaguard=1.1.0), BioContainers, or GitHub release binaries. Implemented in Rust; supported on Linux and macOS, including Bioconda builds for linux-64, linux-aarch64, osx-64, and osx-arm64. Contact: ehsan.estaji@umu.se; jianfeng.mao@umu.se Supplementary information: Supplementary Note (designs, all results, deviations from the pre-registered protocol); scripts, manifests and result tables at Zenodo, doi:10.5281/zenodo.23729530.

bioinformatics↗