An abstract interpretation framework for genotype elimination algorithms

DOI10.1016/j.tcs.2012.03.032zbMath1242.68167OpenAlexW1975124142MaRDI QIDQ428908

Giuseppe Lettieri

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.032

zbMATH Keywords

pedigreesabstract interpretationgenotype elimination

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Uses Software

• Pedcheck
• Celer

Cites Work

• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• Constructive versions of Tarski's fixed point theorems
• The complexity of assigning genotypes to people in a pedigree consistently
• Verification, model checking, and abstract interpretation. 9th international conference, VMCAI 2008, San Francisco, USA, January 7--9, 2008. Proceedings
• Generalized Strong Preservation by Abstract Interpretation
• Grammar Analysis and Parsing by Abstract Interpretation
• Making abstract interpretations complete
• A Forward-Backward Abstraction Refinement Algorithm

This page was built for publication: An abstract interpretation framework for genotype elimination algorithms