Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques

  • Authors:

  • Marti Sanchez;Simon de Givry;Thomas Schiex

  • Affiliations:

  • INRA-UBIA Toulouse, France, {msanchez,degivry,tschiex}@toulouse.inra.fr;INRA-UBIA Toulouse, France, {msanchez,degivry,tschiex}@toulouse.inra.fr;INRA-UBIA Toulouse, France, {msanchez,degivry,tschiex}@toulouse.inra.fr

  • Venue:
  • Proceedings of the 2007 conference on Artificial Intelligence Research and Development
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 Mendelian error exists in a pedigree is NP-complete [1]. 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 error 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 toulbar21 which solves very large pedigree problems with thousands of animals, including many loops and several errors. This paper is a summary of an extended version to appear [17].