Finding all maximal perfect haplotype blocks in linear time (Q5091735): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Finding all maximal perfect haplotype blocks in linear time
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11038/pdf/LIPIcs-WABI-2019-8.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3012854845 / rank
 
Normal rank
Property / title
 
Finding all maximal perfect haplotype blocks in linear time (English)
Property / title: Finding all maximal perfect haplotype blocks in linear time (English) / rank
 
Normal rank

Latest revision as of 09:04, 30 July 2024

scientific article; zbMATH DE number 7564384
Language Label Description Also known as
English
Finding all maximal perfect haplotype blocks in linear time
scientific article; zbMATH DE number 7564384

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2022
    0 references
    population genomics
    0 references
    selection coefficient
    0 references
    haplotype block
    0 references
    positional Burrows-Wheeler transform
    0 references
    Finding all maximal perfect haplotype blocks in linear time (English)
    0 references

    Identifiers