Efficient Algorithms for SNP Haplotype Block Selection Problems
From MaRDI portal
Publication:3511342
DOI10.1007/978-3-540-69733-6_31zbMATH Open1148.92301OpenAlexW1597625225MaRDI QIDQ3511342FDOQ3511342
Authors: Yaw-Ling Lin
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_31
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
- Title not available (Why is that?)
- 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
- Finding all maximal perfect haplotype blocks in linear time
- Parameterizing MAX SNP Problems Above Guaranteed Values
- Title not available (Why is that?)
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)