HLHanbin Lee

Hanbin Lee

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Hanbin Lee has a total of 68 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Population-scale ancestral recombination graphs with tskit 1.0

    by Ben Jeffery, Yan Wong, Kevin Thornton, Georgia Tsambos, Gertjan Bisschop, Yun Deng, E. Castedo Ellerman, Thomas B. Forest, Halley Fritze, Daniel Goldstein, et al.

  • Open Access

    Linkage disequilibrium moderates how evolving genetic background shapes variant-level architecture

    by Hanbin Lee, Jonathan Terhorst

    Evolutionary theory offers a unifying explanation for the genetics of complex traits and diseases by modeling how a trait and its genetic basis are maintained by evolutionary forces. A growing body of evidence suggests that linkage disequilibrium (LD) couples a variant’s evolution to that of the genetic background it resides on. However, widely used single-variant theories omit this coupling between variants and the background, or hold the background fixed. We close this gap by developing a model of linkage LD evolution accounting for stabilizing selection, recombination, and genetic drift. The model deduces the genetic architecture of individual variants subject to the co-evolving genetic background. More efficient selection in larger populations is partially offset by slower decay of existing LD and increased generation of new LD. Conversely, noisier LD in smaller populations exposes the variants to episodes of stronger selection. We ask whether ancestry differences in the relationship between effect-size magnitude and minor allele frequency require different selection strengths or can arise from differences in demographic history alone. Stabilizing selection needs to be more than three times stronger in Africans than in Europeans under the constant-size demography, whereas an Out-of-Africa demography alone can explain most of the observed frequency-dependence gap. As this example indicates, selection strength is in general not identifiable from the frequency–effect-size relationship alone, because different combinations of selection and demographic history can produce the same pattern in data with further redundancy added by LD.

  • Parameterizing the genetic architecture under stabilizing selection

    by Hanbin Lee, Jonathan Terhorst

    Across many complex traits, genetic variants with larger effect sizes tend to occur at lower frequencies, which is often interpreted as a signature of stabilizing selection. In statistical genetics, the so-called α-model captures this relationship by assuming that effect size variance is inversely proportional to heterozygosity raised to a power 0≤α≤1. Although empirically useful, the α-model is phenomenological rather than mechanistic and lacks a direct population genetic interpretation. In this paper, we derive an alternative to the α-model based on evolutionary theory. Our approach yields a linear mixed model in which frequency dependence emerges naturally as a function of interpretable evolutionary quantities describing mutational variance, selection intensity, and coupling between the focal and selected traits. These quantities enter through 2 identifiable variance components that can be estimated by restricted maximum likelihood. The resulting framework links a fitness landscape model to standard mixed-model methodology, enabling both inference on evolutionary parameters and downstream prediction by best linear unbiased prediction. In forward simulations, the model accurately recovers the focal-trait variance and generally improves genetic prediction relative to conventional α-model baselines.


  • Open Access

    Genetic prediction with ARG-powered linear algebra

    by Hanbin Lee, Nathaniel S Pope, Jerome Kelleher, Gregor Gorjanc, Peter L Ralph

    Ancestral recombination graphs (ARGs) are an attractive means for quantitative genetic analysis of complex traits because they encode the realized genetic relatedness between a sample of individuals in the presence of genetic drift, recombination, and mutation. Data structures for efficiently storing ARGs can also be used to rapidly process millions of genomes and are thus promising for fitting linear mixed models to large phenotype and genome datasets. Here, we study the problems of variance component estimation and prediction of genetic values with ARGs, by describing a generative model of complex traits with additive effects on an ARG and then developing algorithms that use the ARG to solve these problems efficiently on biobank-scale datasets. We observe nearly linear scaling of runtime with sample size, which is achieved by using the succinct tree sequence representation of the ARG for implicit matrix-vector products, along with modern randomized linear algebra algorithms. We estimate variance components using restricted maximum likelihood, which we find performs substantially better than the Haseman--Elston method. In simulation tests, both variance component estimation and prediction of genetic values (using the best linear unbiased predictor) perform nearly as well with inferred ARGs as with true ARGs. We also discuss interpretations of the variance component estimates as mutational variance and additive genetic variance. We provide an implementation of the algorithms as a Python package tslmm, which leverages the tree sequence library tskit.


  • Open Access

    Parameterizing the genetic architecture under stabilizing selection

    by Hanbin Lee, Jonathan Terhorst

    Across many complex traits, genetic variants with larger effect sizes tend to occur at lower frequencies, which is often interpreted as a signature of stabilizing selection. In statistical genetics, the so-called α -model captures this relationship by assuming that effect size variance is inversely proportional to heterozygosity raised to a power 0 ⩽ α ⩽ 1. Although empirically useful, the α -model is phenomenological rather than mechanistic and lacks a direct population-genetic interpretation. In this paper, we derive an alternative to the α -model based on evolutionary theory. Our approach yields a linear mixed model in which the frequency dependence of effect size emerges naturally as a function of interpretable evolutionary quantities describing mutational variance, selection intensity, and coupling between the focal and selected traits. These quantities enter through two identifiable variance components that can be estimated by restricted maximum likelihood (REML). The resulting framework links a fitness-landscape model to standard mixed-model methodology, enabling both inference on evolutionary parameters and downstream prediction by best linear unbiased prediction (BLUP). In forward simulations, the model accurately recovers the focal-trait variance and generally improves genetic prediction relative to conventional α -model baselines.

  • Open Access

    On ARGs, pedigrees, and genetic relatedness matrices

    by Brieuc Lehmann, Hanbin Lee, Luke Anderson-Trocmé, Jerome Kelleher, Gregor Gorjanc, Peter L Ralph

    Genetic relatedness is a central concept in genetics, underpinning studies of population and quantitative genetics in human, animal, and plant settings. It is typically stored as a genetic relatedness matrix, whose elements are pairwise relatedness values between individuals. This relatedness has been defined in various contexts based on pedigree, genotype, phylogeny, coalescent times, and, recently, ancestral recombination graph. For some downstream applications, including association studies, using ancestral recombination graph-based genetic relatedness matrices has led to better performance relative to the genotype genetic relatedness matrix. However, they present computational challenges due to their inherent quadratic time and space complexity. Here, we first discuss the different definitions of relatedness in a unifying context, making use of the additive model of a quantitative trait to provide a definition of “branch relatedness” and the corresponding “branch genetic relatedness matrix”. We explore the relationship between branch relatedness and pedigree relatedness (i.e. kinship) through a case study of French–Canadian individuals that have a known pedigree. Through the tree sequence encoding of an ancestral recombination graph, we then derive an efficient algorithm for computing products between the branch genetic relatedness matrix and a general vector, without explicitly forming the branch genetic relatedness matrix. This algorithm leverages the sparse encoding of genomes with the tree sequence and hence enables large-scale computations with the branch genetic relatedness matrix. We demonstrate the power of this algorithm by developing a randomized principal components algorithm for tree sequences that easily scales to millions of genomes. All algorithms are implemented in the open source tskit Python package. Taken together, this work consolidates the different notions of relatedness as branch relatedness and, by leveraging the tree sequence encoding of an ancestral recombination graph, provides efficient algorithms that enable computations with the branch genetic relatedness matrix that scale to mega-scale genomic datasets.


  • Open Access

    Genetic prediction with ARG-powered linear algebra

    by Hanbin Lee, Nathaniel S. Pope, Jerome Kelleher, Gregor Gorjanc, Peter L. Ralph

    Ancestral recombination graphs (ARGs) are an attractive means for quantitative genetic analysis of complex traits because they encode the realized genetic relatedness between a sample of individuals in the presence of genetic drift, recombination, and mutation. Data structures for efficiently storing ARGs can also be used to rapidly process millions of genomes, and are thus promising for fitting linear mixed models (LMMs) to large phenotype and genome datasets. Here, we study the problems of variance component estimation and prediction of genetic values with ARGs, by describing a generative model of complex traits with additive effects on an ARG, and then developing algorithms that use the ARG to solve these problems efficiently on biobank-scale datasets. We observe nearly linear scaling of runtime with sample size, which is achieved by using the succinct tree sequence representation of the ARG for implicit matrix-vector products, along with modern randomized linear algebra algorithms. We estimate variance components using restricted maximum likelihood (REML), which we find performs substantially better than the Haseman– Elston method. In simulation tests, both variance component estimation and prediction of genetic values (using the best linear unbiased predictor, BLUP) perform nearly as well with inferred ARGs as with true ARGs. We also discuss interpretations of the variance component estimates as mutational variance and additive genetic variance. We provide an implementation of the algorithms as a Python package tslmm, which leverages the tree sequence library tskit.


  • Open Access

    On ARGs, pedigrees, and genetic relatedness matrices

    by Brieuc Lehmann, Hanbin Lee, Luke Anderson-Trocmé, Jerome Kelleher, Gregor Gorjanc, Peter L. Ralph

    Genetic relatedness is a central concept in genetics, underpinning studies of population and quantitative genetics in human, animal, and plant settings. It is typically stored as a genetic relatedness matrix (GRM), whose elements are pairwise relatedness values between individuals. This relatedness has been defined in various contexts based on pedigree, genotype, phylogeny, coalescent times, and, recently, ancestral recombination graph (ARG). ARG-based GRMs have been found to better capture the structure of a population and improve association studies relative to the genotype GRM. However, calculating GRMs and further operations with them is fundamentally challenging due to inherent quadratic time and space complexity. Here, we first discuss the different definitions of relatedness in a unifying context, making use of the additive model of a quantitative trait to provide a definition of “branch relatedness” and the corresponding “branch GRM”. We explore the relationship between branch relatedness and pedigree relatedness through a case study of French-Canadian individuals that have a known pedigree. Through the tree sequence encoding of an ARG, we then derive an efficient algorithm for computing products between the branch GRM and a general vector, without explicitly forming the branch GRM. This algorithm leverages the sparse encoding of genomes with the tree sequence and hence enables large-scale computations with the branch GRM. We demonstrate the power of this algorithm by developing a randomized principal components algorithm for tree sequences that easily scales to millions of genomes. All algorithms are implemented in the open source tskit Python package. Taken together, this work consolidates the different notions of relatedness as branch relatedness and by leveraging the tree sequence encoding of an ARG it provides efficient algorithms that enable computations with the branch GRM that scale to mega-scale genomic datasets.


  • Open Access

    Pseudobulk with proper offsets has the same statistical properties as generalized linear mixed models in single-cell case-control studies

    by Hanbin Lee, Buhm Han

    Motivation: Generalized linear mixed models (GLMMs), such as the negative-binomial or Poisson linear mixed model, are widely applied to single-cell RNA sequencing data to compare transcript expression between different conditions determined at the subject level. However, the model is computationally intensive, and its relative statistical performance to pseudobulk approaches is poorly understood. Results: We propose offset-pseudobulk as a lightweight alternative to GLMMs. We prove that a count-based pseudobulk equipped with a proper offset variable has the same statistical properties as GLMMs in terms of both point estimates and standard errors. We confirm our findings using simulations based on real data. Offset-pseudobulk is substantially faster (>×10) and numerically more stable than GLMMs. Availability and implementation: Offset pseudobulk can be easily implemented in any generalized linear model software by tweaking a few options. The codes can be found at https://github.com/hanbin973/pseudobulk_is_mm.


  • Open Access

    Admixed and single-continental genome segments of the same ancestry have distinct linkage disequilibrium patterns

    by Hanbin Lee, Moo Hyuk Lee, Kangcheng Hou, Bogdan Pasaniuc, Buhm Han

    Background: Admixed populations offer valuable insight into the genetic architecture of complex traits. Many studies have proposed methods for genome-wide association study (GWAS) in admixed populations and various simulation studies have evaluated their performances. In this work, we propose another direction of comparison of recently proposed methods for admixed GWAS from a population genetic viewpoint. Results: Our theoretical approach mathematically and directly compares the power of methods given that the causal variant is tested. This is done by deriving the variance formula of the methods from the population genetic admixture model. Our results analytically confirm previous observation that the standard GWAS test is more powerful than alternative tests due to leveraging allele frequency heterogeneity in which alternatives do not. As a by-product, we obtain a simple method to improve the power of multi-degrees-of-freedom tests only using summary statistics. We further investigate the problem when the causal variant is not directly known but is detected by tagging variants in linkage disequilibrium (LD). The analysis shows that a genetic segment from admixed genomes may exhibit distinct LD patterns from the single-continental counterpart of the same ancestry. Conclusions: While the classic admixture model is successful in predicting GWAS power, its popular extension in the literature falls short in explaining the LD patterns found in simulations and real data, warranting an improved model for LD in admixed genomes.