bioRxiv Science⌕ Search

Biology subjects

Kazemi, P.

Publications and source records attributed to Kazemi, P..

3 recordsLinked to original sources

Human ancestry inference at scale, from genomic data

Ancestry information is essential to large cohort studies, yet it is often unavailable or inconsistently measured. For studies with a genome sequencing component, current ancestry prediction approaches are hindered by high computational demands and complex input requirements. We present ntRoot, a computationally-lightweight method for inferring human super-population-level ancestry from whole genome assemblies or raw short or long sequencing data. Utilizing an alignment-free variant detection framework, ntRoot employs a succinct Bloom filter data structure to efficiently query diverse genomic data inputs. Demonstrated on over 600 human genome sequencing datasets--including complete genomes, draft assemblies, and over 280 independently-generated datasets--ntRoot accurately predicts geographic labels, a descriptor of human populations, and shows high concordance with traditional methods such as ADMIXTURE (R2 = 0.9567) when predicting ancestry fractions. It achieves these predictions within 30 minutes for complete and draft genomes and within 1 hour and 15 minutes for 30X sequencing data, using a maximum of 13GB and 68GB of RAM, respectively. ntRoot offers both global and local ancestry inference, delivering high-resolution predictions across genomic loci. This paradigm fills a critical gap in cohort studies by enabling rapid, resource-efficient, and accurate ancestry inference at scale, advancing the characterization of continental-level ancestry in the genomic era. Author SummaryStudy concept: RLW. Software implementation: RLW, LC, JW, PK. Data analysis: RLW, LC. Manuscript development: RLW, LC. Manuscript editing: RLW, LC, JW, PK, IB. Funding acquisition: IB.

genetics↗

Multi-genome synteny detection using minimizer graph mappings

In recent years, the landscape of reference-grade genome assemblies has seen substantial diversification. With such rich data, there is pressing demand for robust tools for scalable, multi-species comparative genomics analyses, including detecting genome synteny, which informs on the sequence conservation between genomes and contributes crucial insights into species evolution. Here, we introduce ntSynt, a scalable utility for computing large-scale multi-genome synteny blocks using a minimizer graph-based approach. Through extensive testing utilizing multiple [~]3 Gbp genomes, we demonstrate how ntSynt produces synteny blocks with coverages between 79-100% in at most 2h using 34 GB of memory, even for genomes with appreciable (>15%) sequence divergence. Compared to existing state-of-the-art methodologies, ntSynt offers enhanced flexibility to diverse input genome sequences and synteny block granularity. We expect the macrosyntenic genome analyses facilitated by ntSynt will have broad utility in generating critical evolutionary insights within and between species across the tree of life.

bioinformatics↗

aaHash: recursive amino acid sequence hashing

MotivationK-mer hashing is a common operation in many foundational bioinformatics problems. However, generic string hashing algorithms are not optimized for this application. Strings in bioinformatics use specific alphabets, a trait leveraged for nucleic acid sequences in earlier work. We note that amino acid sequences, with complexities and context that cannot be captured by generic hashing algorithms, can also benefit from a domain-specific hashing algorithm. Such a hashing algorithm can accelerate and improve the sensitivity of bioinformatics applications developed for protein sequences. ResultsHere, we present aaHash, a recursive hashing algorithm tailored for amino acid sequences. This algorithm utilizes multiple hash levels to represent biochemical similarities between amino acids. aaHash performs [~]10X faster than generic string hashing algorithms in hashing adjacent k-mers. Availability and implementationaaHash is available online at https://github.com/bcgsc/btllib and is free for academic use.

bioinformatics↗