Fast, low-memory detection and localization of large, polymorphic inversions from SNPs

PeerJ

article

Ronald J. Nowling¹  Fabian Fallas-Moya²  Amir Sadovnik²  Scott Emrich²  Matthew Aleck¹  Daniel Leskiewicz¹  John G. Peters¹ 

[1] Electrical Engineering and Computer Science, Milwaukee School of Engineering;Electrical Engineering and Computer Science, University of Tennessee-Knoxville

关键词: Principal component analysis;    Feature hashing;    Chromosomal inversions;    Single nucleotide polymorphisms;   

DOI  :  10.7717/peerj.12831

学科分类：社会科学、人文和艺术（综合）

来源: Inra

【 摘 要 】

Background 1 Mb), polymorphic inversions have substantial impacts on population structure and maintenance of genotypes. These large inversions can be detected from single nucleotide polymorphism (SNP) data using unsupervised learning techniques like PCA. Construction and analysis of a feature matrix from millions of SNPs requires large amount of memory and limits the sizes of data sets that can be analyzed. Methods We propose using feature hashing construct a feature matrix from a VCF file of SNPs for reducing memory usage. The matrix is constructed in a streaming fashion such that the entire VCF file is never loaded into memory at one time. Results When evaluated on Anopheles mosquito and Drosophila fly data sets, our approach reduced memory usage by 97% with minimal reductions in accuracy for inversion detection and localization tasks. Conclusion With these changes, inversions in larger data sets can be analyzed easily and efficiently on common laptop and desktop computers. Our method is publicly available through our open-source inversion analysis software, Asaph.

【 授权许可】

CC BY