Efficient Algorithms for SNP Haplotype Block Selection Problems
From MaRDI portal
Publication:3511342
Recommendations
- Selection of minimum subsets of single nucleotide polymorphisms to capture haplotype block diversity
- A novel efficient dynamic programming algorithm for haplotype block partitioning
- Finding all maximal perfect haplotype blocks in linear time
- A dynamic programming algorithm for haplotype block partitioning
- scientific article; zbMATH DE number 1877046
Cites work
Cited in
(11)- Extending maximal perfect haplotype blocks to the realm of pangenomics
- Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification
- A novel efficient dynamic programming algorithm for haplotype block partitioning
- scientific article; zbMATH DE number 7716305 (Why is no real title available?)
- SHARE: an adaptive algorithm to select the most informative set of SNPs for candidate genetic association
- Selection of minimum subsets of single nucleotide polymorphisms to capture haplotype block diversity
- A dynamic programming algorithm for haplotype block partitioning
- Particle swarm optimization for SNP haplotype reconstruction problem
- Parameterizing MAX SNP Problems Above Guaranteed Values
- Finding all maximal perfect haplotype blocks in linear time
- scientific article; zbMATH DE number 2148610 (Why is no real title available?)
This page was built for publication: Efficient Algorithms for SNP Haplotype Block Selection Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511342)