Extensions to pedigree analysis I. Likehood calculations for simple and complex pedigrees

Area of Science:

• Genetics
• Graph Theory
• Computational Biology

Background:

• Pedigree analysis is crucial for understanding genetic inheritance patterns.
• Existing methods may struggle with complex family structures and specific genetic scenarios.

Purpose of the Study:

• To develop a graph-theoretic framework for defining pedigrees.
• To create algorithms for calculating genetic likelihoods in diverse pedigree types.
• To improve genetic counseling, segregation analysis, and linkage analysis.

Main Methods:

• Defined pedigrees using graph theory, distinguishing between simple and complex types.
• Developed algorithms to compute likelihoods under specified genetic assumptions.
• Incorporated factors like multiple births and consanguineous marriages.

Main Results:

• A unified graph-theoretic definition for pedigrees was established.
• Algorithms demonstrated the capability to handle various pedigree complexities.
• The formulation supports calculations with segregation at multiple loci.

Conclusions:

• The proposed graph-theoretic approach provides a robust foundation for pedigree analysis.
• This methodology enhances the power of genetic counseling and linkage studies.
• The algorithms offer a versatile tool for complex genetic data interpretation.