A note on the simultaneous computation of thousands of Pearson’s Chi^2-statistics
dc.contributor.author | Schwender, Holger | |
dc.date.accessioned | 2007-07-13T11:55:48Z | |
dc.date.available | 2007-07-13T11:55:48Z | |
dc.date.issued | 2007-07-13T11:55:48Z | |
dc.description.abstract | In genetic association studies, important and common goals are the identification of single nucleotide polymorphisms (SNPs) showing a distribution that differs between several groups and the detection of SNPs with a coherent pattern. In the former situation, tens of thousands of SNPs should be tested, whereas in the latter case typically several ten SNPs are considered leading to thousands of statistics that need to be computed. A test statistic appropriate for both goals is Pearson’s Chi^2-statistic. However, computing this (or another) statistic for each SNP or pair of SNPs separately is very time-consuming. In this article, we show how simple matrix computation can be employed to calculate the Chi^2-statistic for all SNPs simultaneously. | en |
dc.identifier.uri | http://hdl.handle.net/2003/24435 | |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-14818 | |
dc.language.iso | en | de |
dc.subject | Genetic association study | en |
dc.subject | Matrix computation | en |
dc.subject | Pearson' s Chi^2-statistics | en |
dc.subject | Single nucleotide polymorphism | en |
dc.subject | SNP | de |
dc.subject.ddc | 004 | |
dc.title | A note on the simultaneous computation of thousands of Pearson’s Chi^2-statistics | en |
dc.type | Text | de |
dc.type.publicationtype | report | en |
dcterms.accessRights | open access |