Genetic association mapping via evolutionbased clustering of haplotypes.  
Jump to Full Text  
MedLine Citation:

PMID: 17616979 Owner: NLM Status: MEDLINE 
Abstract/OtherAbstract:

Multilocus analysis of single nucleotide polymorphism haplotypes is a promising approach to dissecting the genetic basis of complex diseases. We propose a coalescentbased model for association mapping that potentially increases the power to detect diseasesusceptibility variants in genetic association studies. The approach uses Bayesian partition modelling to cluster haplotypes with similar disease risks by exploiting evolutionary information. We focus on candidate gene regions with densely spaced markers and model chromosomal segments in high linkage disequilibrium therein assuming a perfect phylogeny. To make this assumption more realistic, we split the chromosomal region of interest into subregions or windows of high linkage disequilibrium. The haplotype space is then partitioned into disjoint clusters, within which the phenotypehaplotype association is assumed to be the same. For example, in casecontrol studies, we expect chromosomal segments bearing the causal variant on a common ancestral background to be more frequent among cases than controls, giving rise to two separate haplotype clusters. The novelty of our approach arises from the fact that the distance used for clustering haplotypes has an evolutionary interpretation, as haplotypes are clustered according to the time to their most recent common ancestor. Our approach is fully Bayesian and we develop a Markov Chain Monte Carlo algorithm to sample efficiently over the space of possible partitions. We compare the proposed approach to both singlemarker analyses and recently proposed multimarker methods and show that the Bayesian partition modelling performs similarly in localizing the causal allele while yielding lower falsepositive rates. Also, the method is computationally quicker than other multimarker approaches. We present an application to real genotype data from the CYP2D6 gene region, which has a confirmed role in drug metabolism, where we succeed in mapping the location of the susceptibility variant within a small error. 
Authors:

Ioanna Tachmazidou; Claudio J Verzilli; Maria De Iorio 
Related Documents
:

401899  Temperate bacillus subtilis bacteriophage phi 3t: chromosomal attachment site and compa... 2785029  Chromosomal localization of the human osteocalcin gene. 6322359  Genetic analysis of hyperproduction of epidermal growth factor receptors in human epide... 
Publication Detail:

Type: Journal Article; Research Support, NonU.S. Gov't 
Journal Detail:

Title: PLoS genetics Volume: 3 ISSN: 15537404 ISO Abbreviation: PLoS Genet. Publication Date: 2007 Jul 
Date Detail:

Created Date: 20080422 Completed Date: 20080603 Revised Date: 20130606 
Medline Journal Info:

Nlm Unique ID: 101239074 Medline TA: PLoS Genet Country: United States 
Other Details:

Languages: eng Pagination: e111 Citation Subset: IM 
Affiliation:

Department of Epidemiology and Public Health, Imperial College London, United Kingdom. ioanna.tachmazidou03@ic.ac.uk 
Export Citation:

APA/MLA Format Download EndNote Download BibTex 
MeSH Terms  
Descriptor/Qualifier:

Algorithms Alleles Bayes Theorem Chromosome Mapping / methods* Cluster Analysis Cytochrome P450 CYP2D6 / genetics Databases, Genetic Evolution, Molecular* Genetic Predisposition to Disease Haplotypes* Humans Linkage Disequilibrium Markov Chains Models, Genetic* Monte Carlo Method Phylogeny Polymorphism, Single Nucleotide Software 
Grant Support  
ID/Acronym/Agency:

//Wellcome Trust 
Chemical  
Reg. No./Substance:

EC 1.14.14.1/Cytochrome P450 CYP2D6 
Comments/Corrections 
Full Text  
Journal Information Journal ID (nlmta): PLoS Genet Journal ID (publisherid): pgen Journal ID (publisherid): plge Journal ID (pmc): plosgen ISSN: 15537390 ISSN: 15537404 Publisher: Public Library of Science, San Francisco, USA 
Article Information Download PDF Copyright: ? 2007 Tachmazidou et al. This is an openaccess article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Received Day: 21 Month: 11 Year: 2006 Accepted Day: 21 Month: 5 Year: 2007 Print publication date: Month: 7 Year: 2007 Electronic publication date: Day: 6 Month: 7 Year: 2007 Volume: 3 Issue: 7 Elocation ID: e111 ID: 1913101 DOI: 10.1371/journal.pgen.0030111 Publisher Id: 06PLGERA0510R3 Serial Item and Contribution Identifier: plge030703 PubMed Id: 17616979 citation: Tachmazidou I, Verzilli CJ, De Iorio M (2007) Genetic association mapping via evolutionbased clustering of haplotypes. PLoS Genet 3(7): e111. doi:10.1371/journal.pgen.0030111 
Genetic Association Mapping via EvolutionBased Clustering of Haplotypes Alternate Title:Fine Mapping via Haplotype Clustering  
Ioanna Tachmazidou1*  
Claudio J Verzilli2  
Maria De Iorio1  
Jonathan Pritchardedit1 
Role: Editor 
1 Department of Epidemiology and Public Health, Imperial College London, United Kingdom


2 Department of Epidemiology and Population Health, London School of Hygiene and Tropical Medicine, United Kingdom


University of Chicago, United States of America 

Correspondence: * To whom correspondence should be addressed. Email: ioanna.tachmazidou03@ic.ac.uk 
Genetic association studies have emerged as a powerful tool for dissecting the genetic contribution to complex, common diseases. Their main goal is to identify interindividual genetic variants, mostly single nucleotide polymorphisms (SNPs), which show the strongest association with the phenotype of interest, either because they are causal or, more likely, statistically correlated or in linkage disequilibrium (LD) with an unobserved causal variant(s). Univariate analyses that test each marker for association with the phenotype can be inefficient, as they do not take into account the patterns of LD among markers as opposed to multimarker or haplotypebased approaches.
Haplotypebased analyses are promising and their use is supported by results from recent studies that suggest that the human genome consists of blocklike regions of ancestrally conserved chromosomal segments, whose boundaries are defined by recombination hotspots [^{1}?^{3}]. The main difficulty with a haplotypebased approach is that, for a large number of SNPs, there may be many haplotypes, usually a few common and several rare ones. One solution is to model all rare haplotypes as a single ?exposure? group, but this approach could lead to loss of information.
An alternative approach to sensibly reducing the number of haplotypes considered is to cluster structurally ?similar? haplotypes, as they are more likely to carry the same susceptibility allele and therefore have similar associated risk [^{4}]. The rationale behind this approach is that haplotypes that inherit a causal mutation, e.g., case haplotypes for a dichotomous trait, tend to also inherit alleles at markers nearby due to LD. Therefore, case haplotypes are expected to be more similar around the causal locus compared to control haplotypes. Hence, similar haplotypes are grouped together in homogeneous clusters, within which disease risk is assumed constant [^{4}]. A key issue with such haplotype clustering methods is the choice of the metric used to determine how similar one haplotype is to another. The similarity metric can be, for example, the proportion of SNPs at which two haplotypes are the same [^{5}], or it can exploit the ancestral relationships of haplotypes by adopting the notion that if the causal mutation has occurred only once then haplotypes share a common ancestry at that point [^{6}?^{11}].
One recently proposed clustering method is that of Waldron et al. [^{11}]. They modify the ideas of Molitor et al. [^{8}] by looking for only one cluster with the highest disease risk haplotypes, and by modifying the similarity score to account for population allele frequencies and to allow allele mismatches. In particular, Waldron et al. [^{11}] define a hypothetical ancestral haplotype (namely the cluster centre) from which the members of the cluster are thought to have descended, and they measure the similarity of the centre with each observed haplotype around a putative causal locus. The similarity metric is calculated for all windows containing the putative location. Each window score is the sum of the SNP scores and the final score for each unique haplotype is taken to be the maximum window score. The window with the maximum score is the part of the ancestral haplotype that the haplotype inherited. The cluster is defined to consist of all haplotypes whose similarity score exceeds some threshold. The ancestral haplotype, the causal locus, the penalty parameter for allele mismatches, and the threshold are random variables and are updated with a Markov Chain Monte Carlo (MCMC) algorithm.
Clustering approaches can be thought of as an empirical approximation to the more formal coalescent approach, which is promising for LD mapping [^{12}], as the coalescent is more likely to infer a better approximation to the evolutionary history of mutations of a set of haplotypes. In fact, the genealogy of a sample of haplotypes contains the patterns of genetic diversity of the distinct haplotypes, with putative disease mutations embedded within. Several approaches based on the coalescent have been developed for finescale mapping [^{13},^{14}]. However, most of these methods are effective only for a small number of markers and individuals.
The coalescent assumes that the variation in haplotypes can be described only by their mutational history. However, to approximate the shared ancestry among haplotypes more accurately, a finemapping approach may need to account for recombination. This can be achieved using methods that consider ancestral recombination graphs (ARG) [^{15}, ^{16}], but their computational complexity is still high.
In this paper, we propose a Bayesian partition model [^{17}] to cluster haplotypes according to their associated level of risk by exploiting evolutionary information. The method is computationally fast and can handle large datasets with many markers and/or subjects. Bayesian partition models have been used in genetic association studies by Seaman et al. [^{18}] for highly polymorphic candidate genes and by Molitor et al. [^{8}] and Morris [^{19},^{20}] for candidate genes or small candidate regions. We focus on candidate gene regions with densely spaced markers and assume that a perfect phylogeny holds over short chromosomal lengths in the region. The perfect phylogeny assumption implies that each SNP has arisen as a result of a single ancestral mutation. Recombination, parallel mutations, or back mutations can cause the perfect phylogeny assumption to be violated. The distance used for the clustering method has an evolutionary interpretation, as sequences are clustered together depending on the time to their most recent common ancestor in the genealogy. In particular, we proceed by splitting the chromosomal region of interest into subregions or windows where the perfect phylogeny assumption holds. Focusing on casecontrol studies, at each step of the MCMC algorithm we select a window, i.e., a perfect phylogeny, and we then partition the haplotype space into disjoint clusters on the basis of the relative ages of the markers in the selected window. Each cluster is then assigned a specific risk. Potentially, haplotypes can be clustered on the basis of any tree and each SNP has, a priori, a positive probability to be a cluster centre. The number and centres of the clusters are both assumed unknown, a priori. Our approach is fully Bayesian and we obtain posterior samples of quantities of interest, sampling over the space of possible partitions. We are particularly interested in the posterior probability of each SNP being a cluster, since high values correspond to markers or locations where case and control haplotypes are best separated, suggesting the presence of a disease susceptibility variant in the region. We assess the performance of the proposed method in a simulation study by comparing it with single locus analysis; to the haplotypebased method of Waldron et al. [^{11}], as implemented in the software HAPCLUSTER; and to the ARGbased method of Minichiello and Durbin [^{16}], implemented in the software Margarita. We consider various simulation scenarios differing in genetic relative risk, minor allele frequency of the causal allele, number of cases and controls, disease model, marker density, and recombination rate. Results indicate that the proposed method performs similarly in localizing the causal allele while yielding lower falsepositive rates. Also, the method is computationally faster than other multimarker approaches. We also apply the proposed method to real genotype data from the CYP2D6 gene region, which has been shown to be associated with drug metabolism [^{21}], and we succeed in mapping the location of the susceptibility variant within a small error.
We investigated the performance of the proposed method using simulated casecontrol data under different scenarios. Results were compared to those obtained from the univariate Fisher's exact test of association at each SNP maker and those using the HAPCLUSTER algorithm [^{11}]. The ARGbased Margarita [^{16}] was only run on the default scenario as defined below because of computational time constraints. We choose HAPCLUSTER as a representative of alternative haplotypeclustering methods since Waldron et al. [^{11}] found (in simulation studies) that it performs better than other similar methods such as BLADE [^{7}] and DHSMAP [^{6}]. They also found that their distance metric outperformed those of Durrant et al. [^{10}] and Yu et al. [^{9}]. An alternative ARGbased method is that of Z?llner and Pritchard [^{15}]. However, in trial runs we found that it is not computationally feasible for such an extensive simulation study.
We used the software FREGENE [^{22}] to simulate two pools of 20,000 haplotypes, corresponding to a uniform or variable recombination rate, spanning a 1Mb chromosomal region. The population with constant recombination rate was simulated from the simple WrightFisher model with recombination and mutation rate equal to 2.3 ? 10^{?8} and 1.1 ? 10^{?8} per site per generation, respectively. The second population was simulated with recombination hotspots. We assumed that 60% of all recombination events take place in recombination hotspots, which occur on average every 200 kb and are 2 kb in length. Also, 1% of the genome was assumed to consist of hotspots. The recombination rate within hotspots was 6.56 ? 10^{?7} per site per generation, and 4.44 ? 10^{?9} between hotspots [^{22}]. The mutation rate was 2.3 ? 10^{?8} per site per generation.
To reflect ascertainment bias, we draw markers from the set of SNPs having minor allele frequency (MAF) larger than 1%. From these markers, 1,000 (or 340 depending in the SNP density chosen) SNPs were selected with probability proportional to p(1 ? p), where p is the allele frequency of a marker in the sample, to reflect an extra ascertainment bias towards markers with two common alleles and to give 1 (or 3) kb average SNP density. A causative locus was then selected at random with allele frequency between p ? 0.005 and p + 0.005, where p was in a range between 0.02 and 0.3. Then, for each pair of randomly sampled haplotypes, the case/control status was assigned according to either an additive or dominant disease model for the genotypes at the causal site assuming a disease prevalence K equal to 1% while the genetic relative risk of the heterozygote genetic relative risk (GRR[Aa]) varied between 1.2 and 2.4. Specifically, if f_{i} is the penetrance function given i copies of the causal allele, i = 0, 1, 2, and GRR(Aa) = r = f_{1}/f_{0}, then following the liability model used in Tzeng [^{23}] and assuming HWE, we have f_{0} = K/(1 ? 2p + 2pr) and f_{2} = 2rf_{0} ? f_{0} for an additive disease model, and f_{0} = K/(1 ? 2p + 2pr + p^{2}? rp^{2}) and f_{2} = f_{1} for a dominant one. Pairs of haplotypes were sampled with replacement from the 20,000 haplotypes until N cases and N controls were obtained. Thus, each case (control) individual contributed two case (control) haplotypes to the analysis. The sample size of cases and controls N also varied between 200 and 2,000.
Next, we removed the causal allele from the dataset and, using the algorithm described in Materials and Methods, we found the perfect phylogenies in the dataset. The average number of gene trees was 200 and the average number of SNPs in a gene tree was four. Using the SEQ2TR and the TREEPIC software of Griffiths [^{24}], we obtained the relative ages of the mutations in the different phylogenies. We assumed a Beta(1,1) prior for the haplotype risks implying that, a priori, each observed haplotype has a 0.5 risk of disease.
The MCMC algorithm was run for 100,000 iterations with a burnin of 10,000 iterations for 50 datasets across different combinations of the simulation parameters. We define the ?default? scenario as that corresponding to having N = 1,000 cases and controls simulated with variable recombination rate under an additive disease model with 1.6 GRR(Aa), a SNP density of 1 kb, and a causal allele with 5% MAF.
The computing time for a dataset of 1,000 markers and 4,000 haplotypes was approximately 23 min (14 min to construct the phylogenies and 9 min to run the algorithm) on an Intel Xeon 3.40GHz processor with 2 Gb of memory. The corresponding computing time for HAPCLUSTER was 24 min. Note that while HAPCLUSTER is written in C++, the proposed method is implemented in R. As mentioned earlier, we compare the results from Margarita only under the default simulation scenario. To run Margarita on a single dataset of 1,000 markers and 4,000 haplotypes, we split the data into overlapping windows of 200 markers and then run the algorithm separately on each window, as suggested by Minichiello (personal communication). This resulted in five windows for a single dataset. Each window took 15?16 h to run with 10,000 permutations on 100 ARGs on a high computing cluster of 2.66GHz Xeon 5150 CPUs, making an exhaustive comparison of the two approaches impractical. An R package [^{25}] called BETA (Bayesian Evolutionary Tree based Association analysis) implementing the method described in this article is available upon request from IT (ioanna.tachmazidou03@ic.ac.uk).
The results from a single simulated dataset under the default scenario are shown in Figure 1, where the dot on the xaxis indicates the position of the single susceptibility mutation. For the proposed method, the marginal posterior probability of association, i.e., the probability of each SNP being a cluster centre, and the Bayes factor in favour of association at each marker are shown. We also report the (log)pvalues from Margarita and Fisher's exact test, and the posterior density of location from HAPCLUSTER. The estimate of the causal mutation is based on the marker with the minimum pvalue (when using the single locus test and Margarita), the maximum Bayes factor (BETA), or the mode of the posterior distribution of location (HAPCLUSTER). For this dataset, all methods identified a marker within 10 kb of the true causal allele except for HAPCLUSTER (502kb distance). The association signal is however notably clearer under the proposed method.
The same dataset contained 208 perfect phylogenies and Table 1 reports the posterior probability and Bayes factor of a tree carrying the causal locus, in which the numbers in brackets is the tree (all remaining trees had posterior probability less than 0.015). The true causal allele was embedded within tree 7 with marker S_{43} the closest to it. The posterior mode of the distribution for the number of clusters was two, including the ?null? cluster (explained in the ?Bayesian partition model? section of Materials and Methods), and SNP S_{58}, which belonged to tree 10, had the highest marginal posterior probability of being a cluster centre. All marginal probabilities larger than 0.01 and corresponding Bayes factors are given in Table 2. The physically closest SNP to the true susceptibility allele in the table is S_{47}, also embedded within tree 7. Figure 2 shows the perfect phylogeny with the highest posterior probability of containing the susceptibility allele (tree 10), together with the case and control multiplicities of each unique haplotype in the tree.
The proposed approach is not limited to the case of a single variant in a single candidate region. Figure 3 shows the results from a simulated dataset in which two liability alleles in separate regions (possibly corresponding to two separate candidate regions) contribute independently to disease susceptibility. The results reported correspond to genotype data for 200 cases and controls simulated assuming a variable recombination rate, an additive disease model, SNP density of 1 kb, MAF of causal alleles of 10?15%, and GRR(Aa) = 3. In total there were 184 perfect phylogenies with the two liability alleles belonging to trees 2 and 183. In Figure 3, the dots on the xaxis indicate the positions of the two susceptibility mutations. For this particular dataset, the Bayesian model appears to perform better than the single locus analysis, both in terms of location error and in reducing noisy associations. Trees 1 and 179 had the highest posterior probability of carrying the causal alleles, and the posterior mode of the distribution for the number of clusters was three, including the ?null? cluster (see ?Bayesian partition model? section of Materials and Methods). The distances between the loci with the highest marginal posterior probabilities of being cluster centres and the true locations of the susceptibility alleles were 4 kb and 19 kb, while the corresponding distances for the SNPs with the two smallest pvalues were 13 kb and 36 kb. The advantage of the proposed method is likely due to the fact that we fully exploit the LD information around the causal alleles, incorporating the evolutionary information through the perfect phylogeny assumption.
Tables 3?6 report the distances from the true location of the liability variant, together with its standard error for our method, HAPCLUSTER, and the single locus Fisher's exact tests under the different simulation scenarios. In each case, results shown are averages over 50 simulated datasets. The location of the causal allele is estimated by the SNP with the minimum pvalue for Fisher's exact test and Margarita, by the posterior mode using a kernel density estimate for HAPCLUSTER, and by the SNP with the maximum Bayes factor or marginal posterior probability of being a cluster centre for the proposed model. For BETA, we report results both when the number of clusters is random and when it is fixed at two. Although the former assumption is more flexible, fixing the number of clusters to two is more sensible if, a priori, one expects only one causal mutation in the candidate region. Also, in the latter case, results are more directly comparable with those from HAPCLUSTER, which assumes only two clusters. In each table, the results under the default scenario are shown for ease of comparison. The average distance from the true location for Margarita over 50 replicates under the default simulation scenario is reported in Table 7, in which PERM pvalue is the markerwise pvalue calculated by permutation, EVD pvalue is the markerwise pvalue calculated by fitting an extreme value distribution, and EXP pvalue is the experimentwise pvalue calculated by permutation, as given by Margarita. Overall, there are no significant differences among the methods in terms of localization error. Figures S1?S14 show typical outputs from each of the methods considered under the default scenario. Note that for BETA, results are from the general version with a random number of clusters, as for all graphs shown. In the Supporting Information, we also report results of performance comparison over 100 datasets simulated under alternative scenarios (separated in Tables S1 and S2 depending on the MAF of the causal SNP).
Similarly, there were no major differences in the distribution of the distances of the estimated and true location of the susceptibility allele for the different methods. Figure 4 plots the cumulative probability that the identified location is within some distance from the true location, over the 50 replicates and the default scenario. For reasonable location errors, the methods perform equally, with HAPCLUSTER possibly showing a slight advantage.
On the other hand, the advantage of the proposed approach is evident when considering the number of falsepositive associations over replicates, as well as the clarity in association signals. To quantify the latter, we consider a window around the causal SNP and calculate the average number of significant associations within that window across the 50 replicates. Results are shown in Figure 5. For BETA and singlemarker tests, we report results from using two different significance thresholds, namely a Bayes factor in favour of association larger than or equal to 10 or 150 (corresponding to a strong or decisive signal, [^{26}]) or a pvalue smaller than or equal to 0.05 or the Bonferroniadjusted value (0.05 divided by the number of markers in each dataset), respectively. For Margarita, we consider the markerwise pvalues calculated by permutation, while ?Margarita Bonferroni? and ?Margarita corrected? correspond to pvalues corrected for multiple testing using Bonferroni and permutation, respectively. Results for HAPCLUSTER are not reported, as this software does not provide markerwise estimates of measures of association.
The average number of associations found by BETA with a threshold of 10 for the Bayes factor remains stable as the distance increases and is lower than that given by all other methods apart from the singlemarker Fisher's exact test results using a conservative Bonferroni adjustment. The latter, however, still yields a noisier signal than BETA under the more stringent threshold of 150 for the Bayes factor (bottom two lines in Figure 5).
To compare the power of the different methods, we define a window of 100 kb on either side of the causative allele and calculate the proportion of the 50 replicates yielding a significant association within the window, as in Minichiello and Durbin [^{16}]. The significance of a signal is assessed using the rules described in the previous paragraph. Figure 6 shows the probability of detecting a significant association within 100 kb of the causal SNP under various scenarios and over the 50 replicates. In each plot, we vary a simulation parameter along the xaxis while assuming default values for the remaining ones. As mentioned earlier, Margarita was run only for the default scenario. We were unable to obtain results from HAPCLUSTER, as this method does not give markerwise measures of association. From the results in Figure 6, BETA using the strong rule has more power than both the single locus approach and Margarita (default scenario only) with multiplicitycorrected results by permutation, and slightly less power than plain Margarita. Uncorrected single locus test is the most powerful approach, having, however, the worst performance in terms of false positives.
As noted earlier, an advantage of the proposed approach is the ability to remove much of the noisy associations. To investigate this further, we calculated the false positive rate from BETA and compared the results with the analogous quantity for Margarita and the univariate analysis. Specifically, given threshold pvalues for Margarita and Fisher's exact test and threshold Bayes factors for BETA, we defined as false positives M_{fp}, those markers with smaller pvalues or larger Bayes factors lying outside a window of 100 kb either side of the causal site [^{27}]. For each dataset with M markers, the false positive rate is then M_{fp}/M. Figure 7 shows the mean false positive rates over the replicates and for different scenarios. The threshold values for the Bayes factors and the pvalues are the same as in the previous analyses. For Margarita, the three points correspond to the default scenario and markerwise pvalues calculated by permutation or experimentwise pvalues calculated by permutation. The falsepositive rates for BETA are very low under all simulation scenarios. Under the default scenario, BETA controls the false positives much better than Margarita. Results for HAPCLUSTER are not reported, since, as mentioned earlier, the method does not provide markerwise measures of association. Note that the choice of a 100kb window is arbitrary; a 200kb window was also used (unpublished data), which did not alter the conclusions about false positives.
Finally, we constructed 50 datasets under a null model of no disease association, and we calculated the falsepositive rate. For the univariate analysis, this was 4.048% (pvalue ?0.05) and 0 when using Bonferroni correction, while BETA resulted in a falsepositive rate of 0.138% (Bayes factor ?10) and 0.002% (Bayes factor ?150). Therefore, the proposed model appears to be reliable in confirming association.
The CYP2D6 gene on Chromosome 22q13 has a known role in drug metabolism, with multiple polymorphisms of CYP2D6 gene causing a recessive poor drug metaboliser phenotype. Hosking et al. [^{21}] genotyped 1,018 individuals at 32 SNP markers across a 890kb region flanking the CYP2D6 gene. From the 1,018 individuals, 41 were predicted to have the poor metaboliser phenotype and were thus treated as cases. This dataset has been used by Morris et al. [^{28}], Maniatis et al. [^{29}], Waldron et al. [^{11}], and Verzilli et al. [^{27}] to test their proposed LD mapping methods. Hosking et al. [^{21}] reported a 390kb region of significance around CYP2D6, Morris et al. [^{28}] gave a 95% posterior confidence interval of 185 kb, and Maniatis et al. [^{29}] yielded a 172kb support interval, while Waldron et al. [^{11}] and Verzilli et al. [^{27}] refined it to 160 kb and 79 kb, respectively.
We used PHASE [^{30}] to resolve ambiguous haplotype pairs for each individual. The pair for each individual was chosen at random according to the posterior probability of the haplotype pair provided by PHASE, and the resulting dataset was analysed as phaseknown haplotype data. To investigate the effect of phase uncertainty, we repeated the above procedure ten times to obtain ten independent datasets, and ran the proposed method separately on each of these datasets.
Since the average SNP density for this dataset is 30 kb, we used a geometric prior distribution on the number of SNPs of each tree with parameter p equal to 0.98 (see ?Model specification? section of Materials and Methods). An interpretation of this approach is that there is prior belief that the causal allele lies in a singlemarker tree. Moreover, we fixed the number of clusters to be two, i.e., we expect a single causal location.
Each dataset consisted of 26 perfect phylogenies except for one that had 27. Most of the datasets resulted in 23 trees that contained a single SNP, two trees with two SNPs, and one tree with five SNPs. In all analyses, only gene trees 17, 18, 19, and 20 resulted in a nonzero posterior probability of carrying the liability allele (with an average of 0.75, 0.08, 0.15, and 0.02, respectively). Table 8 reports the marginal posterior probabilities and Bayes factors of each SNP being a cluster centre (averaged over the ten analyses), and Figure 8 shows pvalues from Fisher's exact test for singlemarker disease association, the marginal posterior probability of association and the Bayes factor in favour of association at each marker (again averaged over the ten analyses), where the vertical line on the xaxis indicates the location of CYP2D6. The results suggest strong evidence that marker 19 at 550 kb is the closest marker to gene CYP2D6 (at 525.3 kb), which leads to a location error of 24.7 kb. All ten analyses resulted in the same 95% credible interval of 119 kb. The same credible interval was given from all ten datasets analyzed by the general BETA version (where the number of clusters is random). In this case, in all ten imputed datasets, the posterior mode of the distribution for the number of clusters was two, including the ?null? cluster (explained in the ?Bayesian partition model? section of the Materials and Methods). The credible interval obtained by BETA compares favourably with the supporting intervals reported by other authors mentioned above.
We have presented a Bayesian method to perform an evolutionbased association analysis using haplotype data. Haplotype data capture the genetic variation among individuals in a population, and their use in genetic association studies can potentially increase the power to locate susceptibility variants [^{31}]. Our approach is based on the construction of rooted gene trees over small genetic regions. Although gene trees do not represent the exact history of haplotypes, they offer a sensible and computationally efficient approximation of the ancestry of a sample of chromosomes. The proposed algorithm is particularly suited for densely genotyped regions and can be applied to the analysis of single candidate genes, multiple candidate genes, or larger candidate regions. The performance of the proposed method has been compared with singlelocus analyses and with recently proposed multilocus methods in simulation studies. Results indicate that BETA performs similarly in localizing a causal allele, but leads to lower falsepositive results. Moreover, it offers computational advantages over alternative multimarker methods. In an application to real data from the CYP2D6 region, we are able to map the location of a susceptibility variant within a small error.
The proposed model is flexible and computationally efficient. It makes no assumptions about the disease model and allows modelling of multiple putative variants. Moreover, it can be easily extended to handle a continuous phenotype, and work is ongoing to apply it to genetic association studies with a survival outcome.
We have also presented a simplified version of the proposed method, in which we restrict the number of clusters to two, which is equivalent to looking for a single marker that best separates cases from controls. This is appropriate when we suspect a single susceptibility allele in the region of interest. In this way, we remove some variability, since we fix one of the parameters, leading to improved performance. Although, in general, the version of BETA with a random number of clusters is more flexible and realistic, we recommend using both versions and comparing the results.
The incorporation of environmental covariates in the model could be made possible by assuming, for instance, a clusterspecific probit regression. However, this is likely to be computationally demanding. Moreover, in our presentation of the method, we have assumed that the haplotypes are inferred from the genotypes with certainty. Although haplotype reconstruction is more reliable with dense markers and regions of strong LD, phase uncertainty ideally should be incorporated into the analysis. For instance, a fairer comparison with univariate analysis should probably involve simulating genotypes and then running our method on estimated haplotypes. Haplotype reconstruction programs, such as PHASE [^{30}], output the posterior probabilities of haplotype pairs for each genotype, and we could randomly select the haplotype pair of an individual according to these posterior probabilities. This is the approach we used in the application to the real data from the CYP2D6 region. Alternatively, we could add a further MetropolisHastings (MH) step and sample from the different haplotype reconstructions and perform the rest of the analysis (as described in Materials and Methods) given the chosen phase.
Our Bayesian partition modelling involves two core analytical steps. We first split the genomic region under study into windows of high LD; this is done by sequentially constructing perfect phylogenies over the region of interest with window boundaries, which are deterministically defined by the locations where the perfect phylogeny assumption breaks down. Once the set of windows and corresponding trees have been identified, the Bayesian partition model searches through trees to identify those, if any, in which the corresponding set of haplotypes appear to form clusters that discriminate cases from controls, thus possibly harboring a causal variant. These two steps are described in detail next.
Over small genomic regions, where LD is strong and recombination is low, it is reasonable to assume that haplotypes have evolved according to a perfect phylogeny [^{24}]. Assuming nonrecurrent point mutations (in which case the infinitelymanysites model holds), we can construct a unique tree that describes the mutation history of a sample of haplotypes. The tree is a representation of the haplotype data and it is useful to think of the haplotype data as a tree, because the causal variant is embedded within the coalescent process describing the genealogy of the haplotypes under study [^{32}].
Consider, for example, the incidence matrix for the haplotype data reported in Table 9. Columns correspond to 12 diallelic SNPs and rows identify the unique haplotypes and we assume there are 800 haplotypes in total. Alleles at each SNP position are coded as 0 for the major allele (i.e., the most frequent in the population) and 1 for the minor allele. Data are compatible with a rooted phylogeny if and only if, for any two SNPs (or columns) in the incidence matrix, the pattern of (01, 10, 11) is not present. An explanation of this constraint is that since the infinitelymanysites model does not allow for back or recurrent mutation, the only way for these three gametic types to exist in the sample is for at least one recombination event to have occurred between the two sites [^{33}]. Therefore, the use of the perfect phylogeny model requires both observations of little or no recombination in DNA segments [^{1}?^{3},^{34}], and the infinitelymanysites assumption of population genetics.
It is possible to construct a gene tree when the perfect phylogeny condition is true for all pairs of SNPs of a study sample using, for example, Gusfield's algorithm [^{35},^{24}]. Figure 9 shows the gene tree for the haplotypes in Table 9. The nodes in the tree correspond to mutations that have generated the segregating sites and the gene tree is rooted at the haplotype with all major alleles. Mutations are ordered on the tree according to their relative age. If the causal mutation is embedded between SNPs 1 and 7, all descendant haplotypes of that lineage will inherit it and, therefore, we expect that most case haplotypes are among the 308 haplotypes that correspond to the first three branches of the tree (first three lines of Table 9). Thus, in the region of the disease locus, a sample of case haplotypes tend to have a morerecent shared ancestry than do control haplotypes, because many of them share a recent disease mutation. Note, however, that sporadic cases due to phenocopies, dominance, and epistasis introduce substantial noise in the phenotype?haplotype relationship, which influences the relative frequencies of nonpenetrant case haplotypes carried by unaffected controls and control haplotypes carried by affected cases.
The proposed method can be applied to a single candidate region, multiple candidate regions, and to finescale mapping. Recent studies suggest that recombination events occur preferentially outside genes [^{34},^{36}]. Thus, in the case of single or multiple candidate regions we assume that each gene lies in a region of high LD. Within each region, then, we assume, as described above, a coalescent model of evolution and the infinitelymanysites model and represent each gene with a separate tree. For finescale mapping, the chromosomal segment can be divided into a number of gene trees with boundaries determined by loci in which the perfect phylogeny assumption is violated. Details of how this is achieved are given in the following section.
A rooted perfect phylogeny (PP) assumption poses the constraint that, for any two SNPs in the incidence matrix, not all three combinations (01, 10, 11) exist. Recombination and back or parallel mutation leads to the possible existence of all three combinations. We have developed an R routine based on the algorithm of Lenhard [^{37}] that scans a chromosomal region consisting of m markers and splits the region into subregions that satisfy the PP condition. In particular, starting from SNP S_{1}, it checks the PP condition between SNPs S_{1} and S_{2}. If the condition is true, it checks the condition between pairs S_{1} and S_{3}, and S_{2} and S_{3}. If the condition is not valid for SNPs S_{ 1} and S_{ 3}, then SNPs S_{ 1} and S_{ 2} form a gene tree and the procedure is repeated starting from SNP S_{ 3}. The same happens if the condition is valid for S_{ 1} and S_{ 3}, but not for S_{ 2} and S_{ 3}. If the condition is true for both pairs, the algorithm checks the PP assumption pairwise between SNPs S_{ 4} and S_{ 1}? S_{ 3}. Generally, if the pattern of (01, 10, 11) is identified between SNPs S_{i} and S_{j} (for every i < j), but not identified for any pairs between S_{k}_{1} and S_{k}_{2} (for i ? k1 < k2 < j), then SNPs S_{i} ? S_{j}_{? 1} form a perfect phylogeny, and the procedure is repeated starting from SNP S_{j}. However, note that this algorithm leads to only one of the possible tree configurations for the chromosomal region under study, since using different SNPs as a starting point may result in different tree configurations.
As mentioned earlier, the proposed method splits the haplotype space into disjoint clusters on the basis of haplotype similarity, with the number of clusters unknown, a priori. To measure the closeness of one haplotype to another, we adopt a distance that has an evolutionary interpretation, with sequences sharing a cluster depending on the time to their most recent common ancestor. Thus, the distance metric is based on the relative ages of the mutations in the sample or on the order with which the mutations have arisen in the haplotype sample, which is provided by the topology of the gene tree. Any SNP set selected as cluster centres can therefore be time ordered, and we assign haplotypes to clusters according to the relative ages of the centres. Suppose, for example, that SNPs 4, 5, and 7 of Figure 9 are selected as cluster centres. SNP 7 is older than SNP 5, and SNP 4 is on a different branch, implying that a haplotype carrying mutation 4 cannot carry mutation 5 or 7. Starting with SNP 5, we assign the haplotypes that correspond to the first two branches of the tree (namely, the first two haplotypes in Table 9) as members of this cluster. The only member of the cluster with SNP 7 as centre is the third haplotype, because, although the first two haplotypes carry mutation 7, they have been already allocated to a cluster. The seventh, eighth, and ninth haplotypes are allocated to a separate cluster with centre SNP 4, and all remaining haplotypes are assigned to a hypothetical ?null? cluster, which can be interpreted as a baseline risk group. Therefore, the choice of the centres defines the way that haplotypes are assigned to their clusters. Given the centres, every haplotype is deterministically allocated to the cluster with the closest centre, using the metric above.
Haplotypes within each cluster have clusterspecific risks of disease, which are assumed to be exchangeable and to come from some simple distribution. As mentioned earlier, this is intended to capture the fact that haplotypes that are similar to each other in the region of a putative causal mutation are likely to be associated with similar risks of disease. An MCMC algorithm is developed to obtain posterior samples of quantities of interest, averaging over the space of possible partitions. In particular, we are interested in the posterior distribution of the number of clusters and the posterior probability that each SNP is chosen as a cluster centre. For example, in the extreme scenario of a fully penetrant variant that is among the set of typed markers, we expect a high posterior probability of having only two clusters, namely, the cluster with the causal variant as cluster centre and the ?null? cluster.
For simplicity, let us first consider the case in which the haplotype data form a single perfect phylogeny, as in Table 9. Assume that the haplotype space is currently partitioned into n_{c} = n_{clust} + 1 independent clusters (n_{c} includes the ?null? cluster, while n_{clust} is the number of SNPs selected as cluster centres). A convenient approach to parameterising the space of possible partitions is to introduce an indicator vector ?, with ? = (?_{1},??_{nSNP}), with ?_{k} in {0,1}, k = 1,?,n_{SNP}, such that ?_{k} = 1 if the kth SNP is selected as cluster centre and ?_{k} = 0 otherwise, where n_{SNP} is the number of SNPs in the dataset. That is, there is a onetoone map from the space of possible partitions to the sample space of ?.
Next, y_{ij} in {0,1} is the disease status indicator of haplotype i = 1,?,n_{j} in cluster j = 1,?,n_{c}. The vector of responses for cluster j is denoted by D_{j} = (y_{1j},y_{2j},?y_{nj}_{j}) and let D = {D_{j}, j = 1,?,n_{c}}. Each y_{ij} is assumed to have a Bernoulli distribution with parameter ?_{j}, the disease risk associated with cluster j. The Bayesian formulation is completed by specifying priors on the parameters ? and ?. We assume a uniform prior on ?, i.e., the probability of each cluster configuration is equal to 1/2^{nSNP}. Note that this induces a probability distribution on the number of cluster centres; the probability of having n_{clust} cluster centres is equal to . Clusterspecific risks are then given a conjugate Beta distribution with parameters ? and ?. This choice of prior distributions leads to computational advantages. In particular, the posterior distribution of ? is proportional to the product of its prior distribution and the marginal probability of the data where the latter is available analytically as
where ? denotes the Gamma function and ? = .Similarly, the full conditional distribution of the risk parameters is readily sampled from, as it is available in closed form
In the case of n_{tr} perfect phylogenies or trees (i.e., when we split the regions into separate windows or where we consider more than one candidate region), an extra layer is added in the hierarchy of the model, since the partition ? is now conditional on the tree T selected to cluster haplotypes. In particular, we specify a uniform prior on the trees, so that, a priori, each tree is equally likely to contain the putative mutation (recall that the underlying rationale is to exploit between marker LD around a putative causal variant, independent of the extent of LD or number of markers corresponding to each tree). The joint prior distribution of a gene tree T and a partition ? is given by
where denotes the number of segregating sites in gene tree T. Details of the proposed MCMC algorithm are given later on.Note that instead of assuming a uniform prior on the trees, we could use a more informative prior distribution. For example, if the average marker density is large, we would expect recombination to break the perfect phylogeny condition frequently, resulting in several trees with a small number of SNPs and a few trees with a larger number of SNPs. In this case, it might be more appropriate to use a prior distribution that favours trees with a small number of markers, such as the geometric distribution.
Upon convergence, from the posterior sample of partitions we obtain the posterior probability that the causal mutation is embedded in the ancestry of each of the gene trees. The mean and standard deviation of the posterior risk associated with each unique haplotype in the sample are also obtained. Furthermore, we estimate the Bayes factor in favour of association at each marker, which is given by the ratio of the posterior odds to prior odds [^{26}]. The prior of each SNP being a cluster centre is evaluated by simulation using Equation 3. Finally, we use the location of the SNP with the highest marginal posterior probability of being a cluster centre as an estimate of the location of the susceptibility allele.
For the proposed method, it is straightforward to construct credible intervals for the estimated location of the causative SNP. At each iteration of the MCMC algorithm, we obtain an estimate of the causal location by averaging the locations of the markers currently selected as cluster centres. Thus, upon convergence, we obtain a posterior distribution of locations, from which a credible interval can be constructed. Under the default simulation scenario, in 43 out of the 50 replicates, the 95% credible interval contained the true causal locus. Figure 10 shows the posterior densities of the putative location of the causative variants, together with 95% credible intervals for two datasets simulated with 1.8 and 2.4 GRR(Aa), with all other simulation parameters set at their default values. The credible intervals are 150 and 15 kb wide, respectively.
To assess the sensitivity of the results to prior specification, we assigned Gamma(10,10) hyperpriors to the parameters ? and ? of the Beta prior on disease risks. We then ran the model for 100 different datasets simulated with variable recombination rate, additive disease model with GRR(Aa) 2, SNP density 1 kb, 200 cases and controls, MAF 5%, and MAF of the causal SNP 5%?7%, and obtained an average distance of 274.66 kb (22.98 kb standard error), compared to an average distance of 237.49 kb (25.17 kb standard error) of the standard model. As expected, in this case, the average distance was higher than before, since we allowed for more sources of uncertainty. However, both models resulted in a similar average number of clusters.
Considering the case of a single perfect phylogeny, we use a MH step to sample from the full conditional distribution of the vector ? given the data. Namely, we consider two possible moves in the partition space: (1) Birth step: adding a cluster centre. (2) Death step: deleting a cluster centre.
Each move entails selecting a SNP at random, and proposing to change , if the current ?_{i} = 0 (birth) or otherwise. Thus, the proposal distribution q(?^{*}?) is simply 1/n_{SNP}. Given the cluster centres, the observed haplotypes are deterministically allocated to the haplotype clusters according to the time in which they share a common ancestor in the genealogy with the cluster centres (as described earlier). Since we assume a conjugate Beta distribution for ?, the acceptance probability simplifies to min(1,Bayes factor(?^{*},?)) = min(1,p(D?^{*},?,?)/p(D?,?,?)), where the marginal probability is calculated using Equation 1.
In the case of n_{tr} perfect phylogenies, we need an extra MCMC step in which we sample the tree containing the putative mutation. At each MCMC iteration, we now have two MH steps: (1) Change partition step: sample a new partition from the posterior distribution of the number of clusters and the cluster centres without changing the current gene tree. (2) Update tree: sample a new tree and a new partition from their joint posterior distribution.
The first MH step is the same as the one used in the case of a single gene. For the second MH step, assuming a uniform prior on the trees, the joint prior distribution of a gene tree T and a partition ? is given by Equation 3. In particular, we first sample a tree from the n_{tr} possible trees with probability 1/n_{tr}, and then each SNP in the tree has a 0.5 probability of being a cluster centre. Therefore, the proposal move in the tree and the partition space is equal to Equation 3. This leads to an acceptance probability for the second MH sampler that again only involves the Bayes factor in favour of the proposed partition over the current partition. In summary, the MCMC algorithm is:
 Randomly choose a gene tree and initialize the partition (and therefore the T and ? parameters) within the tree. Calculate the marginal probability of the model under partition ?.
 Within the current tree T, choose randomly one SNP, i.e., SNP S_{i}, and switch its ?_{i} indicator from zero to one (and vice versa), thus proposing a new partition ?^{*}. Allocate haplotypes to the cluster with the ?closest? centre. Calculate the marginal probability of the data under the proposed partition ?^{*} using equation 1.
 Evaluate the Bayes factor in favour of ?^{*}, and calculate the acceptance probability. If accepted, set ? = ?^{*}.
 Randomly choose a gene tree T^{*}, and propose a move for ? given T^{*} by generating ?^{*} from the prior. Allocate haplotypes to the cluster with the ?closest? centre. Calculate the marginal probability of the data under the proposed partition ?^{*} using Equation 1.
 Evaluate the Bayes factor in favour of ?^{*}, and calculate the acceptance probability. If accepted, set T = T^{*} and ? = ?^{*}.
 Repeat steps 2?5 until convergence.
Marginal posterior probability of association from BETA (top left), Bayes factor in favour of association at each marker from BETA (top right), pvalues from Margarita and Fisher's exact test (bottom left), and posterior density of location from HAPCLUSTER (bottom right), where the dot on the xaxis indicates the position of the susceptibility mutation. (This legend applies to Figures S1?S14.)
(141 KB EPS)
Figure S2 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(140 KB EPS)
Figure S3 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S4 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S5 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S6 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S7 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S8 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(140 KB EPS)
Figure S9 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(142 KB EPS)
Figure S10 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S11 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S12 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S13 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Figure S14 Results from BETA, Margarita, HAPCLUSTER, and Fisher's Exact Test from a CaseControl Study under the Default Scenario
(141 KB EPS)
Table S1 Performance Comparison
Performance comparison of BETA with HAPCLUSTER and single locus analysis for MAF of the causal SNP equal to 5%?7% and number of case/control genotypes equal to 200, and for different SNP densities, minor allele frequencies, and GRRs. Results obtained over 100 repeats under each scenario.
(34 KB DOC)
Click here for additional data file (pgen.0030111.st001.doc)
Table S2 Performance Comparison
Performance comparison of BETA with HAPCLUSTER and single locus analysis for MAF of the causal SNP equal to 10%?15% and number of case/control genotypes equal to 200, and for different SNP densities, minor allele frequencies, and GRRs. Results obtained over 100 repeats under each scenario.
(34 KB DOC)
Click here for additional data file (pgen.0030111.st002.doc)
Notes
ack1Author contributions. IT implemented the proposed method, performed the simulation studies, applied the method to the real data, and wrote the paper. CJV helped design the simulation studies, gave input on genetic aspects of the paper, proposed ways of summarising properties of the method, and read and commented on drafts of the paper. MDI had the idea of the proposed method, planned the algorithm implementing the method, supervised the work, and read and commented on drafts of the paper.
ack2Funding. IT acknowledges funding for her Ph.D. studies from the Wellcome Trust, United Kingdom.
ack3Competing interests. The authors have declared that no competing interests exist.
We would like to thank Louise Hosking from GlaxoSmithKline, Harlow, United Kingdom, for providing the CYP2D6 data. Many thanks to Taane Clark and Clive Hoggart for providing the two FREGENE simulated populations. We also thank the three anonymous reviewers whose comments and valuable suggestions helped us improve the manuscript.
ARG  ancestral recombination graph 
GRR  genetic relative risk 
LD  linkage disequilibrium 
MAF  minor allele frequency 
MCMC  Markov Chain Monte Carlo 
MH  MetropolisHastings 
PP  perfect phylogeny 
SNP  single nucleotide polymorphism 
References
Daly M,Rioux JD,Schaffner SF,Hudson TJ,Lander ES. 2001;Highresolution haplotype structure in the human genomeNat Genet 29:229–232. [pmid: 11586305]  
Gabriel SB,Schaffner SF,Nguyen H,Moore JM,Roy J,et al. 2002;The structure of haplotype blocks in the human genomeScience 296:2225–2229. [pmid: 12029063]  
Reich DE,Schaffner SF,Daly MJ,McVean G,Mullikin JC,et al. 2002;Human genome sequence variation and the influence of gene history, mutation and recombinationNat Genet 32:135–142. [pmid: 12161752]  
Molitor J,Marjoram P,Conti D,Thomas D. 2004;A survey of current Bayesian gene mapping methodsHuman Genomics 1:371–374. [pmid: 15588497]  
Molitor J,Marjoram P,Thomas D. 2003;Application of Bayesian spatial statistical methods to analysis of haplotypes effects and gene mappingGenet Epidemiol 25:95–105. [pmid: 12916018]  
McPeek MS,Strahs A. 1999;Assessment of linkage disequilibrium by the decay of haplotype sharing, with application to finescale genetic mappingAm J Hum Genet 70:686–707.  
Liu JS,Sabatti C,Teng J,Keats BJB,Risch N. 2001;Bayesian analysis of haplotypes for linkage disequilibrium mappingGenome Res 11:1716–1724. [pmid: 11591648]  
Molitor J,Marjoram P,Thomas D. 2003;Finescale mapping of disease genes with multiple mutations via spatial clustering techniquesAm J Hum Genet 73:1368–1384. [pmid: 14631555]  
Yu K,Martin RB,Whittemore AS. 2004;Classifying disease chromosomes arising from multiple founders, with application to finescale haplotype mappingGenet Epidemiol 27:173–181. [pmid: 15389930]  
Durrant C,Zondervan KT,Cardon LR,Hunt S,Deloukas P,et al. 2004;Linkage disequilibrium mapping via cladistic analysis of singlenucleotide polymorphism haplotypesAm J Hum Genet 75:35–43. [pmid: 15148658]  
Waldron ERB,Whittaker JC,Balding DJ. 2006;Fine mapping of disease genes via haplotype clusteringGenet Epidemiol 30:170–179. [pmid: 16385468]  
Thomas DC,Stram DO,Conti D,Molitor J,Marjoram P. 2003;Bayesian spatial modeling of haplotype associationsHum Hered 56:32–40. [pmid: 14614236]  
Rannala B,Reeve JP. 2001;Highresolution multipoint linkagedisequilibrium mapping in the context of a human genome sequenceAm J Hum Genet 69:159–178. [pmid: 11410841]  
Morris AP,Whittaker JC,Balding DJ. 2002;Finescale mapping of disease loci via shattered coalescent modelling of genealogiesAm J Hum Genet 70:686–707. [pmid: 11836651]  
Z?llner S,Pritchard JK. 2005;Coalescentbased association mapping of complex trait lociGenetics 169:1071–1092. [pmid: 15489534]  
Minichiello MJ,Durbin R. 2006;Mapping trait loci by use of inferred ancestral recombination graphsAm J Hum Genet 79:910–922. [pmid: 17033967]  
Denison DGT,Holmes CC. 2001;Bayesian partitioning for estimating disease riskBiometrics 57:143–149. [pmid: 11252589]  
Seaman SR,Richardson S,St?cker I,Benhamou S. 2002;A Bayesian partition model for casecontrol studies on highly polymorphic candidate genesGenet Epidemiol 22:356–368. [pmid: 11984867]  
Morris AP. 2005;Direct analysis of unphased SNP genotype data in populationbased association studies via Bayesian partition modelling of haplotypesGenet Epidemiol 29:91–107. [pmid: 15940704]  
Morris AP. 2006;A flexible Bayesian framework for modeling haplotype association with disease, allowing for dominance effects of the underlying causative variantsAm J Hum Genet 79:679–694. [pmid: 16960804]  
Hosking LK,Boyd PR,Xu CF,Nissum M,Cantone K,et al. 2002;Linkage disequilibrium mapping identifies a 390 kb region associated with CYP2D6 poor drug metabolising activityPharmacogenomics J 2:165–175. [pmid: 12082588]  
Hoggart C,Taane C,Lampariello R,Whittaker J,De Iorio M,et al. (Department of Epidemiology and Public Health)2005FREGENE: Software for simulating large genomic regions. London: Imperial College, University of London;  
Tzeng JY. 2005;Evolutionarybased grouping of haplotypes in association analysisGenet Epidemiol 28:220–231. [pmid: 15726584]  
Griffiths RC. 2001Ancestral inference from gene treesDonnelly P,Foley RAGenes, fossils, and behaviour: An integrated approach to human evolutionNATO Science Series A, Life Sciences Amsterdam: IOS Press; :137–172.  
R Development Core Team. 2004R: A language and environment for statistical computing. R Foundation for Statistical Computing; Available: http://www.rproject.org. Accessed 5 June 2007.  
Kass RE,Raftery AE. 1995;Bayes factorsJASA 90:773–795.  
Verzilli CJ,Stallard N,Whittaker JC. 2006;Bayesian graphical models for whole genome association studiesAm J Hum Genet 79:100–112. [pmid: 16773569]  
Morris AP,Whittaker JC,Xu CF,Hosking LK,Balding DJ. 2003;Multipoint linkagedisequilibrium mapping narrows location interval and identifies mutation heterogeneityProc Natl Acad Sci U S A 100:13442–13446. [pmid: 14597696]  
Maniatis N,Morton NE,Gibson J,Xu CF,Hosking LK,et al. 2005;The optimal measure of linkage disequilibrium reduces error in association mapping of affection statusHum Mol Genet 14:145–153. [pmid: 15548543]  
Stephens M,Smith N,Donnelly P. 2001;A new statistical method for haplotype reconstruction from population dataAm J Hum Genet 68:978–989. [pmid: 11254454]  
Seltman H,Roeder K,Devlin B. 2003;Evolutionarybased association analysis using haplotype dataGenet Epidemiol 25:48–58. [pmid: 12813726]  
Clayton D,Chapman J,Cooper J. 2004;Use of unphased multilocus genotype data in indirect association studiesGenet Epidemiol 27:415–428. [pmid: 15481099]  
Hudson RR,Kaplan N. 1985;Statistical properties of the number of recombination events in the history of a sample of DNA sequencesGenetics 111:147–164. [pmid: 4029609]  
McVean GA,Myers SR,Hunt S,Deloukas P,Bentley DR,et al. 2004;The finescale structure of recombination rate variation in the human genomeScience 304:581–584. [pmid: 15105499]  
Gusfield D. 1991;Efficient algorithms for inferring evolutionary treesNetworks 21:19–28.  
Myers S,Bottolo L,Freeman C,McVean G,Donnelly P. 2005;A finescale map of recombination rates and hotspots across the human genomeScience 310:321–324. [pmid: 16224025]  
Lenhard J. 1997Kritische Untersuchung einer Methode zur Sch?tzung Phylogenetischer Gr?ssen [Ph.D. thesis]. Frankfurt: Johann Wolfgang Goethe University; 
Figures
[Figure ID: pgen0030111g001] 
Figure 1
Results from BETA, Margarita, HAPCLUSTER and Fisher's Exact Test from a Single Dataset with One Susceptibility Allele under the Default Scenario
Marginal posterior probability of association from BETA (top left), Bayes factor in favour of association at each marker from BETA (top right), pvalues from Margarita and Fisher's exact test (bottom left), and posterior density of location from HAPCLUSTER (bottom right), where the dot on the xaxis indicates the position of the susceptibility mutation. 
[Figure ID: pgen0030111g002] 
Figure 2
Perfect Phylogeny with the Highest Posterior Probability of Containing the Susceptibility Allele
At the bottom of each branch we report the case and control multiplicities of each unique haplotype in the tree. 
[Figure ID: pgen0030111g003] 
Figure 3
Results of Fisher's Exact Test and BETA from a Single Dataset with Two Susceptibility Alleles
pValues from Fisher's exact test for singlemarker disease association (top left), the marginal posterior probability of association from BETA (top right), and the Bayes factor in favour of association at each marker from BETA (bottom centre), where the dots on the xaxis indicate the positions of two susceptibility mutations. 
[Figure ID: pgen0030111g004] 
Figure 4
Cumulative Distribution of Distances between the Association Peak and the Causal SNP
Analysis of 50 datasets simulated under the default scenario, namely variable recombination rate, additive disease model, 1,000 cases and controls, SNP density of 1 kb, MAF of causal allele 5%, and 1.6 GRR(Aa). 
[Figure ID: pgen0030111g005] 
Figure 5
Average Number of Significant Associations within an Interval around the Causal SNP
Analysis of 50 datasets simulated under the default scenario, namely variable recombination rate, additive disease model, 1,000 cases and controls, SNP density 1 kb, MAF of causal allele 5%, and 1.6 GRR(Aa). For ?BETA strong signal? and ?BETA decisive signal,? we consider markers with Bayes factors ?10 and ?150, respectively. For ?Fisher's exact test? and ?Fisher's exact test Bonferroni? we consider markers with pvalues ?0.05 and the Bonferroniadjusted value respectively. For Margarita we consider the markerwise pvalues calculated by permutation, while ?Margarita Bonferroni? and ?Margarita corrected? correspond to pvalues corrected for multiple testing using Bonferroni and permutations, respectively. 
[Figure ID: pgen0030111g006] 
Figure 6
Power for a Range of Models
Probability of a significant signal within 100 kb of the causal allele. Each point on the xaxis corresponds to 50 datasets under each of the simulation parameters while keeping the rest at their default values. The two points that do not belong to a line correspond to the default scenario for Margarita markerwise pvalues calculated by permutation and Margarita experimentwise pvalues calculated by permutation. For ?BETA strong signal? and ?BETA decisive signal? we consider markers with Bayes factors ?10 and ?150, respectively. 
[Figure ID: pgen0030111g007] 
Figure 7
Mean FalsePositive Rates (%) for Various Models
Each point on the xaxis corresponds to 50 datasets under each of the simulation parameters while keeping the rest at their default values. The three points that do not belong to a line correspond to the default scenario for Margarita markerwise pvalues calculated by permutation with or without Bonferroni correction, and Margarita experimentwise pvalues calculated by permutation. 
[Figure ID: pgen0030111g008] 
Figure 8
Results of Fisher's Exact Test and BETA Using the CYP2D6 Dataset
pValues from Fisher's exact test for single markerdisease association (top left), the marginal posterior probability of association (top right) and the Bayes factor in favour of association at each marker (bottom centre) from the CYP2D6 gene region, where the vertical line on the xaxis indicates the location of CYP2D6. 
[Figure ID: pgen0030111g009] 
Figure 9
The Gene Tree Consistent with the Haplotypes in the Incidence Matrix of Table 6
Labels 1?12 refer to mutations S1?S12. At the bottom of each branch we report the multiplicity of each observed haplotype in the sample. 
[Figure ID: pgen0030111g010] 
Figure 10
Posterior Density of Location of Causal Allele and 95% Credible Intervals
Credible intervals (95%) of causal location for two datasets simulated with 1.8 and 2.4 GRR(Aa) and all other simulation parameters at default values. The credible intervals are 150 kb and 15 kb wide, respectively. 
Tables
Posterior Probability of Each Gene Tree Carrying the Liability Allele and the Corresponding Bayes Factor in Favour of Association with the Disease
Marginal Posterior Probability of Each SNP Being a Cluster Centre and the Corresponding Bayes Factor (Only Those SNPs with Posterior Probabilities Greater than 0.01 Are Reported)
Average Location Errors (in kb) for BETA, HAPCLUSTER, and Single Locus Analysis for Different Number of Cases and Controls with All Other Simulation Parameters Set at Default Values
Average Location Errors (in kb) for BETA, HAPCLUSTER, and Single Locus Analysis for Different Allele Frequencies of the Causative Variant with All Other Simulation Parameters Set at Default Values
Average location errors (in kb) for BETA, HAPCLUSTER and single locus analysis for different genotype relative risks with all other simulation parameters set at default values
Average Location Errors (in kb) for BETA, HAPCLUSTER, and Single Locus Analysis for a Dominant Disease Model, SNP Density of 3 kb, or Uniform Recombination
Average Distance (in kb) from the True Location of the Liability Loci Together with Its Standard Error for Margarita over 50 Replicates under the Default Simulation Scenario
Article Categories:

Previous Document: DNA damage, homologydirected repair, and DNA methylation.
Next Document: CTCF genomic binding sites in Drosophila and the organisation of the bithorax complex.