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

Using Evolutionary Algorithms for Haplotype Reconstruction

Sample size: 100 publication 10 minutes Evidence: high

Author Information

Author(s): Lee Sang Hong, Van der Werf Julius HJ, Kinghorn Brian P

Primary Institution: The Institute for Genetics and Bioinformatics, School of Environmental and Rural Science, University of New England

Hypothesis

Can an evolutionary algorithm improve haplotype reconstruction efficiency compared to simulated annealing?

Conclusion

The evolutionary algorithm and joint updating method significantly enhance haplotype reconstruction efficiency in linkage and association mapping of quantitative trait loci.

Supporting Evidence

  • The evolutionary algorithm was shown to be approximately 4 times faster than SimWalk2 when using 4 processors.
  • Jointly updating dependent variables can increase computational efficiency up to 2 times.
  • The proposed method can increase computational efficiency up to 8 times compared to SimWalk2.

Takeaway

This study shows that using a special computer program can help scientists figure out family trees of genes much faster than before.

Methodology

The study compared the performance of an evolutionary algorithm with simulated annealing for haplotype reconstruction using both simulated and real data.

Limitations

The study primarily focused on specific types of data and may not generalize to all genetic datasets.

Participant Demographics

The study used simulated data from a population of 100 individuals and real data from 1010 individuals in complex pedigrees.

Digital Object Identifier (DOI)

10.1186/1471-2105-9-189

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication