The complexity of checking consistency of pedigree information and related problems.

DOI10.1007/B13810MaRDI QIDQ5897359zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Jens A. Hansen, Anna Ingolfsdottir, Jacob Johnsen, John Knudsen

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13810

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• The complexity of assigning genotypes to people in a pedigree consistently
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• Efficient maximum likelihood pedigree reconstruction
• Algorithms and Computation

Cited in

(3)

• The complexity of assigning genotypes to people in a pedigree consistently
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques

This page was built for publication: The complexity of checking consistency of pedigree information and related problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897359)