Pages that link to "Item:Q2428680"
From MaRDI portal
The following pages link to An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants (Q2428680):
Displaying 10 items.
- Tree-k-RHC (Q32789) (← links)
- A simulated annealing algorithm for maximum likelihood pedigree reconstruction (Q849461) (← links)
- A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops (Q965820) (← links)
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders (Q1036927) (← links)
- A fast algorithm for computing multilocus recombination (Q1630865) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
- Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations (Q3654375) (← links)
- Efficient Haplotype Inference with Pseudo-boolean Optimization (Q5429358) (← links)
- Computational Science – ICCS 2005 (Q5709421) (← links)
- Algorithms and Computation (Q5897870) (← links)
