Extending maximal perfect haplotype blocks to the realm of pangenomics

DOI10.1007/978-3-030-42266-0_4MaRDI QIDQ5041124zbMATH OpenOpenAlexFDO

Authors Lucia Williams, Brendan Mumey

Publication date 13 October 2022

Published in Algorithms for Computational Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-42266-0_4

zbMATH Keywords

haplotype blockpopulation genomicspangenomics

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Finding all maximal perfect haplotype blocks in linear time
• Efficient Algorithms for SNP Haplotype Block Selection Problems
• An MDL method for finding haplotype blocks and for estimating the strenght of haplotype block boundaries
• A novel efficient dynamic programming algorithm for haplotype block partitioning
• On the complexity of SNP block partitioning under the perfect phylogeny model

Cites work

• A hidden Markov model for investigating recent positive selection through haplotype structure
• Algorithms on Strings, Trees and Sequences
• Efficient construction of a compressed de Bruijn graph for pan-genome analysis
• Finding all maximal perfect haplotype blocks in linear time

Cited in

(5)

• PanCake: a data structure for pangenomes
• Testing for population decline using maximal linkage disequilibrium blocks
• scientific article; zbMATH DE number 7716305 (Why is no real title available?)
• Finding all maximal perfect haplotype blocks in linear time
• Pangenomic genotyping with the marker array

Describes a project that uses

Uses Software

• MUMmer4

This page was built for publication: Extending maximal perfect haplotype blocks to the realm of pangenomics

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