An abstract interpretation framework for genotype elimination algorithms

DOI10.1016/J.TCS.2012.03.032MaRDI QIDQ428908zbMATH OpenOpenAlexFDO

Authors 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

abstract interpretationgenotype eliminationpedigrees

Mathematics Subject Classification ID

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

Recommendations

• Abstract Interpretation Frameworks
• scientific article; zbMATH DE number 3938547
• Frameworks for abstract interpretation
• Fast elimination of redundant linear equations and reconstruction of recombination-free Mendelian inheritance on a pedigree
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Cites work

• A Forward-Backward Abstraction Refinement Algorithm
• Constructive versions of Tarski's fixed point theorems
• Generalized Strong Preservation by Abstract Interpretation
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Grammar Analysis and Parsing by Abstract Interpretation
• Making abstract interpretations complete
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
• 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

Describes a project that uses

Uses Software

• Pedcheck
• Celer

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

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