Constraints

, Volume 13, Issue 1, pp 130–154

Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques

Article

DOI: 10.1007/s10601-007-9029-5

Cite this article as:
Sanchez, M., de Givry, S. & Schiex, T. Constraints (2008) 13: 130. doi:10.1007/s10601-007-9029-5

Abstract

With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested in errors that violate Mendelian laws. The problem of deciding if a Mendelian error exists in a pedigree is NP-complete (Aceto et al., J Comp Sci Technol 19(1):42–59, 2004). Existing tools dedicated to this problem may offer different level of services: detect simple inconsistencies using local reasoning, prove inconsistency, detect the source of error, propose an optimal correction for the error. All assume that there is at most one error. In this paper we show that the problem of error detection, of determining the minimum number of errors needed to explain the data (with a possible error detection) and error correction can all be modeled using soft constraint networks. Therefore, these problems provide attractive benchmarks for weighted constraint network (WCN) solvers. Because of their sheer size, these problems drove us into the development of a new WCN solver toulbar2 which solves very large pedigree problems with thousands of animals, including many loops and several errors.

Keywords

Mendelian genotyping error detectionComplex pedigreesWeighted constraint satisfactionGenetics

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.INRA - UBIAToulouseFrance