Mem-based pangenome indexing for k-mer queries.

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Omar Y Ahmed, Nathaniel K Brown, Stephen Hwang, Katharine M Jenike, Sam Kovaka, Ben Langmead, Michael C Schatz

Ngôn ngữ: eng

Ký hiệu phân loại:

Thông tin xuất bản: England : Algorithms for molecular biology : AMB , 2025

Mô tả vật lý:

Bộ sưu tập: NCBI

ID: 741692

Pangenomes are growing in number and size, thanks to the prevalence of high-quality long-read assemblies. However, current methods for studying sequence composition and conservation within pangenomes have limitations. Methods based on graph pangenomes require a computationally expensive multiple-alignment step, which can leave out some variation. Indexes based on k-mers and de Bruijn graphs are limited to answering questions at a specific substring length k. We present Maximal Exact Match Ordered (MEMO), a pangenome indexing method based on maximal exact matches (MEMs) between sequences. A single MEMO index can handle arbitrary-length queries over pangenomic windows. MEMO enables both queries that test k-mer presence/absence (membership queries) and that count the number of genomes containing k-mers in a window (conservation queries). MEMO's index for a pangenome of 89 human autosomal haplotypes fits in 2.04 GB, 8.8
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH