An Efficient Computational Tool to Detect Genotyping Errors in an Arbitrary Complex Pedigree

• Activity Number: 72
• Type: Contributed
• Date/Time: Sunday, August 2, 2009 : 4:00 PM to 5:50 PM
• Sponsor: Section on Statistical Computing
• Author(s): Lan Zhu*+
• Companies: Oklahoma State University
• Keywords: Genotyping errors ; Mendelian inconsistency ; Recursion ; Animal Breeding ; Complex pedigree

Abstract

Genotyping errors can greatly influence the follow-up studies, especially in reducing the power of gene mapping. The error detection therefore becomes an increasingly important problem. Currently available methodologies all worked for simple family structures without complicated loops involved. Here we propose a novel algorithm to determine the minimum number of errors needed to explain the data and evaluate the performance of error detection and possible correction in both simulated and real large data set in dogs with a complex pedigree over 3-12 or more generations. No other available method is available to handle it at this time. We will implement this algorithm into a program package. It will be extremely useful for scientists with animals as research models, since the pedigree of the animal population could be rather complex and arbitrary.