Efficient and accurate haplotype inference by combining parsimony and pedigree information
DOI10.1007/978-3-642-28067-2_3zbMATH Open1256.92037OpenAlexW1868868480WikidataQ58883952 ScholiaQ58883952MaRDI QIDQ2889700FDOQ2889700
Authors: Ana Graça, Inês Lynce, Arlindo L. Oliveira, Joao Marques-Silva 
Publication date: 8 June 2012
Published in: Algebraic and Numeric Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28067-2_3
Recommendations
- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract)
- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
- An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- Haplotype inference with pseudo-Boolean optimization
Applications of statistics to biology and medical sciences; meta analysis (62P10) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Boolean programming (90C09)
Cited In (9)
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- Boolean lexicographic optimization: algorithms \& applications
- Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations
- Title not available (Why is that?)
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
- Haplotype inference with pseudo-Boolean optimization
- Iterative and core-guided maxsat solving: a survey and assessment
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
This page was built for publication: Efficient and accurate haplotype inference by combining parsimony and pedigree information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889700)
