Details

Autor(en) / Beteiligte

• SHABALIN, Andrey A

Titel

Matrix eQTL: ultra fast eQTL analysis via large matrix operations

Ist Teil von

• Bioinformatics (Oxford, England), 2012-05, Vol.28 (10), p.1353-1358

Ort / Verlag

Oxford: Oxford University Press

Erscheinungsjahr

2012

Link zum Volltext

Quelle

EZB-FREE-00999 freely available EZB journals

Beschreibungen/Notizen

• Expression quantitative trait loci (eQTL) analysis links variations in gene expression levels to genotypes. For modern datasets, eQTL analysis is a computationally intensive task as it involves testing for association of billions of transcript-SNP (single-nucleotide polymorphism) pair. The heavy computational burden makes eQTL analysis less popular and sometimes forces analysts to restrict their attention to just a small subset of transcript-SNP pairs. As more transcripts and SNPs get interrogated over a growing number of samples, the demand for faster tools for eQTL analysis grows stronger. We have developed a new software for computationally efficient eQTL analysis called Matrix eQTL. In tests on large datasets, it was 2-3 orders of magnitude faster than existing popular tools for QTL/eQTL analysis, while finding the same eQTLs. The fast performance is achieved by special preprocessing and expressing the most computationally intensive part of the algorithm in terms of large matrix operations. Matrix eQTL supports additive linear and ANOVA models with covariates, including models with correlated and heteroskedastic errors. The issue of multiple testing is addressed by calculating false discovery rate; this can be done separately for cis- and trans-eQTLs.