Search research articles

Search research articles

Related Experiment Videos

A recursive method for solving haplotype frequencies with application to genetics.

Michael K Ng¹, Eric S Fung, Yiu-Fai Lee

¹Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China. mng@math.hkbu.edu.hk

Journal of Bioinformatics and Computational Biology

|January 25, 2007

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

SpecEStop: Self-Supervised Hyperspectral Mixed Noise Removal via Deep Spectral Prior.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026

Same author

CNet-Cox for interpretable network biomarker discovery and survival risk scoring in precise breast cancer prognosis.

NPJ digital medicine·2026

Same author

Local and High-Order Consistency Coding and Adaptation for Cross-Hypergraph Node Classification.

IEEE transactions on pattern analysis and machine intelligence·2026

Same author

Separable Decomposition for Ragged Tensors.

IEEE transactions on pattern analysis and machine intelligence·2026

Same author

Nonlinear Transformed Low-Rank Quaternion Tensor Total Variation for Multidimensional Color Image Completion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026

Same author

On the Number of Control Nodes in Boolean Networks With Degree Constraints.

IEEE transactions on cybernetics·2026

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

This study introduces an efficient recursive algorithm to solve complex linear systems in multiple loci analysis. The method speeds up haplotype class probability calculations for large datasets, improving computational efficiency.

Area of Science:

Computational biology
Statistical genetics
Bioinformatics

Background:

Multiple loci analysis is crucial in biological research, with increasing focus on its statistical properties.
Solving computational problems, like determining haplotype class probabilities from large linear systems, is essential for analyzing multiple loci data.

Purpose of the Study:

To develop an efficient algorithm for solving large, structured linear systems arising in multiple loci analysis.
To address the computational challenges posed by the exponential growth of the recombination matrix size with an increasing number of loci.

Main Methods:

Developed an efficient recursive algorithm exploiting the structure of the recombination matrix A.
Analyzed the computational complexity and memory requirements of the proposed solver.

Related Experiment Videos

Applied the method to analyze haplotype classes using single nucleotide polymorphism (SNP) data from Hapmap.

Main Results:

The proposed algorithm achieves a complexity of O(n2(n)) operations and O(2(n)) memory for n loci.
Numerical examples demonstrate the effectiveness of the efficient solver.
The method successfully analyzed haplotype classes for real-world SNP data.

Conclusions:

The developed recursive algorithm provides an efficient solution for large-scale multiple loci analysis.
This method can significantly improve the computational feasibility of analyzing complex genetic data.
The approach is validated by its application to Hapmap SNP data, showing practical utility.