Celer: an Efficient Program for Genotype Elimination

Abstract

This paper presents an efficient program for checking Mendel ian consistency in a pedigree. Sincepedigrees may contain incomplete and/or erroneous information, geneticists need to pre-processthem before performing linkage analysis. Removing superflu ous genotypes that do not respect theMendelian inheritance laws can speed up the linkage analysis. We have described in a formal waythe Mendelian consistency problem and algorithms known in literature. The formalization helpedto polish the algorithms and to find efficient data structures . The performance of the tool has beentested on a wide range of benchmarks. The results are promising if compared to other programs thattreat Mendelian consistency.