Hello. Sign in to personalize your visit. New user? Register now.  
Journal of Computational Biology
Compensating for Unknown Confounders in Microarray Data Analysis Using Filtered Permutations

To cite this article:
Stefanie Scheid, Rainer Spang. Journal of Computational Biology. June 2007, 14(5): 669-681. doi:10.1089/cmb.2007.R009.

Full Text: • PDF for printing (329.4 KB) • PDF w/ links (351.9 KB)


Stefanie Scheid 
Max Planck Institute for Molecular Genetics, Computational Diagnostics Group, Berlin, Germany.
Rainer Spang 
Max Planck Institute for Molecular Genetics, Computational Diagnostics Group, Berlin, Germany.

Permutation of class labels is a common approach in microarray analysis. It is assumed to produce random score distributions, which are not affected by biological differences between samples. However, hidden confounding variables like the genetic background of patients or undetected experimental artifacts leave traces in the expression data contaminating the score distributions obtained from random permutations. While the effects of known confounders can be compensated using established methodology, little is known on how to deal with unknown confounders. We discuss a computational method called permutation filtering, which aims to borrow information across genes to detect and compensate the effects of unknown confounders.

Free first page

This paper was cited by:

Properties of Balanced Permutations
Lucinda K. Southworth, Stuart K. Kim, Art B. Owen
Journal of Computational Biology. Apr 2009, Vol. 16, No. 4: 625-638
Abstract | Full Text PDF | Reprints & Permissions
All articles
Previous Next