Finding all maximal perfect haplotype blocks in linear time

DOI10.4230/LIPIcs.WABI.2019.8zbMath1495.92039OpenAlexW3012854845MaRDI QIDQ5091735

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

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)

Related Items (1)

Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics

Cites Work

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

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