Using an evolutionary algorithm and parallel computing for haplotyping in a general complex pedigree with multiple marker loci

Sang Lee, Julius H.J. Van der Werf, Brian P. Kinghorn

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Article number189
JournalBMC Bioinformatics
Publication statusPublished or Issued - 11 Apr 2008
Externally publishedYes

ASJC Scopus subject areas

  • Structural Biology
  • Biochemistry
  • Molecular Biology
  • Computer Science Applications
  • Applied Mathematics

Cite this