- Methodology article
- Open Access
Using an evolutionary algorithm and parallel computing for haplotyping in a general complex pedigree with multiple marker loci
- Sang Hong Lee^{1, 2}Email author,
- Julius HJ Van der Werf^{1} and
- Brian P Kinghorn^{1}
https://doi.org/10.1186/1471-2105-9-189
© Lee et al; licensee BioMed Central Ltd. 2008
- Received: 19 September 2007
- Accepted: 11 April 2008
- Published: 11 April 2008
Abstract
Background
Haplotype reconstruction is important in linkage mapping and association mapping of quantitative trait loci (QTL). One widely used statistical approach for haplotype reconstruction is simulated annealing (SA), implemented in SimWalk2. However, the algorithm needs a very large number of sequential iterations, and it does not clearly show if convergence of the likelihood is obtained.
Results
An evolutionary algorithm (EA) is a good alternative whose convergence can be easily assessed during the process. It is feasible to use a powerful parallel-computing strategy with the EA, increasing the computational efficiency. It is shown that the EA can be ~4 times faster and gives more reliable estimates than SimWalk2 when using 4 processors. In addition, jointly updating dependent variables can increase the computational efficiency up to ~2 times. Overall, the proposed method with 4 processors increases the computational efficiency up to ~8 times compared to SimWalk2. The efficiency will increase more with a larger number of processors.
Conclusion
The use of the evolutionary algorithm and the joint updating method can be a promising tool for haplotype reconstruction in linkage and association mapping of QTL.
Keywords
- Likelihood Evaluation
- Large State Space
- Haplotype Reconstruction
- Allele Assignment
- Haplotype Configuration
Background
Haplotypes can give useful information about patterns of inheritance for genomic regions. For each region, the probability of sharing founder genes through segregation in a recorded pedigree can be estimated based on the haplotypes, i.e. identity by descent (IBD) probability based on linkage (e.g. [1–3]). The probability of sharing the genes from a common ancestor before the recorded pedigree can also be estimated based on the haplotypes, i.e. IBD probability based on linkage disequilibrium (LD) (e.g. [4–7]). Those probabilities derived from the haplotypes are essential information for linkage mapping and association mapping.
Since haplotypes would not be directly observed from genotypic data, they need to be inferred based on observed pedigree information and marker genotypes. This would often result in a large state space of possible haplotype configurations especially with general pedigrees and incomplete genotypic data for multiple markers. Exact likelihood methods using pedigree peeling [8], chromosome peeling [9] or a combination of both algorithms often have problems dealing with the large state space and therefore have difficulties in finding the optimal haplotypes.
Alternatively, combinatorial optimization algorithms can be used. These are able to deal with problems that are hard to solve in polynomial time (NP hard). One strategy used in such algorithms is to search for haplotype configurations that require a minimum number of recombination events [10–12] or no recombination events [13]. These approaches are rule-based and do not make any assumptions about genetic distances between markers. Another approach is statistically based and would search for haplotype configurations with the highest likelihood, given all observed variables and known marker distances [14–16].
A widely used statistical approach for haplotype reconstruction is simulated annealing (SA) [17] which has been implemented in the linkage software, SimWalk2 [15, 18]. SimWalk2 uses a random walk approach [19] to find candidates and an annealing process to develop the consecutive solutions to reach the optimal haplotypes. SimWalk2 constitutes a flexible and efficient algorithm for haplotyping and probably the only one used for a general complex pedigree with incomplete genotypes. However, it needs a very large number of sequential evaluations and it is not always guaranteed that the most likely solutions are found within the arbitrarily determined number of evaluations.
Evolutionary algorithms (EA) [20] constitute an efficient tool for solving combinatorial optimization problems. A number of parallel solutions are respectively updated (evolved) by changing the variables within each solution (EA-mutation), or recombining them from different solutions (EA-recombination), and the most favorable solutions are selected (EA-selection). Compared to SA, EA may be competitive in efficiently finding an optimal solution. An important advantage of EA is its potential to parallellise computations because the algorithm can be divided across multiple CPUs. This would substantially reduce computing time. Moreover, the search mechanism in EA can make it easier to diagnose convergence compared to that in SimWalk2. It is well known that EA can be easily designed and parameterised for a specific problem, and standard values for EA-parameters usually give reasonably good results [21].
In addition, jointly updating the set of dependent variables can increase the computational efficiency although not all sets of dependent variables may be found. It is noted that SimWalk2 attempts to update multiple variables together, but the set that is updated is randomly chosen (random walk approach). Because dependent variables are not necessarily within the same set, the acceptance rates are generally low.
An evolutionary algorithm has not been implemented before in statistical approaches for haplotyping. The aim of this study is to investigate the use of an evolutionary algorithm and joint updating strategy for haplotyping, and compare its efficiency with SimWalk2.
Results
Likelihood pattern with simulated data
Log likelihood of the best haplotypes found by SimWalk2, EA1 and EA2 with simulated data
Complete genotypic data | ||||
---|---|---|---|---|
no. evaluations^{‡}: | 20000 | 100000 | 500000 | 16000000* |
SimWalk2 | -1960.81 | -1827.53 | -1804.93 | -1801.7 (32 minutes)^{¶} |
EA1 | -2197.17 | -1852.43 | -1802.16 | -1800.55 (9 minutes) |
EA2 | -2299.78 | -1848.51 | -1802.39 | -1800.55 (10 minutes) |
Incomplete genotypic data | ||||
no. evaluations^{‡}: | 40000 | 400000 | 4000000 | 16000000 |
SimWalk2 | -943.83 | -791.41 | -769.97 | -767.43 (12 minutes) |
EA1 | -1108.24 | -791.18 | -766.74 | -764.66 (6 minutes) |
EA2 | -1112.86 | -782.19 | -765.59 | -764.43 (7 minutes) |
When using incomplete genotypic data, the likelihood values are not yet converged after 40,000 evaluations. After 400,000 evaluations, the likelihood values appear to be fairly close to the global maximum where the value for EA2 is the highest among the three methods (the values for EA1 and SimWalk2 are similar). After 4,000,000 evaluations, the likelihood reaches stable values with apparent convergence where the value for EA2 is the highest and the value for SimWalk2 is the worst. It is noted that the convergence patterns and the evaluation numbers are different between complete and incomplete genotypes.
Likelihood pattern with real data
Log likelihood of the best haplotypes found by SimWalk2, EA1 and EA2 with real data
No. evaluations: | 260000 | 520000 | 1050000 | 2100000 | 21000000 |
---|---|---|---|---|---|
SimWalk2 | -24439.02 | -23551.84 | -23312.14 | -23193.18 | -23159.19 (434 minutes)^{¶} |
EA1 | -25992.16 | -24258.61 | -23368.69 | -23164.58 | -23158.60 (106 minutes) |
EA2 | -25900.78 | -23871.49 | -23194.87 | -23158.39 | -23158.39 (126 minutes) |
Computing time for a fixed number of evaluations with 4 processors
The relative computing time between SimWalk2, EA1 and EA2 with 4 processors varies depending on data structure. When using simulated data with complete genotypes, the computing time completing 16,000,000 evaluations for EA1 and EA2 was 3.5 times and 3.2 times faster than SimWalk2 (Table 1). However, when using simulated data with incomplete genotypes, the relative computing efficiency for EA was decreased; EA1 was 2 times and EA2 was 1.7 times faster than SimWalk2 (Table 1). When using the real data, the computing time completing 21,000,000 evaluations for EA 1 and EA2 was 4.1 times and 3.5 times faster than SimWalk2 (Table 2). The larger advantage for EA for a larger data set is probably due to the fact that the proportion of transferring time over whole computing time increases when using a data set of small size with a few genotypes, e.g. simulated data with incomplete genotypes.
Convergence diagnosis and computational efficiency
Discussion
The EA1 and EA2 reach the global or nearly global maximum quicker than SimWalk2 both with simulated and real data. This was probably due to the fact that EA1 and EA2 used a number of parallel configurations which apparently is a more efficient searching mechanism, resulting in a wider range of variables updated during the cycles. Using an efficient joint updating strategy combined with the random walk, EA2 significantly outperformed SimWalk2 with a simultaneous use of multiple processors.
Convergence for EA1 (EA2) or SimWalk2 can be assessed by comparison of the likelihood values between different parts to check if the likelihood reaches a stable value (e.g. Figure 1). When the likelihood value is not converged, SimWalk2, as currently implemented, requires another complete run with a new annealing schedule which would need to be longer than the previous run. Therefore, SimWalk2 may need multiple runs with a large number of evaluations. However, in the EA, the convergence of the likelihood value can be checked at any time and any point during the run without any rescheduling or rerun. For convergence diagnosis shown in Figure 1, SimWalk2 needed to run more than 4 times because of rescheduling of the annealing process for each point (Figure 1). However, EA1 and EA2 needed only a single run for the same convergence assessment.
The EA population size was arbitrarily set at N = 10. The chance of operating EA-recombination or EA-mutation was randomly equal, i.e. the probability of EA-recombination (or EA-mutation) was ~0.5. Different EA-parameters did not dramatically affect the results unless the values were extreme, e.g. outside the range 4 – 30 for N or outside the range 0.25~0.75 for the probability of EA-recombination (or EA-mutation). If there are hundreds of CPUs available (possibly in the near future), then N should not be less than the number of CPUs used, to maximize the efficiency of parallel computing. Such large values for N for large scale parallel computing should be tested with regard to optimal performance. However, it is possible to set N considerably higher than optimal, and computational efficiency is still increased.
In the real data, we used 13 microsatellites on the same chromosome positioned at 12 cM intervals on average. However, a much larger number of markers is expected to be used soon, e.g. thousands of single nucleotide polymorphisms (SNP) at << ~1 cM intervals on a single chromosome. The EA with hundreds of CPUs may be able to parallelize and solve the increased size of the problem within a reasonable time. Haplotypes for dense markers might be resolved using population LD without pedigree information [22–24]. However, when population LD is not significant over the average marker distance, the methods may perform poorly [25]. Therefore, when LD is not sufficient or one may not be sure whether there is enough LD, our approach will be an efficient tool for haplotyping for most types of data.
When using multiple CPUs and multiple machines, data transfer between machines took a large part of the overall computing time. Therefore, the EA was slightly modified in order to save on transfer time. There were N nodes for EA-members parallelised between machines. We made each node have two EA-members (two sets of solutions). EA-mutation and EA-recombination were carried out in each node, and the solutions were evolved. One set of solutions in each node was moved to the next node (the order of the nodes was randomly determined) every n cycles, therefore a complete evolutionary mechanism was performed with periodic isolation of islands (nodes). The number for n was chosen as n = total number of iterations/k, which resulted in k transfers between nodes in an analysis. It is noted that n should be a sufficient number for EA-mutation and EA-recombination within each node, and k should be a sufficient number for communicating between the nodes. In this study, we chose a large number k = 800 which would be sufficient for n as well because we usually used the total number of iterations ≥ number of meiosis × number of markers × 800. Such a strategy becomes more important when using many different machines.
We used data sets having complex relationships with incomplete genotypes. Such data sets are quite common in natural and outbred populations [26]. Complex pedigrees with incomplete genotypes will generally generate a too large state space for haplotying, which cannot be handled by exact methods [8, 9, 27]. However, SimWalk2 has been successfully and widely used for such data sets although the size of data should be small or moderate. We showed that our approach could handle such data sets, and the computational efficiency for our approach was much higher than that for SimWalk2.
Conclusion
The difference between EA and SA is mainly determined by the parameters used in their search mechanism, which affect the number of configurations considered in the cycles and updating strategies, and how information from different solutions is used to generate new candidate solutions. The EA algorithm has a substantial advantage in convergence assessment and parallel computing, which would much increase the efficiency of haplotype reconstruction (up to ~4 times with 4 CPU). Moreover, with the joint updating scheme, EA2 significantly outperformed SimWalk2 (up to ~8 times with 4 CPU). With more CPU, the computational efficiency of EA2 would be increased. In addition, our implementation of EA1 and EA2 for this application is likely to leave much room for increased performance, given the wide range of structural and parameterization strategies that could be invoked. Further study would be required to investigate such potential.
Methods
Distribution of segregation states given marker data and pedigree
where G represents the observed marker data, pr(S) is prior probability of the segregation indicators and haplotype configuration, pr(G|S) is the probability of the observed marker data given S, and the denominator is summed over the probabilities of all possible configurations of S.
Haplotyping
There can be a large number of combinations for allele assignment to founder genes. A specific assignment of alleles to each founder gene combined with S defines the haplotype for each individual in the pedigree. The most likely haplotype configuration can be determined based on its likelihood [15, 18].
Likelihood estimation
where S_{ ij }is the segregation indicator for the i^{ th }meiosis at the j^{ th }locus, θ_{ j }is the recombination rate between marker j and j+1 and g_{ k }is the most probable founder genotype given the segregation state at the k^{ th }marker locus. Note that non-founder genotypes and haplotypes are totally dependent on the founder's genotypes and the segregation state at each marker. The computation of the first term in (2) is the function of all recombinations given S and is therefore relatively straightforward (|S_{ ij }- S_{ij+1}| = 1 with recombination, and |S_{ ij }- S_{ij+1}| = 0 with no recombination between S_{ ij }and S_{ij+1}). For the second term, all possible genotype configurations for founders should be evaluated and the most likely configuration is chosen based on the likelihood given the segregation indicators (see [15, 28]).
SA for obtaining optimal haplotypes
In the first stage of simulated annealing, the temperature is very high. Therefore any legal configuration can be broadly sampled. In the annealing process, the temperature gradually decreases and more likely configurations are more often taken than less likely configurations. The process reaches the lowest energy state that represents the optimal configuration [30, 31].
EA for obtaining optimal haplotypes
An evolutionary algorithm is a stochastic optimization algorithm based on the theory of evolution [20]. An EA-population consists of N individuals (or solutions), each representing a potential haplotype configuration, i.e. a possible S matrix. The parameters to be optimised by the EA are the individual segregation indicators. To generate a new solution in the next iteration, the parent is either mutated or recombined with another randomly chosen parent with 50% chance of each. EA-mutation follows 1/2^{ t }chance of t transitions of switching segregation indicators with the random walk [15]. EA-recombination follows EA-mutation, but a transition is executed by copying the S values from another randomly chosen solution, rather than switching states (0,1) under mutation, e.g. randomly chosen variables in one solution (e.g. i^{th} EA-individual) are substituted with those in another solution (e.g. j^{th} EA-individual). As an objective function, the likelihood of the haplotype set determined by the proposed variables from the EA-mutation or EA-recombination is evaluated (2). The EA-individual will acquire the updated variables if the new variables have a higher likelihood (EA-selection). With these processes in sequential steps, all EA-individuals are evolved toward the state of the global maximum.
Joint updating schemes and the random walk for segregation indicators
In the process of updating segregation indicators, there are sets of variables that require simultaneous updating, i.e. the variables within the set are dependent on each other, therefore independent change of each variable is constrained by other variables in the set. However, it would be possible to find the set of dependent variables, tracing the change of allele assignments to founder gametes according to updated segregation indicators (Appendix). Then, joint updating for the set of dependent variables can be carried out, which will increase the acceptance rates for the proposal variables. Because of complex pedigree and genotype structure, not all sets of updated variables may be found. The random walk approach can be applied to those variables that have not been updated. This will make sure that the search covers all possible states, i.e. irreducibility.
Initial legal configurations for N EA-members
Each EA-member requires a starting configuration, consistent with observed pedigree and marker data. The genotype elimination through inheritance constraint (GEIC) algorithm [32] is suitable for finding a legal configuration of segregation indicators at a single locus. This algorithm finds a legal configuration for each locus independently.
Brief summary of the process
An evolutionary algorithm with the random walk approach alone (EA1), or an evolutionary algorithm with the joint updating method and the random walk approach (EA2) is briefly summarized below.
Obtaining starting configuration for each EA-individual
Do cycles
Do i = 1 ~ N EA-individuals
Do j = 1 ~ no. meiosis × no. markers
Joint updating (EA-mutation)
Evaluate likelihood (EA-selection)
End do (this loop is only for EA2)
Do j = 1 ~ no. meiosis × no. markers × 10
The random walk approach (EA-mutation or EA-recombination)
Evaluate likelihood (EA-selection)
End do (this loop is for both EA1 and EA2)
End do
Collect the updated solution from each EA-individual
Evaluate the solution and save the best
Convergence assessment
End cycles
Simulation study
An effective population size of 100 was simulated for 10 multiallelic marker loci for 100 generations to ensure that the population would have an equilibrium distribution of alleles at all loci after 100 generations. In each generation, the number of male and female parents was 50 and their alleles were transmitted to descendents on the basis of Mendelian segregation using the gene-dropping method [33].
The number of alleles assumed at each marker locus was 4 for multiallelic markers (e.g. microsatellites) and the starting allele frequencies were 0.25 in generation 0. The marker allele was mutated at a rate of 4 × 10^{-4} per generation [34–36] where a new allele was added for mutated loci. Note that pedigree and genotype information was deemed not available for these 100 generations.
At generation 101, an effective population size of 20 was simulated for 5 generations with pedigree recording, and used for analysis. The total number of individuals used for analysis was 100. In each generation, the number of male and female candidate parents was 10 and they were randomly selected and mated such that the number of progeny for each parent was Poisson distributed with a mean of 2. Therefore, the recorded pedigree would have complex relationships between animals. Complete and incomplete genotypic data were simulated. In complete genotypic data, genotypes from all hundred pedigreed individuals were available for analysis. In incomplete genotypic data, genotypes were available for progeny in the last generation and ancestral and parental genotypes were all missing but their relationships were used.
Real data
In addition to the simulation data, a real data set was also used. This consists of four half sib families with ancestral pedigree spanning approximately four to five generations. The four sires and some dams were related through the ancestral pedigree. Base animals were assumed unrelated. The number of individuals in this pedigree was 1010. The number in each half sib group varied from 50 to 200. The offspring were genotyped for 13 microsatellites on the same chromosome positioned at 12 cM intervals on average. However, ~40% of the genotypes were missing among the offspring. The ancestors and parents were not genotyped but their pedigree information was used. All individuals were related through complex relationships.
Methods comparison
The performance of SimWalk2, EA1 and EA2 was compared. The number of evaluations of the likelihood function in each iteration round was one for SimWalk2, and N for EA1 and EA2. Therefore, the total number of likelihood evaluations is the same as the number of iteration in SimWalk2, and N times larger than the number of iterations in EA1 and EA2. N was set to 10. A parallel computing program, Parallel Virtual Machine (PVM) version 3 [37], was used for parallel computation of EA1 and EA2.
Availability
A binary executable file for Linux operating system will be given on request.
Appendix
Methods for updating segregation indicators (SI)
A legal configuration of segregation indicators for the meiosis, and allele assignment to the founder gametes given the segregation indicators at the first and second marker
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
---|---|---|---|---|---|---|---|---|---|---|
marker 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | a | - | - | a | - | c | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
Single site updating
Updating segregation indicators for a meiosis at a marker subsequently, and the change of allele assignment to the founder gamete given the updated segregation indicators
I. Log likelihood = -43.837 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
Marker 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
Marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
Marker 1 | - | a | - | a | - | c | - | - | a | - |
Marker 2 | - | y | x | - | - | - | - | y | x | - |
II. Log likelihood = -41.531 | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | - | c | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
III. Log likelihood = -39.225 | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | - | c | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
IV. Log likelihood = -36.919 | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | c | - | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
V. Log likelihood = -34.614 | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | c | - | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
VI. Log likelihood = -32.308 | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | c | - | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
VII. State is illegal | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a and c | a | - | - | - | - | - | a or c | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
Joint update with dependent variables
Segregation state of founder gametes for genotyped animals and the changes due to switching m7 at the first marker
Genotyped animal | paternal | maternal |
---|---|---|
ID5 | f2 | f3 |
ID9 | F5 -> f2 | f9 |
ID10 | f2 | F5 -> f2 |
Joint updates
With joint update for m1 and m7 (log likelihood = -32.308) | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
Marker 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 |
Marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | a | c | a | - | - | - | - | - | a | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
With joint update for m7 and m9 (log likelihood = -27.185) | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | - | - | - | c | c | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
With joint update for m7 and m10 (log likelihood = -31.797) | ||||||||||
m1 | m2 | m3 | m4 | m5 | m6 | m7 | m8 | m9 | m10 | |
marker 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |
marker 2 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
f1 | f2 | f3 | f4 | f5 | f6 | f7 | f8 | f9 | f10 | |
marker 1 | - | a | a | - | - | - | - | - | c | - |
marker 2 | - | y | x | - | - | - | - | y | x | - |
Declarations
Acknowledgements
This study is supported by PIC International and Sheep Genomics Australia.
Authors’ Affiliations
References
- Pong-Wong R, George AW, Woolliams JA, Haley CS: A simple and rapid method for calculating identity-by-descent matrices using multiple markers. Genet Sel Evol 2001, 33: 453–471.PubMed CentralView ArticlePubMedGoogle Scholar
- Almasy L, Blangero J: Multipoint quantitative-trait linkage analysis in general pedigrees. Am J Hum Genet 1998, 62: 1198–1211.PubMed CentralView ArticlePubMedGoogle Scholar
- Lee SH, Van der Werf JH, Tier B: Combining the meiosis Gibbs sampler with the random walk approach for linkage and association studies with a general complex pedigree and multi marker loci. Genetics 2005, 171: 2063–2072.PubMed CentralView ArticlePubMedGoogle Scholar
- Meuwissen THE, Goddard ME: Prediction of identity by descent probabilities from marker-haplotypes. Genet Sel Evol 2001, 33: 605–634.PubMed CentralView ArticlePubMedGoogle Scholar
- Blott S, Kim JJ, Moisio S, Schmidt-Kuntzel A, Cornet A, Berzi P, Cambisano N, Ford C, Grisart B, Johnson D, Karim L, Simon P, Snell R, Spelman R, Wong J, Vilkki J, Georges M, Farnir F, Coppieters W: Molecular dissection of a quantitative trait locus: a phenylalanine-to-tyrosine substitution in the transmembrane domain of the bovine growth hormone receptor is associated with a major effect on milk yield and composition. Genetics 2003, 163: 253–266.PubMed CentralPubMedGoogle Scholar
- Schnabel RD, Kim JJ, Ashwell MS, Sonstegard TS, Van Tassell CP, Connor EE, Taylor JF: Fine-mapping milk production quantitative trait loci on BTA6: analysis of the bovine osteopontin gene. Proc Natl Acad Sci USA 2005, 102: 6896–6901.PubMed CentralView ArticlePubMedGoogle Scholar
- Lee SH, Van der Werf JHJ: The role of pedigree information in combined linkage disequilibrium and linkage mapping of quantitative trait loci in a general complex pedigree. Genetics 2005, 169: 455–466.PubMed CentralView ArticlePubMedGoogle Scholar
- Elston RC, Stewart J: A general model for the genetic analysis of pedigree data. Hum Hered 1971, 21: 523–542.View ArticlePubMedGoogle Scholar
- Lander ES, Green P: Construction of multilocus genetic linkage maps in humans. Proc Natl Acad Sci USA 1987, 84: 2363–2367.PubMed CentralView ArticlePubMedGoogle Scholar
- Li J, Jiang T: Efficient rule-based haplotyping algorithms for pedigree data. In 7th Annual conference on Research in Computational Molecular Biology (RECOM): 2003. Berlin, German; 2003:197–206.Google Scholar
- Qian D, Beckmann L: Minimum-recombinant haplotyping in pedigrees. Am J Hum Genet 2002, 70: 1434–1445.PubMed CentralView ArticlePubMedGoogle Scholar
- Tapadar P, Ghosh S, Majumder PP: Haplotyping in pedigrees via a genetic algorithm. Hum Hered 2000, 50: 43–56.View ArticlePubMedGoogle Scholar
- O'Connell JR: Zero-recombinant haplotyping: applications to fine mapping using SNPs. Genet Epidemiol 2000, 19: S64-S70.View ArticlePubMedGoogle Scholar
- Lin S, Speed TP: An algorithm for haplotype analysis. J Comput Biol 1997, 4: 535–546.View ArticlePubMedGoogle Scholar
- Sobel E, Lange K: Descent graphs in pedigree analysis: applications to haplotyping, location scores, and marker-sharing statistics. Am J Hum Genet 1996, 58: 1323–1337.PubMed CentralPubMedGoogle Scholar
- Thomas A, Gutin A, Abkevich V, Bansal A: Multilocus linkage analysis by blocked Gibbs sampling. Stat Comput 2000, 10: 259–269.View ArticleGoogle Scholar
- Kirkpatrick S, Gelatt CD, Vecchi MP: Optimization by simulated annealing. Science 1983, 220: 671–680.View ArticlePubMedGoogle Scholar
- Sobel E, Lange K, O'Connell J, Weeks DE: Haplotyping algorithms. In Genetic mapping and DNA sequencing. Volume 81. Edited by: Speed TP, Waterman MS. New York: Springer-Verlag; 1995:89–110.Google Scholar
- Lange K, Matthysse S: Simulation of pedigree genotypes by random walks. Am J Hum Genet 1989, 45: 959–970.PubMed CentralPubMedGoogle Scholar
- Holland JH: Adaptation in natural and artificial system: an introductory analysis with applications to biology, control, and artificial intelligence. Ann Arbor: University of Michigan Press. Ann Arbot: University of Michigan Press; 1975.Google Scholar
- Heitzinger C, Selberherr S: An extensible TCAD optimization framework combining gradient based and genetic optimizers. Microelectronics Journal 2002, 33: 61–68.View ArticleGoogle Scholar
- Stephens M, Smith NJ, Donnelly P: A new statistical method for haplotype reconstruction from population data. Am J Hum Genet 2001, 68: 978–989.PubMed CentralView ArticlePubMedGoogle Scholar
- Scheet P, Stephens M: A fast and flexible statistical model for large-scale population genotype data: applications to inferring missing genotypes and haplotypic phase. Am J Hum Genet 2006, 78: 629–644.PubMed CentralView ArticlePubMedGoogle Scholar
- Browning S: Multilocus association mapping using variable-length Markov chains. Am J Hum Genet 2006, 78: 903–913.PubMed CentralView ArticlePubMedGoogle Scholar
- Avery CL, Martin LJ, Williams JT, North KE: Accuracy of haplotype estimation in a region of low linkage disequilibrium. BMC Genet 2005, 6(Suppl 1):S80.PubMed CentralView ArticlePubMedGoogle Scholar
- Haley CS: Advances in quantitative trait locus mapping. In From J L Lush to Genomics: Visions for Animal Breeding and Genetics, AgBiotechNet Proceedings 001 Paper 1. Edited by: Dekkers JCM, Lamont SJ, Rothschild MF. Ames, IA: Iowa State University; 1999:47–59.Google Scholar
- Cannings C, Thompson EA, Skolnick MH: Probability functions on complex pedigrees. Adv Appl Probab 1978, 10: 26–61.View ArticleGoogle Scholar
- Bureau A: Genetic linkage analysis based on identity by descent using Markov chain Monte Carlo sampling on large pedigrees. Berkeley: University of California; 2001.Google Scholar
- Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E: Equations of state calculation by fast computing machines. J Chem Phys 1953, 21: 1087–1092.View ArticleGoogle Scholar
- Van Laarhoven PJM, Aarts E: Simulated annealing: theory and application. Dordrecht: Reidel; 1987.View ArticleGoogle Scholar
- Aarts E, Korst J: Simulated annealing and boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Chichester: John Wiley & Sons;; 1989.Google Scholar
- Henshall JM, Tier B, Kerr RJ: Estimating genotypes with independently sampled descent graphs. Genet Res 2001, 78: 281–288.View ArticlePubMedGoogle Scholar
- MacCluer JW, VandeBerg JL, Read B, Ryder OA: Pedigree analysis by computer simulation. Zoo Biology 1986, 5: 147–160.View ArticleGoogle Scholar
- Dallas JF: Estimation of microsatellite mutation rates in recombinant inbred strains of mouse. Mamm Genome 1992, 3: 452–456.View ArticlePubMedGoogle Scholar
- Weber JL, Wong C: Mutation of human short tandem repeats. Hum Mol Genet 1993, 2: 1123–1128.View ArticlePubMedGoogle Scholar
- Ellegren H: Mutation rates at porcine microsatellite loci. Mamm Genome 1995, 6: 376–377.View ArticlePubMedGoogle Scholar
- Geist A, Beguelin A, Dongarra J, Jiang W, Mancheck R, Sunderam V: PVM 3 user's guide and reference manual. Tennessee: Oak Ridge National Laboratory; 1994.Google Scholar
- Thompson EA, Heath SC: Estimation of conditional multilocus gene identity among relatives. In Statistics in Molecular Biology and Genetics, IMS Lecture notes. Edited by: Seillier-Moiseiwitsch F. Institute of Mathematical Statistics, American Mathematical Society, Providence, RI; 1999:95–113.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.