Biomedical subjects

Shili Lin

Publications and source records attributed to Shili Lin.

At least 19 recordsLinked to original sources

PubMed2026

A divide and conquer strategy for recapitulating whole genome 3D structure using Hi-C data.

The three dimensional (3D) spatial organization of the genome is closely linked to biological functions and can be captured by Hi-C assays through interrogating genome-wide chromatin interactions. Methodologies for inferring 3D structures from Hi-C data summarized as a two-dimensional (2D) contact matrix can be broadly placed within the paradigms of optimization-based and sampling-based. Many optimization-based methods are capable of constructing whole genome 3D structures but do not account for spatial dependency in the 2D data matrix nor cell heterogeneity in bulk Hi-C data, which provide an average over millions of cells. Sampling-based methods, on the other hand, are probabilistic model-based and can account for not only dependency, heterogeneity, but also other features inherent in Hi-C data, such as over-dispersion and sparsity. However, whole-genome 3D structure recapitulation is too computationally expensive for sampling-based methods, while chromosome-by-chromosome strategies for sampling-based methods ignore important information on inter-chromosomal contacts. To address these issues, we propose the truncated Random effect EXpression-cut and paste (tREX-cap) method, which applies the tREX model within a divide and conquer strategy. The resulting method inherits the good data-feature-cognizant properties of tREX and, in the meantime, can efficiently infer the whole genome 3D structure. We demonstrate the performance of tREX-cap through an extensive simulation study and analyses of a Hi-C lymphoblastoid dataset and a Hi-C IMR90 dataset.

Humans↗

PubMed2006

Monte Carlo pedigree disequilibrium test for markers on the X chromosome.

Because of the need for fine mapping of disease loci and the availability of dense single-nucleotide-polymorphism markers, many forms of association tests have been developed. Most of them are applicable only to triads, whereas some are amenable to nuclear families (sibships). Although there are a number of methods that can deal with extended families (e.g., the pedigree disequilibrium test [PDT]), most of them cannot accommodate incomplete data. Furthermore, despite a large body of literature on association mapping, only a very limited number of publications are applicable to X-chromosomal markers. In this report, we first extend the PDT to markers on the X chromosome for testing linkage disequilibrium in the presence of linkage. This method is applicable to any pedigree structure and is termed "X-chromosomal pedigree disequilibrium test" (XPDT). We then further extend the XPDT to accommodate pedigrees with missing genotypes in some of the individuals, especially founders. Monte Carlo (MC) samples of the missing genotypes are generated and used to calculate the XMCPDT (X-chromosomal MC PDT) statistic, which is defined as the conditional expectation of the XPDT statistic given the incomplete (observed) data. This MC version of the XPDT remains a valid test for association under linkage with the assumption that the pedigrees and their associated affection patterns are drawn randomly from a population of pedigrees with at least one affected offspring. This set of methods was compared with existing approaches through simulation, and substantial power gains were observed in all settings considered, with type I error rates closely tracking their nominal values.

Chromosomes, Human, X↗

PubMed2006

Microarray analysis of gene expression: considerations in data mining and statistical treatment.

DNA microarray represents a powerful tool in biomedical discoveries. Harnessing the potential of this technology depends on the development and appropriate use of data mining and statistical tools. Significant current advances have made microarray data mining more versatile. Researchers are no longer limited to default choices that generate suboptimal results. Conflicting results in repeated experiments can be resolved through attention to the statistical details. In the current dynamic environment, there are many choices and potential pitfalls for researchers who intend to incorporate microarrays as a research tool. This review is intended to provide a simple framework to understand the choices and identify the pitfalls. Specifically, this review article discusses the choice of microarray platform, preprocessing raw data, differential expression and validation, clustering, annotation and functional characterization of genes, and pathway construction in light of emergent concepts and tools.

Cluster Analysis↗

PubMed2006

Microsatellites versus Single-Nucleotide Polymorphisms in confidence interval estimation of disease loci.

With cost-effective high-throughput Single Nucleotide Polymorphism (SNP) arrays now becoming widely available, it is highly anticipated that SNPs will soon become the choice of markers in whole genome screens. This optimism raises a great deal of interest in assessing whether dense SNP maps offer at least as much information as their microsatellite (MS) counterparts. Factors considered to date include information content, strength of linkage signals, and effect of linkage disequilibrium. In the current report, we focus on investigating the relative merits of SNPs vs. MS markers for disease gene localization. For our comparisons, we consider three novel confidence interval estimation procedures based on confidence set inference (CSI) using affected sib-pair data. Two of these procedures are multipoint in nature, enabling them to capitalize on dense SNPs with limited heterozygosity. The other procedure makes use of markers one at a time (two-point), but is much more computationally efficient. In addition to marker type, we also assess the effects of a number of other factors, including map density and marker heterozygosity, on disease gene localization through an extensive simulation study. Our results clearly show that confidence intervals derived based on the CSI multipoint procedures can place the trait locus in much shorter chromosomal segments using densely saturated SNP maps as opposed to using sparse MS maps. Finally, it is interesting (although not surprising) to note that, should one wish to perform a quick preliminary genome screening, then the two-point CSI procedure would be a preferred, computationally cost-effective choice.

Chromosome Mapping↗

PubMed2006

A two-step procedure for constructing confidence intervals of trait loci with application to a rheumatoid arthritis dataset.

Preliminary genome screens are usually succeeded by fine mapping analyses focusing on the regions that signal linkage. It is advantageous to reduce the size of the regions where follow-up studies are performed, since this will help better tackle, among other things, the multiplicity adjustment issue associated with them. We describe a two-step approach that uses a confidence set inference procedure as a tool for intermediate mapping (between preliminary genome screening and fine mapping) to further localize disease loci. Apart from the usual Hardy-Weiberg and linkage equilibrium assumptions, the only other assumption of the proposed approach is that each region of interest houses at most one of the disease-contributing loci. Through a simulation study with several two-locus disease models, we demonstrate that our method can isolate the position of trait loci with high accuracy. Application of this two-step procedure to the data from the Arthritis Research Campaign National Repository also led to highly encouraging results. The method not only successfully localized a well-characterized trait contributing locus on chromosome 6, but also placed its position to narrower regions when compared to their LOD support interval counterparts based on the same data.

Arthritis, Rheumatoid↗

PubMed2006

A comparison of methods for intermediate fine mapping.

The arrival of highly dense genetic maps at low cost has geared the focus of linkage analysis studies toward developing methods for placing putative trait loci in narrow regions with high confidence. This shift has led to a new analytic scheme that expands the traditional two-stage protocol of preliminary genome scan followed by fine mapping through inserting a new stage in between the two. The goal of this new "intermediate" fine mapping stage is to isolate disease loci to narrow intervals with high confidence so that association studies can be more focused, efficient, and cost-effective. In this paper, we compared and contrasted five methods that can be used for performing this intermediate step. These methods are: the lod support approach, the generalized estimating equations (GEE) method, the confidence set inference (CSI) procedure, and two bootstrap methods. We compared these methods in terms of the coverage probability and precision of localization of the resulting intervals. Results from a simulation study considering several two-locus models demonstrated that the two bootstrap methods yield intervals with approximately correct coverage. On the other hand, the 1-lod support intervals, and those produced by the GEE method, tend to significantly undercover the trait locus, while the regions obtained by the CSI incline to overcover the gene position. When the observed coverage of the confidence intervals produced by all the methods was held to be the same, those obtained through the CSI procedure displayed a higher ability to localize loci, especially when these loci have a minor contribution to the trait and when the amount of data available for the analysis is relatively small. However, with very large sample sizes, lod support intervals emerged as a winner. Application of the methods to the data from the Arthritis Research Campaign National Repository led to intervals containing the position of a known trait locus for all methods, with the greatest precision achieved by the CSI.

Arthritis, Rheumatoid↗

PubMed2006

Genome-wide tagging SNPs with entropy-based Monte Carlo method.

The number of common single nucleotide polymorphisms (SNPs) in the human genome is estimated to be around 3-6 million. It is highly anticipated that the study of SNPs will help provide a means for elucidating the genetic component of complex diseases and variable drug responses. High-throughput technologies such as oligonucleotide arrays have produced enormous amount of SNP data, which creates great challenges in genome-wide disease linkage and association studies. In this paper, we present an adaptation of the cross entropy (CE) method and propose an iterative CE Monte Carlo (CEMC) algorithm for tagging SNP selection. This differs from most of SNP selection algorithms in the literature in that our method is independent of the notion of haplotype block. Thus, the method is applicable to whole genome SNP selection without prior knowledge of block boundaries. We applied this block-free algorithm to three large datasets (two simulated and one real) that are in the order of thousands of SNPs. The successful applications to these large scale datasets demonstrate that CEMC is computationally feasible for whole genome SNP selection. Furthermore, the results show that CEMC is significantly better than random selection, and it also outperformed another block-free selection algorithm for the dataset considered.

Algorithms↗

PubMed2005

A new Bayesian approach incorporating covariate information for heterogeneity and its comparison with HLOD.

We consider a new Bayesian approach for heterogeneity that can take into account categorical covariates, if available. We use the Genetic Analysis Workshop 14 simulated data to first compare the Bayesian approach with the heterogeneity LOD, when no covariate information is used. We find that the former is more powerful, while the two approaches have comparable false-positive rates. We then include informative covariates in the Bayesian approach and find that it tends to give more precise interval estimates of the disease gene location than when covariates are not included. We had knowledge of the simulation models at the time we performed the analyses.

Bayes Theorem↗

PubMed2005

Interval estimation of disease loci: development and applications of new linkage methods.

Three variants of the confidence set inference (CSI) procedure were proposed and applied to both the simulated and the Collaborative Study on the Genetics of Alcoholism (COGA) data. For each of the two applications, we first performed a preliminary genome scan study based on the microsatellite markers using the GENEHUNTER+ software to identify regions that potentially harbor disease loci. For each such region, we estimated the sibling identity-by-descent sharing probability distribution at the putative disease locus. Based on these estimated probabilities, the CSI procedures were employed to further localize the disease loci using the single-nucleotide polymorphism markers, leading to confidence intervals/regions for their locations. For our analysis with the simulated data, we had knowledge of the simulating models at the time we performed the analysis.

Alcoholism↗

PubMed2005

Comparisons of methods for linkage analysis and haplotype reconstruction using extended pedigree data.

We compare and contrast the performance of SIMPLE, a Monte Carlo based software, with that of several other methods for linkage and haplotype analyses, focusing on the simulated data from the New York City population. First, a whole-genome scan study based on the microsatellite markers was performed using GENEHUNTER. Because GENEHUNTER had to drop individuals for many of the pedigrees, we performed a follow-up study focusing on several regions of interest using SIMPLE, which can handle all pedigrees in their entirety. Second, 3 haplotyping programs, including that in SIMPLE, were used to reconstruct haplotypic configurations in pedigrees. SIMPLE emerges clearly as a preferred tool, as it can handle large pedigrees and produces haplotypic configurations without double recombinant haplotypes. For this study, we had knowledge of the simulating models at the time we performed the analysis.

Chromosome Mapping↗

PubMed2005

A confidence set inference procedure for gene mapping using markers with incomplete polymorphism.

A recent approach for gene mapping based on confidence set inference (CSI) promises several advantages, including avoidance of corrections for multiple tests, availability of confidence intervals with known statistical properties, and sufficient localizations of disease genes. This paper proposes an extended CSI procedure that can handle markers with incomplete polymorphism, thereby increasing the applicability of the set of CSI methods in practical situations. Simulation studies show that the new procedure retains the main advantages of the original CSI. Although it generally requires more data to achieve a similar power, this increase is moderate for markers with 80% heterozygosity or higher. We also investigate the effects of relative risk estimates and disease models. Our analyses show that perturbation from actual relative risks or multilocus disease models generally leads to reduction in power or inflation in type I error, as expected. Nevertheless, for certain classes of two-locus disease models, CSI can still perform well, with reasonably high actual coverage probabilities for at least one of the disease loci. Application of CSI to the data provided by the Genetic Analysis Workshop 13 yields encouraging results, as they compare favorably to those obtained from GENEHUNTER using its NPL sib-pair method.

Chromosome Mapping↗

PubMed2005

Multilocus LD measure and tagging SNP selection with generalized mutual information.

Linkage disequilibrium (LD) plays a central role in fine mapping of disease genes and, more recently, in characterizing haplotype blocks. Classical LD measures, such as D' and r(2), are frequently used to quantify relationship between two loci. A pairwise "distance" matrix among a set of loci can be constructed using such a measure, and based upon which a number of haplotype block detection and tagging single nucleotide polymorphism (SNP) selection algorithms have been devised. Although successful in many applications, the pairwise nature of these measures does not provide a direct characterization of joint linkage disequilibrium among multiple loci. Consequently, applications based on them may lead to loss of important information. In this report, we propose a multilocus LD measure based on generalized mutual information, which is also known as relative entropy or Kullback-Leibler distance. In essence, this measure seeks to quantify the distance between the observed haplotype distribution and the expected distribution assuming linkage equilibrium. We can show that this measure is approximately equal to r(2) in the special case with two loci. Based on this multilocus LD measure and an entropy measure that characterizes haplotype diversity, we propose a class of stepwise tagging SNP selection algorithms. This represents a unified approach for SNP selection in that it takes into account both the haplotype diversity and linkage disequilibrium objectives. Applications to both simulated and real data demonstrate the utility of the proposed methods for handling a large number of SNPs. The results indicate that multilocus LD patterns can be captured well, and informative and nonredundant SNPs can be selected effectively from a large set of loci.

Algorithms↗

PubMed2004

On modeling locus heterogeneity using mixture distributions.

BACKGROUND: Locus heterogeneity poses a major difficulty in mapping genes that influence complex genetic traits. A widely used approach to deal with this problem involves modeling linkage data in terms of finite mixture distributions. In its simplest setup, also known as the admixture approach, a single parameter is used to model the probability that the disease-causing gene of a family is linked to a reference marker. This parameter is usually interpreted as the overall proportion of linked families. RESULTS: In this article, we address two issues regarding the admixture approach. First, we tackle the question of whether the single parameter of linked proportion is well defined in general. By formulating the likelihood under a classification scheme based on distributions, we show that such a parameter is meaningful only when a certain well-characterized condition is met. Second, we study a condition given in the literature for validating the admixture approach. A counter example is constructed to illustrate that the condition does not necessarily lead to valid estimates. CONCLUSIONS: Estimators from the admixture approach may be inconsistent. This holds even if a condition given in the literature to validate the approach is satisfied.

Chromosome Mapping↗

PubMed2004

Class discovery and classification of tumor samples using mixture modeling of gene expression data--a unified approach.

MOTIVATION: The DNA microarray technology has been increasingly used in cancer research. In the literature, discovery of putative classes and classification to known classes based on gene expression data have been largely treated as separate problems. This paper offers a unified approach to class discovery and classification, which we believe is more appropriate, and has greater applicability, in practical situations. RESULTS: We model the gene expression profile of a tumor sample as from a finite mixture distribution, with each component characterizing the gene expression levels in a class. The proposed method was applied to a leukemia dataset, and good results are obtained. With appropriate choices of genes and preprocessing method, the number of leukemia types and subtypes is correctly inferred, and all the tumor samples are correctly classified into their respective type/subtype. Further evaluation of the method was carried out on other variants of the leukemia data and a colon dataset.

Algorithms↗

PubMed2004

Evaluations of maximization procedures for estimating linkage parameters under heterogeneity.

Locus heterogeneity is a major problem plaguing the mapping of disease genes responsible for complex genetic traits via linkage analysis. A common feature of several available methods to account for heterogeneity is that they involve maximizing a multidimensional likelihood to obtain maximum likelihood estimates. The high dimensionality of the likelihood surface may be due to multiple heterogeneity (mixing) parameters, linkage parameters, and/or regression coefficients corresponding to multiple covariates. Here, we focus on this nontrivial computational aspect of incorporating heterogeneity by considering several likelihood maximization procedures, including the expectation maximization (EM) algorithm and the stochastic expectation maximization (SEM) algorithm. The wide applicability of these procedures is demonstrated first through a general formulation of accounting for heterogeneity, and then by applying them to two specific formulations. Furthermore, our simulation studies as well as an application to the Genetic Analysis Workshop 12 asthma datasets show that, among other observations, SEM performs better than EM. As an aside, we illustrate a limitation of the popular admixture approach for incorporating heterogeneity, proved elsewhere. We also show how to obtain standard errors (SEs) for EM and SEM estimates, using methods available in the literature. These SEs can then be combined with the corresponding estimates to provide confidence intervals of the parameters.

Algorithms↗

PubMed2003

Linkage analysis of the simulated data - evaluations and comparisons of methods.

The goal of this study is to evaluate, compare, and contrast several standard and new linkage analysis methods. First, we compare a recently proposed confidence set approach with MAPMAKER/SIBS. Then, we evaluate a new Bayesian approach that accounts for heterogeneity. Finally, the newly developed software SIMPLE is compared with GENEHUNTER. We apply these methods to several replicates of the Genetic Analysis Workshop 13 simulated data to assess their ability to detect the high blood pressure genes on chromosome 21, whose positions were known to us prior to the analyses. In contrast to the standard methods, most of the new approaches are able to identify at least one of the disease genes in all the replicates considered.

Bayes Theorem↗

PubMed2003

CD24 is a genetic modifier for risk and progression of multiple sclerosis.

Multiple sclerosis (MS) is a chronic neurological disease of unknown etiology, but a genetic basis for the disease is undisputed. We have reported that CD24 is required for the pathogenicity of autoreactive T cells in experimental autoimmune encephalomyelitis, the mouse model of MS. Here we investigate the contribution of CD24 to MS by studying single-nucleotide polymorphism in the ORF among 242 MS patients and 207 population controls. This single-nucleotide polymorphism results in replacement of alanine (CD24a) with valine (CD24v) in the mature protein. We found that the CD24v/v renders a >2-fold increase in the relative risk of MS in the general population (P = 0.023). Among familial MS, the CD24v allele is preferentially transmitted into affected individuals (P = 0.017). Furthermore, 50% of CD24v/v patients with expanded disability status scale 6.0 reached the milestone in 5 years, whereas the CD24a/v (P = 0.00037) and CD24a/a (P = 0.0016) patients did so in 16 and 13 years, respectively. Moreover, our data suggest that the CD24v/v patients expressed higher levels of CD24 on peripheral blood T cells than did the CD24a/a patients. Transfection with CD24a and CD24v cDNA demonstrated that the CD24v allele can be expressed at higher efficiency than the CD24a alleles. Thus, CD24 polymorphism is a genetic modifier for susceptibility and progression of MS in the central Ohio cohort that we studied, perhaps by affecting the efficiency of CD24 expression on the cell surface.

Alanine↗

PubMed2003

Finding starting points for Markov chain Monte Carlo analysis of genetic data from large and complex pedigrees.

Genetic data from founder populations are advantageous for studies of complex traits that are often plagued by the problem of genetic heterogeneity. However, the desire to analyze large and complex pedigrees that often arise from such populations, coupled with the need to handle many linked and highly polymorphic loci simultaneously, poses challenges to current standard approaches. A viable alternative to solving such problems is via Markov chain Monte Carlo (MCMC) procedures, where a Markov chain, defined on the state space of a latent variable (e.g., genotypic configuration or inheritance vector), is constructed. However, finding starting points for the Markov chains is a difficult problem when the pedigree is not single-locus peelable; methods proposed in the literature have not yielded completely satisfactory solutions. We propose a generalization of the heated Gibbs sampler with relaxed penetrances (HGRP) of Lin et al., ([1993] IMA J. Math. Appl. Med. Biol. 10:1-17) to search for starting points. HGRP guarantees that a starting point will be found if there is no error in the data, but the chain usually needs to be run for a long time if the pedigree is extremely large and complex. By introducing a forcing step, the current algorithm substantially reduces the state space, and hence effectively speeds up the process of finding a starting point. Our algorithm also has a built-in preprocessing procedure for Mendelian error detection. The algorithm has been applied to both simulated and real data on two large and complex Hutterite pedigrees under many settings, and good results are obtained. The algorithm has been implemented in a user-friendly package called START.

Algorithms↗