A Fast Algorithm for Genome-Wide Haplotype Pattern Mining
Author Information
Author(s): Søren Besenbacher, Christian NS Pedersen, Thomas Mailund
Primary Institution: Bioinformatics Research Center, University of Aarhus, Denmark
Hypothesis
Can a new algorithm improve the efficiency of the Haplotype Pattern Mining method for genome-wide association studies?
Conclusion
The new algorithm speeds up the HPM method and is feasible for whole genome association mapping with large datasets.
Supporting Evidence
- The new algorithm improves the speed of the HPM method by a factor of 2.
- The study demonstrates the feasibility of applying HPM to large datasets with thousands of individuals.
- The new approach utilizes patterns of haplotype diversity to enhance computational efficiency.
Takeaway
The researchers created a faster way to find genetic patterns that can help identify diseases by looking at many genes at once instead of one at a time.
Methodology
The study developed a new algorithm for the Haplotype Pattern Mining method and tested it on a genome-wide dataset.
Participant Demographics
5009 individuals typed in 491208 markers.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website