Skip to main navigation Skip to search Skip to main content

KruX: Matrix-based non-parametric eQTL discovery

  • Jianlong Qi
  • , Hassan F. Asl
  • , Johan Björkegren
  • , Tom Michoel

Research output: Contribution to journalArticlepeer-review

22 Scopus citations

Abstract

Background: The Kruskal-Wallis test is a popular non-parametric statistical test for identifying expression quantitative trait loci (eQTLs) from genome-wide data due to its robustness against variations in the underlying genetic model and expression trait distribution, but testing billions of marker-trait combinations one-by-one can become computationally prohibitive.Results: We developed kruX, an algorithm implemented in Matlab, Python and R that uses matrix multiplications to simultaneously calculate the Kruskal-Wallis test statistic for several millions of marker-trait combinations at once. KruX is more than ten thousand times faster than computing associations one-by-one on a typical human dataset. We used kruX and a dataset of more than 500k SNPs and 20k expression traits measured in 102 human blood samples to compare eQTLs detected by the Kruskal-Wallis test to eQTLs detected by the parametric ANOVA and linear model methods. We found that the Kruskal-Wallis test is more robust against data outliers and heterogeneous genotype group sizes and detects a higher proportion of non-linear associations, but is more conservative for calling additive linear associations.Conclusion: kruX enables the use of robust non-parametric methods for massive eQTL mapping without the need for a high-performance computing infrastructure and is freely available from http://krux.googlecode.com.

Original languageEnglish
Article number11
JournalBMC Bioinformatics
Volume15
Issue number1
DOIs
StatePublished - 14 Jan 2014
Externally publishedYes

Keywords

  • Matrix algebra
  • Non-parametric methods
  • Software
  • eQTL

Fingerprint

Dive into the research topics of 'KruX: Matrix-based non-parametric eQTL discovery'. Together they form a unique fingerprint.

Cite this