2010/08/19 by Nicoletta De Francesco, Giuseppe Lettieri, Luca Martini
Computer Science · #cs.DS #cs.CE
paper · pdf · doi:10.4204/eptcs.33.4
published as EPTCS 33, 2010, pp. 56-70 · In Proceedings AMCA-POP 2010, arXiv:1008.3147
arxiv created 2010/08/19 · arxiv updated 2010/08/20
This paper presents an efficient program for checking Mendelian consistency in a pedigree. Since pedigrees may contain incomplete and/or erroneous information, geneticists need to pre-process them before performing linkage analysis. Removing superfluous genotypes that do not respect the Mendelian inheritance laws can speed up the linkage analysis. We have described in a formal way the Mendelian consistency problem and algorithms known in literature. The formalization helped to polish the algorithms and to find efficient data structures. The performance of the tool has been tested on a wide range of benchmarks. The results are promising if compared to other programs that treat Mendelian consistency.