Finding all maximal perfect haplotype blocks in linear time

DOI10.4230/LIPICS.WABI.2019.8MaRDI QIDQ5091735zbMATH OpenOpenAlexFDO

Authors Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye

Publication date 27 July 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/11038/pdf/LIPIcs-WABI-2019-8.pdf/

zbMATH Keywords

haplotype blockpositional Burrows-Wheeler transformpopulation genomicsselection coefficient

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Recommendations

• A linear-time algorithm for the perfect phylogeny haplotype problem
• Extending maximal perfect haplotype blocks to the realm of pangenomics
• Research in Computational Molecular Biology
• Efficient Algorithms for SNP Haplotype Block Selection Problems
• A dynamic programming algorithm for haplotype block partitioning
• A novel efficient dynamic programming algorithm for haplotype block partitioning
• Linear-time haplotype inference on pedigrees without recombinations and mating loops
• On the Approximability of Some Haplotyping Problems
• Efficient Haplotype Inference with Pseudo-boolean Optimization

Cites work

• Algorithms on Strings, Trees and Sequences
• Replacing suffix trees with enhanced suffix arrays

Cited in

(7)

• Extending maximal perfect haplotype blocks to the realm of pangenomics
• Minimum segmentation for pan-genomic founder reconstruction in linear time
• scientific article; zbMATH DE number 7716305 (Why is no real title available?)
• Haplotype threading using the positional Burrows-Wheeler transform
• Efficient Algorithms for SNP Haplotype Block Selection Problems
• Identify LD blocks based on hierarchical spatial data
• An MDL method for finding haplotype blocks and for estimating the strenght of haplotype block boundaries

This page was built for publication: Finding all maximal perfect haplotype blocks in linear time

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