Discovering Genetic Ancestry Using Spectral Graph Theory

被引:77
|
作者
Lee, Ann B. [1 ]
Luca, Diana [1 ]
Klei, Lambertus [2 ]
Devlin, Bernie [2 ]
Roeder, Kathryn [1 ]
机构
[1] Carnegie Mellon Univ, Dept Stat, Pittsburgh, PA 15213 USA
[2] Univ Pittsburgh, Sch Med, Dept Psychiat, Pittsburgh, PA USA
关键词
eigenanalysis; genome-wide association; principal component analysis; population structure; POPULATION; ASSOCIATION; DISEASE;
D O I
10.1002/gepi.20434
中图分类号
Q3 [遗传学];
学科分类号
071007 ; 090102 ;
摘要
As one approach to uncovering the genetic underpinnings of complex disease, individuals are measured at a large number of genetic variants (usually SNPs) across the genome and these SNP genotypes are assessed for association with disease status. We propose a new statistical method called Spectral-GEM for the analysis of genome-wide association studies; the goal of Spectral-GEM is to quantify the ancestry of the sample from such genotypic data. Ignoring structure due to differential ancestry can lead to an excess of spurious findings and reduce power. Ancestry is commonly estimated using the eigenvectors derived from principal component analysis (PCA). To develop an alternative to PCA we draw on connections between multidimensional scaling and spectral graph theory. Our approach, based on a spectral embedding derived from the normalized Laplacian of a graph, can produce more meaningful delineation of ancestry than by using PCA. Often the results from Spectral-GEM are straightforward to interpret and therefore useful in association analysis. We illustrate the new algorithm with an analysis of the POPRES data [Nelson et al., 2008]. Genet. Epiderniol. 34:51-59, 2010. (c) 2009 Wiley-Liss, Inc.
引用
收藏
页码:51 / 59
页数:9
相关论文
共 50 条
  • [1] A SPECTRAL GRAPH APPROACH TO DISCOVERING GENETIC ANCESTRY
    Lee, Ann B.
    Luca, Diana
    Roeder, Kathryn
    [J]. ANNALS OF APPLIED STATISTICS, 2010, 4 (01): : 179 - 202
  • [2] Graph Structure Similarity using Spectral Graph Theory
    Crawford, Brian
    Gera, Ralucca
    House, Jeffrey
    Knuth, Thomas
    Miller, Ryan
    [J]. COMPLEX NETWORKS & THEIR APPLICATIONS V, 2017, 693 : 209 - 221
  • [3] Nodal ordering using graph theory and a genetic algorithm
    Bondarabady, HAR
    Kaveh, A
    [J]. FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2004, 40 (9-10) : 1271 - 1280
  • [4] Faces Selection in Images Using the Spectral Graph Theory and Constraints
    Zakharov, A.
    Barinov, A.
    Zhiznyakov, A.
    [J]. 2017 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING, APPLICATIONS AND MANUFACTURING (ICIEAM), 2017,
  • [5] Solving Large Optimization Problems using Spectral Graph Theory
    Miller, Gary L.
    [J]. STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 981 - 981
  • [6] Identifying network structure similarity using spectral graph theory
    Gera R.
    Alonso L.
    Crawford B.
    House J.
    Mendez-Bermudez J.A.
    Knuth T.
    Miller R.
    [J]. Applied Network Science, 3 (1)
  • [7] Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph
    Hogben, L
    [J]. ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2005, 14 : 12 - 31
  • [8] Optimizing Pinning Control of Directed Networks Using Spectral Graph Theory
    Xu, Xuanhong
    Liu, Hui
    Lu, Jun-An
    Xu, Jiangqiao
    [J]. INTELLIGENT ROBOTICS AND APPLICATIONS (ICIRA 2018), PT I, 2018, 10984 : 59 - 70
  • [9] Pinning Control of Multiplex Dynamical Networks Using Spectral Graph Theory
    Liu, Hui
    Li, Jie
    Zhao, Junhao
    Wu, Xiaoqun
    Zeng, Zhigang
    Lu, Jinhu
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2024, 54 (09) : 5309 - 5322
  • [10] On Two Conjectures of Spectral Graph Theory
    Kinkar Ch. Das
    Muhuo Liu
    [J]. Bulletin of the Iranian Mathematical Society, 2018, 44 : 43 - 51