Efficient genotype elimination via adaptive allele consolidation

Area of Science:

• Genetics
• Bioinformatics
• Computational Biology

Background:

• Genotype elimination identifies impossible genotypes in pedigrees based on Mendelian inheritance laws.
• This process is crucial for detecting errors in genetic data and serves as a preprocessing step for linkage analysis and haplotype imputation.
• Existing Allele Consolidation methods pre-lump alleles, potentially reducing precision.

Purpose of the Study:

• To introduce Adaptive Allele Consolidation, a novel technique for improving the efficiency of the Lange-Goradia algorithm for genotype elimination.
• To maintain the precision of genotype elimination while significantly enhancing computational performance.

Main Methods:

• Adaptive Allele Consolidation dynamically adjusts allele groupings during the Lange-Goradia algorithm's execution.
• The Lange-Goradia algorithm is a standard method for genotype elimination in genetic pedigrees.
• Implementation in a tool named Celer for evaluation.

Main Results:

• Adaptive Allele Consolidation significantly improves the performance of genotype elimination.
• The technique achieves equivalent output precision compared to existing methods.
• Evaluated on extensive datasets, demonstrating robust performance across various scenarios.

Conclusions:

• Adaptive Allele Consolidation offers a superior approach to genotype elimination in genetic pedigrees.
• The method balances computational efficiency and data precision effectively.
• The Celer tool provides a practical implementation for genetic data analysis.