A novel efficient dynamic programming algorithm for haplotype block partitioning

DOI10.1016/J.JTBI.2010.08.019MaRDI QIDQ1732940zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 26 March 2019

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jtbi.2010.08.019

zbMATH Keywords

genomicshaplotype diversitySNPtag SNP

Mathematics Subject Classification ID

Genetics and epigenetics (92D10)

Recommendations

• A dynamic programming algorithm for haplotype block partitioning
• High Performance Computing - HiPC 2003
• scientific article; zbMATH DE number 2130802
• scientific article; zbMATH DE number 2148610
• Efficient Algorithms for SNP Haplotype Block Selection Problems

Cites work

• A novel efficient dynamic programming algorithm for haplotype block partitioning

Cited in

(9)

• A novel efficient dynamic programming algorithm for haplotype block partitioning
• scientific article; zbMATH DE number 2130802 (Why is no real title available?)
• Efficient Algorithms for SNP Haplotype Block Selection Problems
• A dynamic programming algorithm for haplotype block partitioning
• scientific article; zbMATH DE number 2148610 (Why is no real title available?)
• Extending maximal perfect haplotype blocks to the realm of pangenomics
• Finding all maximal perfect haplotype blocks in linear time
• An MDL method for finding haplotype blocks and for estimating the strenght of haplotype block boundaries
• scientific article; zbMATH DE number 7716305 (Why is no real title available?)

Describes a project that uses

Uses Software

• HapBlock
• htSNPer1.0

This page was built for publication: A novel efficient dynamic programming algorithm for haplotype block partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732940)