Extending maximal perfect haplotype blocks to the realm of pangenomics

DOI10.1007/978-3-030-42266-0_4zbMATH Open1500.92059OpenAlexW3013860584MaRDI QIDQ5041124FDOQ5041124

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

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

zbMATH Keywords

haplotype blockpopulation genomicspangenomics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Testing for population decline using maximal linkage disequilibrium blocks
• Finding all maximal perfect haplotype blocks in linear time
• PanCake: a data structure for pangenomes

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)