An abstract interpretation framework for genotype elimination algorithms
DOI10.1016/J.TCS.2012.03.032zbMATH Open1242.68167OpenAlexW1975124142MaRDI QIDQ428908FDOQ428908
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
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
Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Constructive versions of Tarski's fixed point theorems
- Grammar Analysis and Parsing by Abstract Interpretation
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Making abstract interpretations complete
- 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
- A Forward-Backward Abstraction Refinement Algorithm
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
Uses Software
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)
