scholarly journals FastSKAT: Sequence kernel association tests for very large sets of markers

2016 ◽  
Author(s):  
Thomas Lumley ◽  
Jennifer Brody ◽  
Gina Peloso ◽  
Alanna Morrison ◽  
Kenneth Rice

AbstractThe Sequence Kernel Association Test (SKAT) is widely used to test for associations between a phenotype and a set of genetic variants, that are usually rare. Evaluating tail probabilities or quantiles of the null distribution for SKAT requires computing the eigenvalues of a matrix related to the genotype covariance between markers. Extracting the full set of eigenvalues of this matrix (an n × n matrix, for n subjects) has computational complexity proportional to n3. As SKAT is often used when n > 104, this step becomes a major bottleneck in its use in practice. We therefore propose fastSKAT, a new computationally-inexpensive but accurate approximations to the tail probabilities, in which the k largest eigenvalues of a weighted genotype covariance matrix or the largest singular values of a weighted genotype matrix are extracted, and a single term based on the Satterthwaite approximation is used for the remaining eigenval-ues. While the method is not particularly sensitive to the choice of k, we also describe how to choose its value, and show how fastSKAT can automatically alert users to the rare cases where the choice may affect results. As well as providing faster implementation of SKAT, the new method also enables entirely new applications of SKAT, that were not possible before; we give examples grouping variants by topologically assisted domains, and comparing chromosome-wide association by class of histone marker.

PLoS Genetics ◽  
2020 ◽  
Vol 16 (12) ◽  
pp. e1009218
Author(s):  
Debashree Ray ◽  
Nilanjan Chatterjee

There is increasing evidence that pleiotropy, the association of multiple traits with the same genetic variants/loci, is a very common phenomenon. Cross-phenotype association tests are often used to jointly analyze multiple traits from a genome-wide association study (GWAS). The underlying methods, however, are often designed to test the global null hypothesis that there is no association of a genetic variant with any of the traits, the rejection of which does not implicate pleiotropy. In this article, we propose a new statistical approach, PLACO, for specifically detecting pleiotropic loci between two traits by considering an underlying composite null hypothesis that a variant is associated with none or only one of the traits. We propose testing the null hypothesis based on the product of the Z-statistics of the genetic variants across two studies and derive a null distribution of the test statistic in the form of a mixture distribution that allows for fractions of variants to be associated with none or only one of the traits. We borrow approaches from the statistical literature on mediation analysis that allow asymptotic approximation of the null distribution avoiding estimation of nuisance parameters related to mixture proportions and variance components. Simulation studies demonstrate that the proposed method can maintain type I error and can achieve major power gain over alternative simpler methods that are typically used for testing pleiotropy. PLACO allows correlation in summary statistics between studies that may arise due to sharing of controls between disease traits. Application of PLACO to publicly available summary data from two large case-control GWAS of Type 2 Diabetes and of Prostate Cancer implicated a number of novel shared genetic regions: 3q23 (ZBTB38), 6q25.3 (RGS17), 9p22.1 (HAUS6), 9p13.3 (UBAP2), 11p11.2 (RAPSN), 14q12 (AKAP6), 15q15 (KNL1) and 18q23 (ZNF236).


Bernoulli ◽  
2000 ◽  
Vol 6 (2) ◽  
pp. 191 ◽  
Author(s):  
David Siegmund ◽  
Benjamin Yakir

2020 ◽  
Vol XXIII (1) ◽  
pp. 231-235
Author(s):  
Stefania Loredana Nita

Nowadays, cloud computing is an important technology, which is part of our daily lives. Moving to cloud brings some benefits: create new applications, store large sets of data, process large amount of data. Individual users or companies can store own data on cloud (e.g. maritime, environmental protection, physics analysis etc.). An important thing before storing in cloud is that data needs to be encrypted, in order to keep its confidentiality. Among these, users can store encrypted documents on cloud. However, when owner needs a specific document, they should retrieve all documents from cloud, decrypt them, chose the desired document, encrypt again and finally store back encrypted documents on cloud. To avoid these entire steps, a user can choose to work with searchable encryption. This is an encryption technique, where key words (or indexes) are associated to encrypted documents, and when the owner needs a document, he/she only needs to search throw key words and then retrieve the documents that have associated the desired keywords. An important programming paradigm for cloud computing is MapReduce, which allows high scalability on a large number of servers in a cluster. Basically, MapReduce works with (key, value) pairs. In the current study paper, we describe a new technique through which a user can extract encrypted documents stored on cloud servers based on key words, using searchable encryption and MapReduce.


2019 ◽  
Vol 09 (04) ◽  
pp. 2050012 ◽  
Author(s):  
Włodek Bryc ◽  
Jack W. Silverstein

We study largest singular values of large random matrices, each with mean of a fixed rank [Formula: see text]. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It provides a decomposition of the largest [Formula: see text] singular values into the deterministic rate of growth, random centered fluctuations given as explicit linear combinations of the entries of the matrix, and a term negligible in probability. We use this representation to establish asymptotic normality of the largest singular values for random matrices with means that have block structure. We also deduce asymptotic normality for the largest eigenvalues of a random matrix arising in a model of population genetics.


Author(s):  
T. Imura ◽  
S. Maruse ◽  
K. Mihama ◽  
M. Iseki ◽  
M. Hibino ◽  
...  

Ultra high voltage STEM has many inherent technical advantages over CTEM. These advantages include better signal detectability and signal processing capability. It is hoped that it will explore some new applications which were previously not possible. Conventional STEM (including CTEM with STEM attachment), however, has been unable to provide these inherent advantages due to insufficient performance and engineering problems. Recently we have developed a new 1250 kV STEM and completed installation at Nagoya University in Japan. It has been designed to break through conventional engineering limitations and bring about theoretical advantage in practical applications.In the design of this instrument, we exercised maximum care in providing a stable electron probe. A high voltage generator and an accelerator are housed in two separate pressure vessels and they are connected with a high voltage resistor cable.(Fig. 1) This design minimized induction generated from the high voltage generator, which is a high frequency Cockcroft-Walton type, being transmitted to the electron probe.


Sign in / Sign up

Export Citation Format

Share Document