An Efficient Dynamic Data Structure for Haplotype Matching and Compression on Biobank-Scale Data.

IF 1.3 4区 生物学 Q4 BIOCHEMICAL RESEARCH METHODS
Journal of Computational Biology Pub Date : 2026-01-01 Epub Date: 2025-11-07 DOI:10.1177/15578666251385570
Pramesh Shakya, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
{"title":"An Efficient Dynamic Data Structure for Haplotype Matching and Compression on Biobank-Scale Data.","authors":"Pramesh Shakya, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang","doi":"10.1177/15578666251385570","DOIUrl":null,"url":null,"abstract":"<p><p>Advanced genotyping technology has made it feasible for large numbers of individuals to be genotyped resulting in many biobanks across the world. These biobanks are an excellent resource to study haplotype matching at a large scale. Durbin's positional Burrows-Wheeler transform (PBWT) supports efficient haplotype matching and queries given a panel of haplotypes and scales well with large data. It has been widely used for statistical phasing, imputation, and identity-by-descent detection. However, the original PBWT panel does not support updates when haplotypes need to be added or deleted from the panel. Dynamic-PBWT (d-PBWT) solved this problem but is not memory efficient. While the memory constraint problem of the PBWT has been tackled by Syllable-PBWT and <math><mi>μ</mi></math>-PBWT, these are static data structures that do not allow updates. In addition, Syllable-PBWT only supports long-match query and <math><mi>μ</mi></math>-PBWT only supports set-maximal match query, limiting their functionality in the compressed form. In this article, we present Dynamic <math><mi>μ</mi></math>-PBWT (which can also be seen as compressed d-PBWT) that is memory efficient and supports dynamic updates. We run-length compress PBWT to achieve a better compression rate and store the runs in self-balancing trees to enable dynamic updates. We show that the number of updates per insertion or deletion in the tree at each site is constant regardless of the number of haplotypes in the panel and the updates can be made without decompressing the index. Moreover, we use orders of magnitude less memory than d-PBWT. We provide set maximal match and long match query algorithms on Dynamic <math><mi>μ</mi></math>-PBWT. The long match query algorithm can easily be extended back to the original <math><mi>μ</mi></math>-PBWT. We benchmark all algorithms on the UK Biobank and 1000 Genomes Project dataset. Overall, the flexibility and space-efficiency of Dynamic <math><mi>μ</mi></math>-PBWT make it a potential index data structure for biobank-scale genetic data maintenance and analysis.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":"67-89"},"PeriodicalIF":1.3000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13159979/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Biology","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1177/15578666251385570","RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/11/7 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Advanced genotyping technology has made it feasible for large numbers of individuals to be genotyped resulting in many biobanks across the world. These biobanks are an excellent resource to study haplotype matching at a large scale. Durbin's positional Burrows-Wheeler transform (PBWT) supports efficient haplotype matching and queries given a panel of haplotypes and scales well with large data. It has been widely used for statistical phasing, imputation, and identity-by-descent detection. However, the original PBWT panel does not support updates when haplotypes need to be added or deleted from the panel. Dynamic-PBWT (d-PBWT) solved this problem but is not memory efficient. While the memory constraint problem of the PBWT has been tackled by Syllable-PBWT and μ-PBWT, these are static data structures that do not allow updates. In addition, Syllable-PBWT only supports long-match query and μ-PBWT only supports set-maximal match query, limiting their functionality in the compressed form. In this article, we present Dynamic μ-PBWT (which can also be seen as compressed d-PBWT) that is memory efficient and supports dynamic updates. We run-length compress PBWT to achieve a better compression rate and store the runs in self-balancing trees to enable dynamic updates. We show that the number of updates per insertion or deletion in the tree at each site is constant regardless of the number of haplotypes in the panel and the updates can be made without decompressing the index. Moreover, we use orders of magnitude less memory than d-PBWT. We provide set maximal match and long match query algorithms on Dynamic μ-PBWT. The long match query algorithm can easily be extended back to the original μ-PBWT. We benchmark all algorithms on the UK Biobank and 1000 Genomes Project dataset. Overall, the flexibility and space-efficiency of Dynamic μ-PBWT make it a potential index data structure for biobank-scale genetic data maintenance and analysis.

生物样本数据单倍型匹配与压缩的高效动态数据结构。
先进的基因分型技术使得对大量个体进行基因分型成为可能,从而在世界各地建立了许多生物库。这些生物库为大规模研究单倍型匹配提供了良好的资源。Durbin的位置Burrows-Wheeler变换(PBWT)支持高效的单体型匹配和给定单体型面板的查询,并且可以很好地扩展到大数据。它已广泛应用于统计相位,imputation和身份下降检测。然而,当单体型需要从面板中添加或删除时,原始PBWT面板不支持更新。动态pbwt (d-PBWT)解决了这个问题,但内存效率不高。虽然音节-PBWT和μ-PBWT已经解决了PBWT的内存约束问题,但它们都是不允许更新的静态数据结构。此外,音节- pbwt只支持长匹配查询,μ-PBWT只支持集最大匹配查询,限制了压缩形式下的功能。在本文中,我们提出了动态μ-PBWT(也可以看作是压缩的d-PBWT),它具有内存效率并支持动态更新。我们将运行长度压缩PBWT以获得更好的压缩率,并将运行存储在自平衡树中以实现动态更新。我们表明,无论面板中单倍型的数量如何,每个位点的树中每次插入或删除的更新次数是恒定的,并且可以在不解压索引的情况下进行更新。此外,我们使用的内存比d-PBWT少几个数量级。给出了基于动态μ-PBWT的集最大匹配和长匹配查询算法。长匹配查询算法可以很容易地扩展回原始μ-PBWT。我们在英国生物银行和1000基因组计划数据集上对所有算法进行基准测试。总体而言,动态μ-PBWT的灵活性和空间效率使其成为生物样本库规模遗传数据维护和分析的潜在索引数据结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computational Biology
Journal of Computational Biology 生物-计算机:跨学科应用
CiteScore
3.60
自引率
5.90%
发文量
113
审稿时长
6-12 weeks
期刊介绍: Journal of Computational Biology is the leading peer-reviewed journal in computational biology and bioinformatics, publishing in-depth statistical, mathematical, and computational analysis of methods, as well as their practical impact. Available only online, this is an essential journal for scientists and students who want to keep abreast of developments in bioinformatics. Journal of Computational Biology coverage includes: -Genomics -Mathematical modeling and simulation -Distributed and parallel biological computing -Designing biological databases -Pattern matching and pattern detection -Linking disparate databases and data -New tools for computational biology -Relational and object-oriented database technology for bioinformatics -Biological expert system design and use -Reasoning by analogy, hypothesis formation, and testing by machine -Management of biological databases
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书