Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Syllable-PBWT for space-efficient haplotype long-match query.

Bioinformatics (Oxford, England) - 1 Jan 2023

Wang Victor, Naseri Ardalan, Zhang Shaojie, Zhi Degui

Abstract excerpt

MOTIVATION: The positional Burrows-Wheeler transform (PBWT) has led to tremendous strides in haplotype matching on biobank-scale data. For genetic genealogical search, PBWT-based methods have optimized the asymptotic runtime of finding long matches between a query haplotype and a predefined panel of haplotypes. However, to enable fast query searches, the full-sized panel and PBWT data structures must be kept in...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Genome
Share to Genotype

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Haplotypes

Share to Sequence Analysis, DNA

Share to Software

Source

Open in PubMed Open full text

Identifiers

PMID: 36440908
DOI: 10.1093/bioinformatics/btac734
PMCID: PMC9805553

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Syllable-PBWT for space-efficient haplotype long-match query.PMID 36440908Read ↗

An Efficient Dynamic Data Structure for Haplotype Matching and Compression on Biobank-Scale Data.Semantic proximity Read ↗

Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT).Semantic proximity Read ↗

Prefix-Free Parsing for Building Big BWTsSemantic proximity Read ↗

Haplotype Matching with GBWT for Pangenome GraphsSemantic proximity Read ↗

A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmersSemantic proximity Read ↗

A natural encoding of genetic variation in a Burrows-Wheeler Transform to enable mapping and genome inferenceSemantic proximity Read ↗

Columba: Fast Approximate Pattern Matching with Optimized Search SchemesSemantic proximity Read ↗

Indexing k-mers in linear space for quality value compression.Semantic proximity Read ↗

GTC: how to maintain huge genotype collections in a compressed form.Semantic proximity Read ↗

<i>k</i> ache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming <i>k</i> -mer operationsSemantic proximity Read ↗

Minimal positional substring cover is a haplotype threading alternative to Li and Stephens model.Semantic proximity Read ↗

Efficient Construction of a Complete Index for Pan-Genomics Read AlignmentSemantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.